3.6.3 Coding ω- and wellfounded models

We now work in the language of set theory and use “E” in place of the symbol ̂∈. The best models of set theory are of course those that are wellfounded.

Proposition 3.6.2. {E |〈ω, Ecodes a wellfounded model} is image.

Proof.ω, E〉 codes a wellfounded model if and only if there is no function f : ωω such that for any pair (i, j), i < j if and only if 〈ω, E〉 ⊨ f(j)Ef(i).

Coding wellfounded models is a complicated matter, though such models are the “bona fide models” of set theory. The next best thing is to code ω-models. The reason for studying ω-models is that in considering reals or sets of reals in such ...

Get Recursion Theory now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.