To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Marginalia on a theorem o… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Marginalia on a theorem of Woodin

Journal article
Authors Rasmus Blanck
Ali Enayat
Published in Journal of Symbolic Logic
Volume 82
Issue 1
Pages 359-374
ISSN 0022-4812
Publication year 2017
Published at Department of Philosophy, Linguistics and Theory of Science
Pages 359-374
Language en
Keywords Turing machines, Peano arithmetic, nonstandard models, flexible predicates, Kolmogorov complexity.
Subject categories Logic, Mathematical logic


Let ⟨Wn : n ∈ ω⟩ be a canonical enumeration of recursively enumerable sets, and suppose T is a recursively enumerable extension of PA (Peano Arithmetic) in the same language. Woodin (2011) showed that there exists an index e∈ω (that depends on T) with the property that if M is a countable model of T and for some M-finite set s, M satisfies We⊆s, then M has an end extension N that satisfies T + We=s. Here we generalize Woodin’s theorem to all recursively enumerable extensions T of the fragment IΣ1 of PA, and remove the countability restriction on M when T extends PA. We also derive model-theoretic consequences of a classic fixed-point construction of Kripke (1962) and compare them with Woodin’s theorem.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?