Countable Nonstandard Models: Following Skolem’s Approach

Rumen D. Dimitrov () and Valentina Harizanov ()
Additional contact information
Rumen D. Dimitrov: Western Illinois University, Department of Mathematics & Philosophy
Valentina Harizanov: The George Washington University, Department of Mathematics

A chapter in Handbook of the History and Philosophy of Mathematical Practice, 2024, pp 1989-2009 from Springer

Abstract: Abstract In 1934, Skolem gave a remarkable construction of a countable nonstandard model of arithmetic. His construction contains ideas of the ultrapower construction which was introduced in model theory 20 years later. However, typical ultrapower constructions produce uncountable models. Skolem’s construction can also be connected with ideas from computability theory, formalized by Turing and others in 1936. The proof of one of Skolem’s key statements can be interpreted using computability-theoretic notions of indecomposable sets developed in the late 1950s. We favor the computability-theoretic approach and describe the connections of Skolem’s ideas with our current study of cohesive powers of models in computable model theory.

Keywords: Model theory; Computability; Countable models; Cohesive ultrapower (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-40846-5_21

Ordering information: This item can be ordered from
http://www.springer.com/9783031408465

DOI: 10.1007/978-3-031-40846-5_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().