arXiv Analytics

Sign in

arXiv:2007.05885 [math.LO]AbstractReferencesReviewsResources

On Non-standard Models of Arithmetic with Uncountable Standard Systems

Wei Wang

Published 2020-07-12Version 1

In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel proved that Scott's characterization also applies to non-standard models of arithmetic with cardinality $\aleph_1$. But the question, whether the limit on cardinality can be removed from the above characterization, remains a long standing question, known as the Scott Set Problem. This article presents two constructions of non-standard models of arithmetic with non-trivial uncountable standard systems. The first one leads to a new proof of the above theorem of Knight and Nadel, and the second proves the existence of models with non-trivial standard systems of cardinality the continuum. A partial answer to the Scott Set Problem under certain set theoretic hypothesis also follows from the second construction.

Related articles: Most relevant | Search more
arXiv:1712.06503 [math.LO] (Published 2017-12-18)
Neutrally Expandable Models of Arithmetic
arXiv:0908.1718 [math.LO] (Published 2009-08-12, updated 2010-10-27)
The complexity of classification problems for models of arithmetic
arXiv:1109.0949 [math.LO] (Published 2011-09-05, updated 2012-01-27)
Concerning the Representability of Self-Reference in Arithmetic