Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-28T16:19:46.143Z Has data issue: false hasContentIssue false
  • English
  • Français

REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS

Published online by Cambridge University Press:  18 August 2014

DAVID R. BELANGER
DAVID R. BELANGER*
Affiliation:
DEPARTMENT OF MATHEMATICS CORNELL UNIVERSITY ITHACA, NY 14850-4201, USAE-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We examine the reverse-mathematical strength of several theorems in classical and effective model theory concerning first-order theories and their number of models. We prove that, among these, most are equivalent to one of the familiar systems RCA0, WKL0, or ACA0. We are led to a purely model-theoretic statement that implies WKL0 but refutes ACA0 over RCA0.

Keywords

Primary 03B3003C57Secondary 03C35number of modelsreverse mathematicseffective model theory
Type
Articles
Information
The Journal of Symbolic Logic , Volume 79 , Issue 3 , September 2014 , pp. 955 - 984
Copyright
Copyright © The Association for Symbolic Logic 2014 

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

Chang, C. C. and Keisler, H. Jerome, Model theory, third ed., Studies in Logic and the Foundations of Mathematics, vol. 73, North-Holland Publishing Co., Amsterdam, 1990.Google Scholar
Csima, Barbara F., Harizanov, Valentina S., Miller, Russell, and Montalbán, Antonio, Computability of Fraïssé limits. this Journal, vol. 76 (2011), no. 1, pp. 66–93.Google Scholar
Ehrenfeucht, Andrzej, Separable theories. Bulletin L’Académie Polonaise des Science, Série des Sciences Mathématiques, Astronomiques et Physiques, vol. 9 (1961), pp. 17–19.Google Scholar
Engeler, Erwin, Äquivalenzklassen von n-Tupeln. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 340–345.Google Scholar
Friedman, Harvey M., Some systems of second order arithmetic and their use. Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974), Vol. 1, Canadian Mathematical Society, Montreal, Quebec, 1975, pp. 235–242.Google Scholar
Friedman, Harvey M., Systems of second order arithmetic with restricted induction, i, ii (abstracts). this Journal, vol. 41 (1976), pp. 557–559.Google Scholar
Friedman, Harvey M., Simpson, Stephen G., and Smith, Rick L., Countable algebra and set existence axioms. Annals of Pure and Applied Logic, vol. 25 (1983), no. 2, pp. 141–181.Google Scholar
Gončarov, Sergei S., Strong constructivizability of homogeneous models. Algebra i Logika, vol. 17 (1978), no. 4, pp. 363–388.Google Scholar
Harizanov, Valentina S., Pure computable model theory. Handbook of recursive mathematics, Vol. 1, Studies in Logic and the Foundations of Mathematics, vol. 138, North-Holland, Amsterdam, 1998, pp. 3–114.Google Scholar
Harris, Kenneth, Reverse mathematics of saturated models. Unpublished note. Availablehttp://kaharris.org/papers/reverse-sat.pdf, 2006.Google Scholar
Herrmann, E., On Lindenbaum functions of א0-categorical theories of finite similarity type. Bulletin L’Académie Polonaise des Science, Série des Sciences Mathématiques, Astronomiques et Physiques, vol. 24 (1976), no. 1, pp. 17–21.Google Scholar
Hirschfeldt, Denis R., Lange, Karen, and Shore, Richard A., Induction, Bounding, weak combinatorial principles, and the homogenous model theorem. To appear.Google Scholar
Hirschfeldt, Denis R., Shore, Richard A., and Slaman, Theodore A., The atomic model theorem and type omitting. Transactions of the American Mathematical Society, vol. 361 (2009), no. 11, pp. 5805–5837.Google Scholar
Marker, David, Model theory, Graduate Texts in Mathematics, vol. 217, Springer-Verlag, New York, 2002.Google Scholar
Millar, Terrence S., A complete, decidable theory with two decidable models. this Journal, vol. 44 (1979), no. 3, pp. 307–312.Google Scholar
Millar, Terrence S., Vaught’s theorem recursively revisited. this Journal, vol. 46 (1981), no. 2, pp. 397–411.Google Scholar
Millar, Terrence S., Omitting types, type spectrums, and decidability.this Journal, vol. 48 (1983), no. 1, pp. 171–181.Google Scholar
Paljutin, E. A., The algebras of formulae of countably categorical theories. Colloquium Mathematicum, vol. 31 (1974), pp. 157–159.Google Scholar
Peretjat´kin, Mikhail G., A criterion for strong constructivizability of a homogeneous model. Algebra i Logika, vol. 17 (1978), no. 4, pp. 436–454.Google Scholar
Ryll-Nardzewski, Czesław, On categoricity in power ≤ א0. Bulletin L’Académie Polonaise des Science, Série des Sciences Mathématiques, Astronomiques et Physiques, vol. 7 (1959), pp. 545–548. (unbound insert).Google Scholar
Schmerl, James H., A decidable א0-categorical theory with a nonrecursive Ryll-Nardzewski function. Fundamenta Mathematicae, vol. 98 (1978), no. 2, pp. 121–125.Google Scholar
Simpson, Stephen G., Subsystems of second order arithmetic, second ed., Perspectives in Logic, Cambridge University Press, Cambridge, 2009.CrossRefGoogle Scholar
Svenonius, Lars, א0-categoricity in first-order predicate calculus. Theoria (Lund), vol. 25 (1959), pp. 82–94.Google Scholar
Venning, Michael Charles, Type structures of aleph-zero categorical theories, Ph.D. Thesis, Cornell University, ProQuest LLC, Ann Arbor, MI, 1976.Google Scholar