Silver machine

From Wikipedia, the free encyclopedia
Not to be confused with Silver Machines.

In set theory, Silver machines are devices used for bypassing the use of fine structure in proofs of statements holding in L. They were invented by set theorist Jack Silver as a means of proving global square holds in the constructible universe.

Preliminaries

An ordinal \alpha is *definable from a class of ordinals X if and only if there is a formula \phi (\mu _{0},\mu _{1},\ldots ,\mu _{n}) and \exists \beta _{1},\ldots ,\beta _{n},\gamma \in X such that \alpha is the unique ordinal for which \models _{{L_{\gamma }}}\phi (\alpha ^{\circ },\beta _{1}^{\circ },\ldots ,\beta _{n}^{\circ }) where for all \alpha we define \alpha ^{\circ } to be the name for \alpha within L_{\gamma }.

A structure \langle X,<,(h_{i})_{{i<\omega }}\rangle is eligible if and only if:

  1. X\subseteq On.
  2. < is the ordering on On restricted to X.
  3. \forall i,h_{i} is a partial function from X^{{k(i)}} to X, for some integer k(i).

If N=\langle X,<,(h_{i})_{{i<\omega }}\rangle is an eligible structure then N_{\lambda } is defined to be as before but with all occurrences of X replaced with X\cap \lambda .

Let N^{1},N^{2} be two eligible structures which have the same function k. Then we say N^{1}\triangleleft N^{2} if \forall i\in \omega and \forall x_{1},\ldots ,x_{{k(i)}}\in X^{1} we have:

h_{i}^{1}(x_{1},\ldots ,x_{{k(i)}})\cong h_{i}^{2}(x_{1},\ldots ,x_{{k(i)}})

Silver machine

A Silver machine is an eligible structure of the form M=\langle On,<,(h_{i})_{{i<\omega }}\rangle which satisfies the following conditions:

Condensation principle. If N\triangleleft M_{\lambda } then there is an \alpha such that N\cong M_{\alpha }.

Finiteness principle. For each \lambda there is a finite set H\subseteq \lambda such that for any set A\subseteq \lambda +1 we have

M_{{\lambda +1}}[A]\subseteq M_{\lambda }[(A\cap \lambda )\cup H]\cup \{\lambda \}

Skolem property. If \alpha is *definable from the set X\subseteq On, then \alpha \in M[X]; moreover there is an ordinal \lambda <[sup(X)\cup \alpha ]^{+}, uniformly \Sigma _{1} definable from X\cup \{\alpha \}, such that \alpha \in M_{\lambda }[X].

References

  • Keith J Devlin (1984). "Chapter IX". Constructibility. ISBN 0-387-13258-9.  - Please note that errors have been found in some results in this book concerning Kripke Platek set theory.
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.