Advertisement

Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory

  • Denis R. Hirschfeldt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3526)

Abstract

I will discuss some recent results in the analysis of the computability-theoretic and proof-theoretic content of Vaughtian model theory, that is, the study of special models such as prime, saturated, and homogeneous models, and associated results such as the omitting types theorem. This is a research program dating back to the 1970’s (see [4]), but which has recently picked up steam with the application of finer computability-theoretic tools. Here are two examples.

Keywords

Model Theory Homogeneous Model Computable Function Partial Type Logic Find 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Goncharov, S.S., Nurtazin, A.T.: Constructive models of complete decidable theories. Algebra and Logic 12, 67–77 (1973)CrossRefGoogle Scholar
  2. 2.
    Millar, T.S.: Foundations of recursive model theory. Ann. Math. Logic 13, 45–72 (1978)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Millar, T.S.: Omitting types, type spectrum, and decidability. J. Symbolic Logic 48, 171–181 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Harizanov, V.S.: Pure computable model theory. In: Ershov, Y.L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics. Stud. Logic Found. Math., pp. 138–139. Elsevier Science, Amsterdam (1998) 3–114Google Scholar
  5. 5.
    Slaman, T.A.: Relative to any nonrecursive set. Proc. Amer. Math. Soc. 126, 2117–2122 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Wehner, S.: Enumerations, countable structures, and Turing degrees. Proc. Amer. Math. Soc. 126, 2131–2139 (1998)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Denis R. Hirschfeldt
    • 1
  1. 1.Department of MathematicsThe University of ChicagoChicagoUSA

Personalised recommendations