Searching for "Induction Principles for Sets." – sorted by Relevance.
-
On Defining Functions on Binary Trees
- trees and binary grammars. We recast the induction principle for the set of parse trees of binary
- Cited by 4 (2 self) – Add To MetaCart
-
Extensions to the Support Vector Method
- function), an induction principle, a set of decision functions, and finally an algorithm that implements
- Cited by 6 (0 self) – Add To MetaCart
-
Nominal techniques in Isabelle/HOL
- -terms and adapts some notions of the nominal logic work for this construction. An induction principle for this set
- Cited by 33 (6 self) – Add To MetaCart
-
The inductive approach to verifying cryptographic protocols
- . For reasoning about an inductively defined set, we may use the corresponding induction principle. For the set N
- Cited by 343 (26 self) – Add To MetaCart
-
Proving Properties of Security Protocols by Induction
- the corresponding induction principle. For the set N, it is the usual mathematical induction: to prove P (n
- Cited by 135 (8 self) – Add To MetaCart
-
A case study in machine-assisted proofs: The Integers form an Integral Domain
- enough to work with. For that reason the formalization of an induction principle for the set is proposed
- Cited by 6 (0 self) – Add To MetaCart
-
Interactive Correctness Proofs for Software Modules Using KIV
- principle for sets. The operations of SETNAT will be implemented by procedures that operate on lists
- Cited by 20 (12 self) – Add To MetaCart
-
Theorem Provers Survey
- , relations, induction principles, sets, and ordinal notations. Lemmas may be used before they are proved (and
- Add To MetaCart
-
Tactics in KIV
- the (loose) semantics to the class of term-generated models, and gives a structural induction principle
- Cited by 1 (0 self) – Add To MetaCart
-
Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering
- predicate. Both rules embody an induction principle for the set lfp F . The second (stronger) rule is easily
- Cited by 19 (5 self) – Add To MetaCart

