Models and Computability: Effective Model Theory: The Number of Models and Their Complexity

Effective model theory studies model theoretic notions with an eye towards issues of computability and effectiveness. We consider two possible starting points. If the basic objects are taken to be theories, then the appropriate effective version investigates decidable theories (the set of theorems is computable) and decidable structures (ones with decidable theories). If the objects of initial interest are typical mathematical structures, then the starting point is computable structures. We present an introduction to both of these aspects of effective model theory organized roughly around the themes of the number and types of models of theories with particular attention to categoricity (as either a hypothesis or a conclusion) and the analysis of various computability issues in families of models.

[1]  S. Goncharov,et al.  Algorithmic dimension of nilpotent groups , 1989 .

[2]  Julia F. Knight,et al.  Generic Copies of Countable Structures , 1989, Ann. Pure Appl. Log..

[3]  A. Nerode,et al.  Effective content of field theory , 1979 .

[4]  Terrence Millar.  Omitting Types, Type Spectrums, and Decidability , 1983, J. Symb. Log..

[5]  O. V. Kudinov,et al.  An autostable 1-decidable model without a computable Scott family of ∃-formulas , 1996 .

[6]  Terrence Millar.  Foundations of recursive model theory , 1978 .

[7]  Julia F. Knight,et al.  Possible Degrees in Recursive Copies II , 1997, Ann. Pure Appl. Log..

[8]  Richard A. Shore,et al.  Computable Isomorphisms, Degree Spectra of Relations, and Scott Families , 1998, Ann. Pure Appl. Log..

[9]  S. S. Goncharov,et al.  Autostability and computable families of constructivizations , 1975 .

[10]  André Nies,et al.  Computable Models of Theories with Few Models , 1997, Notre Dame J. Formal Log..

[11]  S. S. Goncharov,et al.  Autostability of models and Abelian groups , 1980 .

[12]  Jeffrey B. Remmel.  Recursively categorical linear orderings , 1981 .

[13]  S. S. Goncharov,et al.  Autostability of models , 1980 .

[14]  John T. Baldwin,et al.  On strongly minimal sets , 1971, Journal of Symbolic Logic.

[15]  Julia F. Knight,et al.  Pairs of Recursive Structures , 1990, Ann. Pure Appl. Log..

[16]  S. S. Goncharov.  Strong constructivizability of homogeneous models , 1978 .

[17]  John Chisholm,et al.  Effective model theory vs. recursive model theory , 1990, Journal of Symbolic Logic.

[18]  Theodore A. Slaman,et al.  Relatively recursive expansions II , 1992 .

[19]  Valentina S. Harizanov.  The Possible Turing Degree of the Nonzero Member in a Two Element Degree Spectrum , 1993, Ann. Pure Appl. Log..

[20]  R. Vaught,et al.  Denumerable Models of Complete Theories , 1970 .

[21]  Julia F. Knight,et al.  Permitting, Forcing, and Copying of a Given Recursive Relation , 1997, Ann. Pure Appl. Log..

[22]  John T. Baldwin,et al.  a T is Finite for ℵ 1 -Categorical T , 1973 .

[23]  Terrence Millar.  A Complete, Decidable Theory with Two Decidable Models , 1979, J. Symb. Log..

[24]  Joseph R. Shoenfield,et al.  Degrees of unsolvability , 1959, North-Holland mathematics studies.

[25]  Julia F. Knight,et al.  A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas , 1994, Math. Log. Q..

[26]  Christopher J. Ash.  Categoricity in hyperarithmetical degrees , 1987, Ann. Pure Appl. Log..

[27]  Leo Harrington.  Recursively Presentable Prime Models , 1974, J. Symb. Log..

[28]  A. T. Nurtazin,et al.  Strong and weak constructivization and computable families , 1974 .

[29]  Edward R. Griffor.  Handbook of Computability Theory , 1999, Handbook of Computability Theory.

[30]  Jeffrey B. Remmel,et al.  Recursive isomorphism types of recursive Boolean algebras , 1981, Journal of Symbolic Logic.

[31]  N. S. Romanovskii,et al.  Nilpotent groups of finite algorithmic dimension , 1989 .

[32]  S. S. Goncharov.  Constructive models of N1-categorical theories , 1978 .

[33]  Richard A. Shore,et al.  Computably categorical structures and expansions by constants , 1999, Journal of Symbolic Logic.

[34]  Richard A. Shore,et al.  Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families" , 1999, Ann. Pure Appl. Log..

[35]  V. Selivanov.  Enumerations of families of general recursive functions , 1976 .

[36]  S. S. Goncharov,et al.  Constructivizability of superatomic Boolean algebras , 1973 .

[37]  Christopher J. Ash.  Stability of recursive structures in arithmetical degrees , 1986, Ann. Pure Appl. Log..

[38]  John Chisholm.  The Complexity of Intrinsically R.E. Subsets of Existentially Decidable Models , 1990, J. Symb. Log..

[39]  G. Sacks.  ON THE DEGREES LESS THAN 0 , 1963 .

[40]  K. Zh. Kudaibergenov.  A theory with two strongly constructivizable models , 1979 .

[41]  Terrence Millar.  Recursive Categoricity and Persistence , 1986, J. Symb. Log..

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