SearcharxivSearch

arXiv · 1510.07759

Scott ranks of models of a theory

Abstract

The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{ω_1 ω}$) is the set of Scott ranks of countable models of that theory. In $ZFC + PD$ we give a descriptive-set-theoretic classification of the sets of ordinals which are the Scott spectrum of a theory: they are particular $\boldsymbolΣ^1_1$ classes of ordinals. Our investigation of Scott spectra leads to the resolution (in $ZFC$) of a number of open problems about Scott ranks. We answer a question of Montalbán by showing, for each $α< ω_1$, that there is a $Π^{\mathtt{in}}_2$ theory with no models of Scott rank less than $α$. We also answer a question of Knight and Calvert by showing that there are computable models of high Scott rank which are not computably approximable by models of low Scott rank. Finally, we answer a question of Sacks and Marker by showing that $δ^1_2$ is the least ordinal $α$ such that if the models of a computable theory $T$ have Scott rank bounded below $ω_1$, then their Scott ranks are bounded below $α$.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthew Harrison-Trainor. 2015-10-27. Scott ranks of models of a theory. https://arxiv.org/abs/1510.07759

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO