The Kripke–Platek set theory (KP), pronounced /ˈkrɪpki ˈplɑːtɛk/, is an axiomatic set theory developed by Saul Kripke and Richard Platek. The theory can...
10 KB (1,586 words) - 11:54, 3 May 2025
The Kripke–Platek set theory with urelements (KPU) is an axiom system for set theory with urelements, based on the traditional (urelement-free) Kripke–Platek...
5 KB (664 words) - 21:23, 21 April 2024
include Kripke–Platek set theory with urelements and the variant of Von Neumann–Bernays–Gödel set theory described by Mendelson. In type theory, an object...
8 KB (995 words) - 22:00, 20 November 2024
General set theory Kripke–Platek set theory with urelements Morse–Kelley set theory Naive set theory New Foundations Pocket set theory Positive set theory S...
5 KB (448 words) - 01:47, 13 February 2025
List of mathematical logic topics (category Articles with short description)
Well-founded set Well-order Power set Russell's paradox Set theory Alternative set theory Axiomatic set theory Kripke–Platek set theory with urelements Morse–Kelley...
14 KB (1,012 words) - 00:08, 16 November 2024
set theory Pocket set theory Naive set theory S (set theory) Double extension set theory Kripke–Platek set theory Kripke–Platek set theory with urelements...
2 KB (144 words) - 04:21, 26 November 2024
saying whether an object is a set. Later versions of set theory often assume that all objects are sets so there are no urelements and there is no need for...
15 KB (2,244 words) - 04:47, 5 June 2025
pure sets and prevent its models from containing urelements (elements that are not themselves sets). Furthermore, proper classes (collections of mathematical...
46 KB (6,252 words) - 13:43, 7 June 2025
Zermelo set theory sufficient for the Peano axioms and finite sets; Kripke–Platek set theory, which omits the axioms of infinity, powerset, and choice, and...
54 KB (6,575 words) - 19:15, 10 June 2025
Axiom schema of specification (category Axioms of set theory)
sets, called semisets. Even in systems related to ZFC, this scheme is sometimes restricted to formulas with bounded quantifiers, as in Kripke–Platek set...
15 KB (2,207 words) - 05:19, 24 March 2025
Richard Platek, Kripke–Platek set theory Robert Platek, Spezia Calcio owner Kripke–Platek set theory Kripke–Platek set theory with urelements This page...
1,002 bytes (140 words) - 17:29, 22 March 2023
Von Neumann universe (redirect from Rank (set theory))
inclusion of urelements, from which he constructed a transfinite recursive hierarchy in 1930. Such urelements are used extensively in model theory, particularly...
21 KB (2,818 words) - 04:27, 23 June 2025
The power set of a transitive set without urelements is transitive. The transitive closure of a set X {\displaystyle X} is the smallest (with respect to...
12 KB (1,222 words) - 14:29, 14 October 2024
Singleton (mathematics) (redirect from Singleton (set theory))
quantification – Logical quantifier Urelement – Concept in set theory Stoll, Robert (1961). Sets, Logic and Axiomatic Theories. W. H. Freeman and Company. pp...
6 KB (828 words) - 18:55, 11 May 2025
Korea Polytechnic University, South Korea Kripke–Platek set theory with urelements, an axiom system for set theory Kwantlen Polytechnic University, a public...
544 bytes (94 words) - 19:04, 21 February 2023
New Foundations (redirect from Typed set theory)
of choice is false in NF (without urelements). In 1969, Jensen showed that adding urelements to NF yields a theory (NFU) that is provably consistent....
50 KB (8,050 words) - 11:41, 9 June 2025
Size. Monk (1980) and Rubin (1967) are set theory texts built around MK; Rubin's ontology includes urelements. These authors and Mendelson (1997: 287)...
21 KB (3,186 words) - 12:28, 4 February 2025
cardinals. KP Kripke–Platek set theory Kripke 1. Saul Kripke 2. Kripke–Platek set theory consists roughly of the predicative parts of set theory Kuratowski...
91 KB (11,628 words) - 12:22, 21 March 2025
Axiom of regularity (redirect from Well founded set)
Zermelo. Urelements are objects that are not sets, but which can be elements of sets. In ZF set theory, there are no urelements, but in some other set theories...
26 KB (3,247 words) - 15:49, 19 June 2025
Ordinal number (redirect from Ordinal number (set theory))
a transitive set of transitive sets. These definitions cannot be used in non-well-founded set theories. In set theories with urelements, one has to further...
48 KB (6,703 words) - 04:03, 30 May 2025
Axiom of extensionality (category Urelements)
pure set theory, all members of sets are themselves sets, but not in set theory with urelements. The axiom's usefulness can be seen from the fact that...
14 KB (1,879 words) - 16:29, 24 May 2025
Axiom of limitation of size (category Axioms of set theory)
R(α) instead of Vα). If V0 is a set of urelements, the standard definition eliminates the urelements at V1. If X is a set, then there is a class Y such...
48 KB (6,695 words) - 19:50, 17 June 2025
the reverse implications (from weak to strong) in ZF with urelements are found using model theory. Most of these finiteness definitions and their names...
15 KB (2,013 words) - 15:42, 10 May 2025
hereditary set is interesting only in a context in which there may be urelements. The inductive definition of hereditary sets presupposes that set membership...
2 KB (279 words) - 22:23, 29 May 2025
Axiom schema of replacement (category Axioms of set theory)
In set theory, the axiom schema of replacement is a schema of axioms in Zermelo–Fraenkel set theory (ZF) that asserts that the image of any set under any...
22 KB (3,558 words) - 04:45, 6 June 2025
Willard Van Orman Quine (category Set theorists)
with Zermelo set theory without Choice. A modification of NF, NFU, due to R. B. Jensen and admitting urelements (entities that can be members of sets...
55 KB (6,469 words) - 18:03, 23 June 2025
Axiom of choice (category Articles with short description)
axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing...
60 KB (7,931 words) - 03:30, 22 June 2025
Mathematical logic (category Articles with short description)
from the axioms of Zermelo's set theory with urelements. Later work by Paul Cohen showed that the addition of urelements is not needed, and the axiom...
69 KB (8,370 words) - 19:12, 10 June 2025
Inaccessible cardinal (category Articles with short description)
In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal. A cardinal is a weakly...
17 KB (2,405 words) - 18:01, 20 May 2025
concepts in set theory. The implementation of a number of basic mathematical concepts is carried out in parallel in ZFC (the dominant set theory) and in NFU...
59 KB (10,960 words) - 22:58, 2 May 2025