Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T12:12:39.989Z Has data issue: false hasContentIssue false
  • English
  • Français

Effective model theory vs. recursive model theory

Published online by Cambridge University Press:  12 March 2014

John Chisholm
John Chisholm*
Affiliation:
Department of Mathematics, Western Illinois University, Macomb, Illinois 61455
Get access Rights & Permissions [Opens in a new window]

Extract

Recursive model theory is supposed to be the study of the effectiveness of constructions and theorems in model theory. This often involves getting “effective” versions of various classical model-theoretic notions. The traditional way of doing this is to restrict attention to recursive models, and recursive isomorphisms between them, etc. Thus for example the following definition appears in the literature (in [3] and [1]).

Definition. Given a recursive model A and an n Є ω, a subset R ⊆ An is called intrinsically r.e. provided that for every recursive model B ≈ A, the isomorphic image in B of R is an r.e. subset of Bn.

It is clear that if R is definable by a (recursive, infinitary) Σ10 formula (with finitely many parameters from A), then R is intrinsically r.e. It seems natural for the converse to be true. Indeed, provided that (A, R) is sufficiently “regular” in a sense made precise in a theorem of Ash and Nerode (see [3]), the converse is true. However, if we drop the (rather strong) regularity conditions, there exist “pathological” examples of intrinsically r.e. relations which are not definable by a Σ10 formula (see [7]).

In this paper, we suggest a rather different approach to studying the effectiveness of model theory, an approach we have dubbed “effective model theory”. The basic idea is to allow arbitrary nonrecursive models, but to require all notions to be relativized to the complexity of the models involved. (Much the same notion has been used in [2] under the name “relatively recursive model theory”.) Thus for example we have the following effective model theory version of the property of being intrinsically r.e.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 55 , Issue 3 , September 1990 , pp. 1168 - 1191
Copyright
Copyright © Association for Symbolic Logic 1990

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.)

References

REFERENCES

[1]Ash, C. J., Stability of recursive structures in arithmetical degrees, Annals of Pure and Applied Logic, vol. 32 (1986), pp. 111–135.CrossRefGoogle Scholar
[2]Ash, C. J.et al., Generic copies of countable structures (unpublished).Google Scholar
[3]Ash, C. J. and Nerode, A., Intrinsically recursive relations, Aspects of recursive algebra (Crossley, J. N., editor), Upside Down A Book Co., Steel's Creek, Australia, 1981, pp. 26–41.Google Scholar
[4]Goncharov, S. S., The quantity of nonautoequivalent constructivizations, Algebra and Logic, vol. 16 (1977), pp. 169–185.CrossRefGoogle Scholar
[5]Keisler, H. J., Model theory for infinitary logic, North-Holland, Amsterdam, 1971.Google Scholar
[6]Knight, Julia F., Degrees coded in jumps of orderings, this Journal, vol. 51 (1986), pp. 1034–1042.Google Scholar
[7]Manasse, Mark Steven, Techniques and counterexamples in almost categorical recursive model theory, Ph.D. thesis, University of Wisconsin, Madison, Wisconsin, 1982.Google Scholar
[8]Manasse, Mark and Slaman, Theodore A., Immutably r.e. relations (unpublished).Google Scholar
[9]Rogers, Hartley Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar