Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

Constructive models
of uncountably categorical theories


Authors: Bernhard Herwig, Steffen Lempp and Martin Ziegler
Journal: Proc. Amer. Math. Soc. 127 (1999), 3711-3719
MSC (1991): Primary 03C57, 03D45
DOI: https://doi.org/10.1090/S0002-9939-99-04920-5
Published electronically: May 6, 1999
MathSciNet review: 1610909
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a finite language of binary predicates whose only constructive (or recursive) model is the prime model.


References [Enhancements On Off] (What's this?)

  • [AZ86] Ahlbrandt, G. and Ziegler, M., Quasi-finitely axiomatizable totally categorical theories, Stability in model theory (Trento, 1984), Ann. Pure Appl. Logic 30 (1986), 63-82. MR 87k:03026
  • [BL71] Baldwin, J. T. and Lachlan, A. H., On strongly minimal sets, J. Symbolic Logic 36 (1971), 79-96. MR 44:3851
  • [EF95] Ebbinghaus, H.-D. and Flum, J., Finite model theory, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1995. CMP 97:01
  • [Go78] Gon\v{c}arov, S. S., Constructive models of $\aleph _{1}$-categorical theories, Mat. Zametki 23 (1978), 885-888 (Russian). MR 80g:03029
  • [Ha74] Harrington, L., Recursively presented prime models, J. Symbolic Logic 39 (1974), 305-309. MR 50:4292
  • [Hi74] Hisamiev, N. G., On strongly constructive models of decidable theories, Izv. Akad. Nauk Kazakh. SSR Ser. Fiz.-Mat. 35 (1) (1974), 83-84 (Russian). MR 50:6824
  • [Iv89] Ivanov, A. A., The problem of finite axiomatizability for strongly minimal theories of graphs, and groups with more than one end, Algebra i Logika 28 (1989), 160-173 (Russian). MR 91m:03035
  • [Iv89b] Ivanov, A. A., The problem of finite axiomatizability for strongly minimal theories of graphs, Algebra i Logika 28 (1989), 280-297 (Russian). MR 91i:03069
  • [KNSta] Khoussainov, B., Nies, A., and Shore, R. A., Recursive models of theories with few models (to appear).
  • [Kn86] Knight, J. F., Degrees coded in jumps of orderings, J. Symbolic Logic 51 (1986), 1034-1042. MR 88j:03030
  • [Ku80] Kuda[??]ibergenov, K. \v{Z}., Constructivizable models of undecidable theories, Sibirsk. Mat. Zh. 21 (5) (1980), 155-158, 192. MR 82h:03040
  • [Mo65] Morley, M., Categoricity in power, Trans. Amer. Math. Soc. 114 (1965), 514-538. MR 31:58
  • [Ro95] Rotman, J., An introduction to the theory of groups, 4th edition, Graduate Texts in Mathematics No. 148, Springer-Verlag, New York, 1995. MR 95m:20001

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (1991): 03C57, 03D45

Retrieve articles in all journals with MSC (1991): 03C57, 03D45


Additional Information

Bernhard Herwig
Affiliation: School of Mathematics, University of Leeds, Leeds LS2 9JT, England
Address at time of publication: Institut für Mathematische Logik, Albert-Ludwigs-Universität Freiburg, D-79104 Freiburg, Germany
Email: herwig@amsta.leeds.ac.uk, herwig@ruf.uni-freiburg.de

Steffen Lempp
Affiliation: Department of Mathematics, University of Wisconsin, Madison, Wisconsin 53706-1388
Email: lempp@math.wisc.edu

Martin Ziegler
Affiliation: Institut für Mathematische Logik, Albert-Ludwigs-Universität Freiburg, D-79104 Freiburg, Germany
Email: ziegler@uni-freiburg.de

DOI: https://doi.org/10.1090/S0002-9939-99-04920-5
Keywords: Constructive/recursive/computable model, uncountably categorical first-order theory, strongly minimal set, unsolvable word problem, Cayley graph
Received by editor(s): October 20, 1997
Received by editor(s) in revised form: February 20, 1998
Published electronically: May 6, 1999
Additional Notes: The first author was supported by a grant of the British Engineering and Physical Sciences Research Council (Research Grant no. GR/K60503)
The second author’s research was partially supported by NSF grant DMS-9504474 and a grant of the British Engineering and Physical Sciences Research Council (Research Grant no. GR/K60497).
Communicated by: Carl G. Jockusch, Jr.
Article copyright: © Copyright 1999 American Mathematical Society

American Mathematical Society