On Non-standard Models of Arithmetic with Uncountable Standard Systems

arXiv2007.05885MaRDI QIDQ6344902FDOQ6344902

Authors: Wei Wang 

Publication date: 11 July 2020

Abstract: 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 $alep{h}_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.

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15) Continuum hypothesis and Martin's axiom (03E50)

This page was built for publication: On Non-standard Models of Arithmetic with Uncountable Standard Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344902)