In
set theory
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concer ...
, a discipline within mathematics, an admissible set is a
transitive set
In set theory, a branch of mathematics, a set A is called transitive if either of the following equivalent conditions hold:
* whenever x \in A, and y \in x, then y \in A.
* whenever x \in A, and x is not an urelement, then x is a subset of A.
Si ...
such that
is a
model of
Kripke–Platek set theory
The Kripke–Platek set theory (KP), pronounced , is an axiomatic set theory developed by Saul Kripke and Richard Platek.
The theory can be thought of as roughly the predicative part of ZFC and is considerably weaker than it.
Axioms
In its fo ...
(Barwise 1975).
The smallest example of an admissible set is the set of
hereditarily finite set
In mathematics and set theory, hereditarily finite sets are defined as finite sets whose elements are all hereditarily finite sets. In other words, the set itself is finite, and all of its elements are finite sets, recursively all the way down to ...
s. Another example is the set of
hereditarily countable sets.
See also
*
Admissible ordinal
References
*
Barwise, Jon (1975). ''Admissible Sets and Structures: An Approach to Definability Theory'', Perspectives in Mathematical Logic, Volume 7, Springer-Verlag
Electronic versionon
Project Euclid.
Set theory
{{settheory-stub