kripke-platek set theory with urelements

The Kripke-Platek set theory with urelements (KPU) is an axiom system for set theory with urelements that is considerably weaker than the familiar system ZF.

Preliminaries

The usual way of stating the axioms presumes a two sorted first order language

L^*

with a single binary relation symbol

\in

. 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. The letters

x,y,z,...

may denote both sets and urelements. 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:

p\in a

b\in a

. The statement of the axioms also requires reference to a certain collection of formulae called

\Delta_0

-formulae. The collection

\Delta_0

consists of those formulae that can be built using the constants,

\in

\neg

\wedge

\vee

, and bounded quantification. That is quantification of the form

\forall x \in a

\exists x \in a

where

a

is given set.

Axioms

The axioms of KPU are the universal closures of the following formulae:

Extensionality: $\forall x (x \in a \leftrightarrow x\in b)\rightarrow a=b$

Foundation: This is an axiom schema where for every formula $\phi(x)$ we have $\exists x \phi(x) \rightarrow \exists x\, (\phi(x) \wedge \forall y\in x\,\neg \phi(x))$ .

Pairing: $\exists a\, (x\in a \land y\in a )$

Union: $\exists a \forall x \in b \forall y\in x\, (y \in a)$

$\Delta_0$ -Separation: This is again an axiom schema, where for every $\Delta_0$ -formula $\phi(x)$ we have the following $\exists a \forall x \in b\,(x\in a \leftrightarrow x\in b \wedge \phi(x) )$ .

$\Delta_0$ -Collection: This is also an axiom schema, for every $\Delta_0$ -formula $\phi(x,y)$ we have $\forall x \in a\exists y\, \phi(x,y)\rightarrow \exists b\forall x \in a\exists y\in b\, \phi(x,y)$ .

Set Existence: $\exists a\, (a=a)$

Additional Assumptions

Technically these are axioms that describe the partition of objects into sets and urelements.

$\forall p \forall a \, (p \neq a)$

$\forall p \forall x \, (x \notin p)$

Applications

KPU can be applied to the model theory of infinitary languages. Models of KPU considered as sets inside a maximal universe that are transitive as such are called admissible sets.

External links

Admissible Set Theory
Logic of Abstract Existence
Jon Barwise, Admissible Sets and Structures, Springer, ISBN 3540074511

<< Previous

Word Browser

Next >>

racing post
gerhard ringel
manarkadu
ayrton
arthur heffter
peace testimony
the iron man: a musical
antonio vivarini
heffter research institute
elmar huseynov
suncreek united methodist church

bartolommeo vivarini
dukus horant
airfast indonesia
mediacorp tv channel 5
brouwerij duvel moortgat
george roby dempster
heneage finch, 1st earl of aylesford
spanish ship santissima trinidad
chiam see tong
reichsleiter
british s class submarine

barbelo
volcanic plug
hammer drill
matthias rath
himerius
treehouse of horror ix
college of the redwoods
westway (soap opera)
joseph corbett, jr.
hermae
the red balloon

samuel korecki
craig newmark
calpe
bires de chimay
hockley (birmingham)
tesco vee
tile engine
radio 210
ignaz brll
svecchachara
chesterfield, virginia