Hostname: page-component-7c8c6479df-94d59 Total loading time: 0 Render date: 2024-03-29T05:12:42.472Z Has data issue: false hasContentIssue false

Omitting types, type spectrums, and decidability1

Published online by Cambridge University Press:  12 March 2014

Terrence Millar*
Affiliation:
University of Wisconsin, Madison, Wisconsin 53706

Extract

Notations, conventions, and definitions. {μii < ω} will be an effective enumeration of all partial recursive μi{ω → 2. A type of a theory T will be a set of formulas in the language of T, in finitely many free variables, which is consistent with T. A complete type is a maximal type in some fixed number of free variables. A type is recursive if, relative to some effective enumeration of the formulas of the language, the characteristic function for the type is recursive. A set ψ of recursive types has property P if some set of indices of characteristic functions for all the types in ψ has property P. So, for example, we might say that a set of recursive types is . If is an L-structure, then the type spectrum of , denoted ‘TySp()’, is the set of complete types realized in (we will assume that an n-type has formulas with free variables among {x1, …, xn}). A type spectrum for a theory T is a type spectrum of some model of T. ‘TySp0(T)’ will denote the set of principal types of T.

We will assume that the reader is familiar with Henkin constructions of models, and of passing from a maximal consistent set of sentences, with “Henkin constants”, to a model. In particular, for a theory T in L we will let {aii < ω} be new distinct constant symbols, and {φi < ω} a list of all sentences in the expanded language. ‘ΔN’ will denote the elementary diagram constructed at stage N, and .

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

The preparation of this paper was partially supported by Grant NSF-MCS77-0O802.

References

BIBLIOGRAPHY

[1]Chang, C. C. and Keisler, H. J., Model theory, American Elsevier, New York, 1973.Google Scholar
[2]Millar, T. S., Type structure complexity and decidability (to appear).Google Scholar
[3]Millar, T. S., Counter-examples via model completions (to appear).Google Scholar
[4]Millar, T. S., Foundations of recursive model theory, Annals of Mathematical Logic, vol. 13 (1978), pp. 4572.CrossRefGoogle Scholar