- Silver machine
-
This article is about the device. For the Hawkwind song, see Silver Machine.
- 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 α is *definable from a class of ordinals X if and only if there is a formula and such that α is the unique ordinal for which where for all α we define to be the name for α within Lγ.
A structure is eligible if and only if:
- .
- < is the ordering on On restricted to X.
- is a partial function from Xk(i) to X, for some integer k(i).
If is an eligible structure then Nλ is defined to be as before but with all occurrences of X replaced with .
Let N1,N2 be two eligible structures which have the same function k. Then we say if and we have:
Silver machine
A Silver machine is an eligible structure of the form which satisfies the following conditions:
Condensation principle. If then there is an α such that .
Finiteness principle. For each λ there is a finite set such that for any set we have
Skolem property. If α is *definable from the set , then ; moreover there is an ordinal , uniformly Σ1 definable from , such that .
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.
Categories:
Wikimedia Foundation. 2010.