Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-19T04:37:21.339Z Has data issue: false hasContentIssue false
  • English
  • Français

A new spectrum of recursive models using an amalgamation construction

Published online by Cambridge University Press:  12 March 2014

Uri Andrews
Uri Andrews*
Affiliation:
Department of Mathematics, University of Wisconsin-Madison, 480 Lincoln Drive, Madison, Wisconsin 53706-13886, USA, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We employ an infinite-signature Hrushovski amalgamation construction to yield two results in Recursive Model Theory. The first result, that there exists a strongly minimal theory whose only recursively presentable models are the prime and saturated models, adds a new spectrum to the list of known possible spectra. The second result, that there exists a strongly minimal theory in a finite language whose only recursively presentable model is saturated, gives the second non-trivial example of a spectrum produced in a finite language.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 76 , Issue 3 , September 2011 , pp. 883 - 896
Copyright
Copyright © Association for Symbolic Logic 2011

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] Andrews, Uri, New spectra of strongly minimal theories in finite languages, Annals of Pure and Applied Logic, vol. 162 (2011), no. 5, pp. 367–372.CrossRefGoogle Scholar
[2] Baldwin, John T. and Lachlan, Alistair H., On strongly minimal sets, this Journal, vol. 36 (1971), pp. 79–96.Google Scholar
[3] Goncharov, Sergei S., Constructive models of N 1-categorical theories, Akademiya Nauk Soyuza SSR. Matematicheskie Zametki, vol. 23 (1978), no. 6, pp. 885–888.Google Scholar
[4] Herwig, Bernhard, Lempp, Steffen, and Ziegler, Martin, Constructive models of uncountably categorical theories, Proceedings of the American Mathematical Society, vol. 127 (1999), no. 12, pp. 3711–3719.CrossRefGoogle Scholar
[5] Hirschfeldt, Denis R., Khoussainov, Bakhadyr, and Semukhin, Pavel, An uncountably categorical theory whose only computably presentable model is saturated, Notre Dame Journal of Formal Logic, vol. 47 (2006), no. 1, pp. 63–71.Google Scholar
[6] Hrushovski, Ehud, A new strongly minimal set, Annals of Pure and Applied Logic, vol. 62 (1993), no. 2, pp. 147–166.CrossRefGoogle Scholar
[7] Khoussainov, Bakhadyr, Nies, Andre, and Shore, Richard A., Computable models of theories with few models, Notre Dame Journal of Formal Logic, vol. 38 (1997), no. 2, pp. 165–178.CrossRefGoogle Scholar
[8] Kudaibergenov, Kanat, On constructive models of undecidable theories, Siberian Mathematical Journal, vol. 21 (1980), pp. 155–158.Google Scholar
[9] Nies, André, A new spectrum of recursive models, Notre Dame Journal of Formal Logic, vol. 40 (1999), no. 3,pp. 307–314.CrossRefGoogle Scholar