Hanf number for Scott sentences of computable structures

, &
Archive for Mathematical Logic 57 (7-8):889-907 (2018)
  Copy   BIBTEX

Abstract

The Hanf number for a set S of sentences in \ is the least infinite cardinal \ such that for all \, if \ has models in all infinite cardinalities less than \, then it has models of all infinite cardinalities. Friedman asked what is the Hanf number for Scott sentences of computable structures. We show that the value is \. The same argument proves that \ is the Hanf number for Scott sentences of hyperarithmetical structures.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-018-0615-6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Categoricity of computable infinitary theories.W. Calvert, S. S. Goncharov, J. F. Knight & Jessica Millar - 2009 - Archive for Mathematical Logic 48 (1):25-38.
The Hanf number for complete lω1, ω-sentences (without GCH).James E. Baumgartner - 1974 - Journal of Symbolic Logic 39 (3):575 - 578.
The Hanf Number for Complete $L{omega1, omega}$-Sentences (Without GCH).James E. Baumgartner - 1974 - Journal of Symbolic Logic 39 (3):575-578.
On the Hanf number of souslin logic.John P. Burgess - 1978 - Journal of Symbolic Logic 43 (3):568-571.
Atomic models higher up.Jessica Millar & Gerald E. Sacks - 2008 - Annals of Pure and Applied Logic 155 (3):225-241.
Strange Structures from Computable Model Theory.Howard Becker - 2017 - Notre Dame Journal of Formal Logic 58 (1):97-105.
Computable isomorphisms, degree spectra of relations, and Scott families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.
Monotonically Computable Real Numbers.Robert Rettinger, Xizhong Zheng, Romain Gengler & Burchard von Braunmühl - 2002 - Mathematical Logic Quarterly 48 (3):459-479.
Review: W. Hanf, On a Problem of Erdos and Tarski; D. Monk, D. Scott, Additions to Some Results of Erdos and Tarski; A. Hajnal, Remarks on the Theory of W. P. Hanf. [REVIEW]Jean A. Larson - 1974 - Journal of Symbolic Logic 39 (2):332-332.
Index Sets for Classes of High Rank Structures.W. Calvert, E. Fokina, S. S. Goncharov, J. F. Knight, O. Kudinov, A. S. Morozov & V. Puzarenko - 2007 - Journal of Symbolic Logic 72 (4):1418 - 1432.
Number sentences and specificational sentences: Reply to Moltmann.Robert Schwartzkopff - 2015 - Philosophical Studies 173 (8):2173-2192.
Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.
Constructing quasiminimal structures.Levon Haykazyan - 2017 - Mathematical Logic Quarterly 63 (5):415-427.
On the complexity of categoricity in computable structures.Walker M. White - 2003 - Mathematical Logic Quarterly 49 (6):603.
Hanf W.. On a problem of Erdös and Tarski. Fundamenta mathematicae, vol. 53 no. 3 , pp. 325–334.Monk D. and Scott D.. Additions to some results of Erdös and Tarski. Fundamenta mathematicae, vol. 53 no. 3 , pp. 335–343.Hajnal A.. Remarks on the theory of W. P. Hanf. Fundamenta mathematicae vol. 54 no. 1 , pp. 109–113. [REVIEW]Jean A. Larson - 1974 - Journal of Symbolic Logic 39 (2):332-332.

Analytics

Added to PP
2018-02-01

Downloads
19 (#778,470)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Model theory for infinitary logic.H. Jerome Keisler - 1971 - Amsterdam,: North-Holland Pub. Co..
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

View all 11 references / Add more references