COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS

In this paper, we investigate connections between structures present in every generic extension of the universe V and computability theory. We introduce the notion of generic Muchnik reducibility that can be used to to compare the complexity of uncountable structures; we establish basic properties of this reducibility, and study it in the context of generic presentability, the existence of a copy of the structure in every extension by a given forcing. We show that every forcing notion making !2 countable generically presents some countable structure with no copy in the ground model; and that every structure generically presentable by a forcing notion that does not make !2 countable has a copy in the ground model. We also show that any countable structure A that is generically presentable by a forcing notion not collapsing !1 has a countable copy in V , as does any structureB generically Muchnik reducible to a structureA of cardinality@1. The former positive result yields a new proof of Harrington's result that counterexamples to Vaught's conjecture have models of power@1 with Scott rank arbitrarily high below !2. Finally, we show that a rigid structure with copies in all generic extensions by a given forcing has a copy already in the ground model.

[1]  Gerald E. Sacks,et al.  Bounds on Weak Scattering , 2007, Notre Dame J. Formal Log..

[2]  Julia F. Knight,et al.  Comparing two Versions of the Reals , 2016, J. Symb. Log..

[3]  Julia F. Knight,et al.  Computable trees of Scott rank ω1CK, and computable approximation , 2006, Journal of Symbolic Logic.

[4]  M. Rabin.  Computable algebra, general theory and theory of computable fields. , 1960 .

[5]  Maurice Pouzet,et al.  Representation of ideals of relational structures , 2009, Discret. Math..

[6]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[7]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[8]  Angus Macintyre,et al.  Degrees of recursively saturated models , 1984 .

[9]  John T. Baldwin,et al.  Three red herrings around Vaught’s conjecture , 2015 .

[10]  Linda Jean Richter.  Degrees of Structures , 1981, Journal of Symbolic Logic.

[11]  Joel David Hamkins,et al.  Effective mathematics of the uncountable , 2013 .

[12]  Saharon Shelah,et al.  On the Existence of Atomic Models , 1993, J. Symb. Log..

[13]  Jessica Millar,et al.  Atomic models higher up , 2008, Ann. Pure Appl. Log..

[14]  J. Barwise.  Admissible Sets and Structures: An Approach to Definability Theory , 1976 .

[15]  Enrique Casanovas March.  The number of countable models , 2012 .

[16]  H. Jerome Keisler,et al.  Model theory for infinitary logic : logic with countable conjunctions and finite quantifiers , 1971 .

[17]  Antonio Montalbán,et al.  A robuster Scott rank , 2015 .

[18]  Carol R. Karp.  FINITE-QUANTIFIER EQUIVALENCE , 2014 .

[19]  Roland Fraïssé.  Theory of relations , 1986 .

[20]  R. Solovay.  A model of set-theory in which every set of reals is Lebesgue measurable* , 1970 .

[21]  Dana Scott,et al.  LOGIC WITH DENUMERABLY LONG FORMULAS AND FINITE STRINGS OF QUANTIFIERS , 2014 .

[22]  Michael Darwin Morley.  Studies in Model Theory , 1973 .

[23]  Julia A. Knight,et al.  Computable structures and the hyperarithmetical hierarchy , 2000 .