Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory
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 ), but which has recently picked up steam with the application of finer computability-theoretic tools. Here are two examples.
KeywordsModel Theory Homogeneous Model Computable Function Partial Type Logic Find
- 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