Hanf Number for Scott Sentences of Computable Structures

DOI10.1007/S00153-018-0615-6MaRDI QIDQ6270063arXivDBLPWikidataFDO

Authors S. S. Goncharov, J. F. Knight, Ioannis Souldatos

Publication date 2 February 2016

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00153-018-0615-6

Mathematics Subject Classification ID

Properties of classes of models (03C52) Computable structure theory, computable model theory (03C57) Logic on admissible sets (03C70) Other infinitary logic (03C75) Theory of numerations, effectively presented structures (03D45)

arXiv classification

math.LO

Abstract: The Hanf number for a set $S$ of sentences in $L_{omeg{a}_1,omega}$ (or some other logic) is the least infinite cardinal $kappa$ such that for all $varphiinS$, if $varphi$ has models in all infinite cardinalities less than $kappa$, then it has models of all infinite cardinalities. S-D. 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.

This page was built for publication: Hanf Number for Scott Sentences of Computable Structures

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