On external Scott algebras in nonstandard models of peano arithmetic
Journal of Symbolic Logic 61 (2):586-607 (1996)
Abstract
We prove that a necessary and sufficient condition for a countable set L of sets of integers to be equal to the algebra of all sets of integers definable in a nonstandard elementary extension of ω by a formula of the PA language which may include the standardness predicate but does not contain nonstandard parameters, is as follows: L is closed under arithmetical definability and contains 0 (ω) , the set of all (Gödel numbers of) true arithmetical sentences. Some results related to definability of sets of integers in elementary extensions of ω are includedAuthor's Profile
DOI
10.2307/2275677
My notes
Similar books and articles
Elementary extensions of external classes in a nonstandard universe.Vladimir Kanovei & Michael Reeken - 1998 - Studia Logica 60 (2):253-273.
The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
Inconsistent nonstandard arithmetic.Chris Mortensen - 1987 - Journal of Symbolic Logic 52 (2):512-518.
A model of peano arithmetic with no elementary end extension.George Mills - 1978 - Journal of Symbolic Logic 43 (3):563-567.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
Extending standard models of ZFC to models of nonstandard set theories.Vladimir Kanovei & Michael Reeken - 2000 - Studia Logica 64 (1):37-59.
Uniqueness, collection, and external collapse of cardinals in ist and models of peano arithmetic.V. Kanovei - 1995 - Journal of Symbolic Logic 60 (1):318-324.
Analytics
Added to PP
2009-01-28
Downloads
30 (#392,130)
6 months
1 (#455,463)
2009-01-28
Downloads
30 (#392,130)
6 months
1 (#455,463)
Historical graph of downloads