Epsilon-induction
Sign in to saveIn set theory, \in-induction, also called epsilon-induction or set-induction, is a principle that can be used to prove that all sets satisfy a given property. Considered as an axiomatic principle, it is called the axiom schema of set induction.
~20 min read
Article
20 sectionsContents
- Statement
- In terms of classes
- Related notions of induction
- Ordinals
- Well-founded relations
- For negative predicates
- Infinite descending chains
- Self-membership
- Contrapositive
- Classical equivalents
- Disjunctive form
- Relation to regularity
- History
- Set induction from regularity and transitive sets
- Transitive set existence
- Comparison of epsilon and natural number induction
- Classical equivalents
- Least number principle
- See also
- Reference
In set theory, \in-induction, also called epsilon-induction or set-induction, is a principle that can be used to prove that all sets satisfy a given property. Considered as an axiomatic principle, it is called the axiom schema of set induction.
The principle implies transfinite induction and recursion. It may also be studied in a general context of induction on well-founded relations.
Connections
semantic theory of truth
Entity
set theory
Entity
mathematical logic
Entity
ordinal number
Entity
first-order logic
Entity
formal system
Entity
class
Entity
universal quantification
Entity
type theory
Entity
recursive set
Entity
axiom of regularity
Entity
semantics of logic
Entity
structure
Entity
vacuous truth
Entity
ground expression
Entity
diagram
Entity
Estonia
Country
Tallinn
Entity
logic
Entity
International Standard Book Number
Entity