Skip to content

Kripke–Platek set theory with urelements

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 set theory.

Version
v1 · 2026-09-28 · History
Domain-specific #
10275
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Set Theory, Admissible Recursion Theory, Proof Theory → Mathematics

Core Idea

Kripke–Platek set theory with urelements is treated here as the recurring set theory identity summarized by this source-grounded definition: 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 set theory. 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 set theory. It is considerably weaker than the (relatively) familiar system ZFU.

Scope of Application

  • Documented setting. The purpose of allowing urelements is to allow large or high-complexity objects (such as the set of all reals) to be included in the theory's transitive models without disrupting the usual.

  • Preliminaries. The usual way of stating the axioms presumes a two sorted first order language L^ with a single binary relation symbol \in .

  • Preliminaries. Letters of the sort p,q,r,... designate urelements, of which there may be none, whereas letters of the sort a,b,c,... designate sets.

  • Preliminaries. The letters for sets may appear on both sides of \in , while those for urelements may only appear on the left, i.e. the following are examples of valid expressions.

  • Preliminaries. The statement of the axioms also requires reference to a certain collection of formulae called \Delta0 -formulae.

Clarity

A clear use of Kripke–Platek set theory with urelements names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is 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 set theory.

Manages Complexity

Kripke–Platek set theory with urelements compresses multiple set theory details into a stable diagnostic relation. The source shows both the central mechanism—the collection \Delta0 consists of those formulae that can be built using the constants, \in , \neg , \wedge , \vee , and bounded quantification.—and the practical consequence—the letters for sets may appear on both sides of \in , while those for urelements may only appear on the left.

Abstract Reasoning

  1. Type the carrier. Identify the set theory entities to which the claim applies.
  2. State the relation. Use the source-grounded identity: 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 set theory.
  3. Check operation and conditions. The purpose of allowing urelements is to allow large or high-complexity objects (such as the set of all reals) to be included in the theory's transitive models without disrupting the usual well-ordering and recursion-theoretic properties.

Knowledge Transfer

Within the home domain. Knowledge about Kripke–Platek set theory with urelements transfers literally when a new case preserves the same carrier type, relation, and recognition test. The purpose of allowing urelements is to allow large or high-complexity objects (such as the set of all reals) to be included in the theory's transitive models without disrupting the usual well-ordering and recursion-theoretic properties of the constructible universe; KP is so weak that this is hard to do by traditional means.

Relationships to Other Abstractions

Local relationship map for Kripke–Platek set theory with urelementsParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Kripke–Platek set th…DOMAINPrime abstraction: Formalization — is a kind ofFormalizationPRIME

Current abstraction Kripke–Platek set theory with urelements Domain-specific

Parents (1) — more general patterns this builds on

  • Kripke–Platek set theory with urelements is a kind of Formalization Prime

    Kripke–Platek set theory with urelements is a strict kind of Formalization: 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 set theory.

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

Kripke–Platek set theory with urelements sits in a moderately populated region (42nd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Formal Logic & Language Constructs (20 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08