Skip to main content Accessibility help
×
×
Home

A computable ℵ0-categorical structure whose theory computes true arithmetic

  • Bakhadyr Khoussainov (a1) and Antonio Montalbán (a2)

Abstract

We construct a computable ℵ0-categorical structure whose first order theory is computably equivalent to the true first order theory of arithmetic.

Copyright

References

Hide All
[AK00]Ash, C. J. and Knight, J., Computable structures and the hyperarithmetical hierarchy, Studies in Logic and the Foundations of Mathematics, vol. 144, North-Holland, Amsterdam, 2000.
[Ers73]Ershov, Ju. L., Skolem functions and constructive models, Algebra i Logika, vol. 12 (1973), pp. 644–654 and 735.
[Gon78]Goncharov, S. S., Strong constructivizability of homogeneous models. Algebra i Logika, vol. 17 (1978), no. 4, pp. 363–388 and 490.
[GHL+03]Goncharov, S. S., Harizanov, V., Laskowski, M., Lempp, S., and Mccoy, C. F., Trivial, strongly minimal theories are model complete after naming constants, Proceedings of the American Mathematical Society, vol. 131 (2003), no. 12, pp. 39013912, (electronic).
[GK04]Goncharov, S. S. and Khoussainov, B., Complexity of theories of computable categorical models. Algebra i Logika, vol. 43 (2004), no. 6, pp. 650–665 and 758759.
[GN73]Goncharov, S. S. and Nurtazin, A. T., Constructive models of complete decidable theories, Algebra i Logika, vol. 12 (1973), pp. 125–142 and 243.
[Har74]Harrington, L., Recursively presentable prime models, this Journal, vol. 39 (1974), pp. 305309.
[Hod93]Hodges, W., Model theory. Encyclopedia of Mathematics and its Applications, vol. 42, Cambridge University Press, Cambridge, 1993.
[Khi98]Khisamiev, N. G., Constructive abelian groups. Handbook of recursive mathematics, volume 2, Studies in Logic and the Foundations of Mathematics, vol. 139, North-Holland, Amsterdam, 1998, pp. 11771231.
[KLLS07]Khoussainov, B., Laskowski, M., Lempp, S., and Solomon, R., On the computability-theoretic complexity of trivial, strongly minimal models, Proceedings of the American Mathematical Society, vol. 135 (2007), no. 11, pp. 37113721, (electronic).
[KNS97]Khoussainov, B., Nies, A., and Shore, R. A., Computable models of theories with few models, Notre Dame Journal of Formal Logic, vol. 38 (1997), no. 2. pp. 165178.
[Kni94]Knight, J., Nonarithmetical ℵ0-categorical theories with recursive models, this Journal, vol. 59 (1994), no. 1, pp. 106112.
[Kud80]Kudaibergenov, K. Z., Constructivizable models of undecidable theories, Sibirskiĭ Matematicheskiĭ Zhurnal, vol. 21 (1980), no. 5, pp. 155–158 and 192.
[LS79]Lerman, M. and Schmerl, J. H., Theories with recursive models, this Journal, vol. 44 (1979), no. 1, pp. 5976.
[Mil78]Millar, T. S., Foundations of recursive model theory, Annals of Mathematical Logic, vol. 13 (1978), no. 1, pp. 4572.
[Mil81]Millar, T. S., Vaught's theorem recursively revisited, this Journal, vol. 46 (1981), no. 2, pp. 397411.
[Mor76]Morley, M., Decidable models, Israel Journal of Mathematics, vol. 25 (1976), no. 3–4, pp. 233240.
[Per78]Peretjatkin, M. G., A criterion of strong constructivizability of a homogeneous model, Algebra i Logika, vol. 17 (1978), no. 4, pp. 436454.
[Sch78]Schmerl, J. H., A decidable ℵ0-categorical theory with a nonrecursive Ryll–Nardzewski function. Fundamenta Mathematicae, vol. 98 (1978), no. 2, pp. 121125.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed