Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-30T19:37:05.317Z Has data issue: false hasContentIssue false
  • English
  • Français

UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES

Published online by Cambridge University Press:  12 December 2014

ASHER M. KACH  and
ANTONIO MONTALBÁN
ASHER M. KACH
Affiliation:
DEPARTMENT OF MATHEMATICS THE UNIVERSITY OF CALIFORNIA, BERKELEY 5734 S. UNIVERSITY AVE. BERKELEY, CA 94720, USA E-mail: [email protected]: www.math.uchicago.edu/~kach E-mail: [email protected]: www.math.uchicago.edu/~antonio
ANTONIO MONTALBÁN
Affiliation:
DEPARTMENT OF MATHEMATICS THE UNIVERSITY OF CALIFORNIA, BERKELEY 5734 S. UNIVERSITY AVE. BERKELEY, CA 94720, USA E-mail: [email protected]: www.math.uchicago.edu/~kach E-mail: [email protected]: www.math.uchicago.edu/~antonio
Get access Rights & Permissions [Opens in a new window]

Abstract

Many classes of structures have natural functions and relations on them: concatenation of linear orders, direct product of groups, disjoint union of equivalence structures, and so on. Here, we study the (un)decidability of the theory of several natural classes of structures with appropriate functions and relations. For some of these classes of structures, the resulting theory is decidable; for some of these classes of structures, the resulting theory is bi-interpretable with second-order arithmetic.

Keywords

bi-interpretabilitysecond-order arithmeticTarski’s Cube Problemclasses of structures
Type
Articles
Information
The Journal of Symbolic Logic , Volume 79 , Issue 4 , December 2014 , pp. 1001 - 1019
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

Feferman, S. and Vaught, R. L., The first order properties of products of algebraic systems. Fundamenta Mathematicae, vol. 47 (1959), pp. 57–103.Google Scholar
Ketonen, Jussi, On isomorphism types of countable Boolean algebras, unpublished.Google Scholar
Ketonen, Jussi, The structure of countable Boolean algebras. Annals of Mathematics (2), vol. 108 (1978), no. 1, pp. 41–89.Google Scholar
Presburger, Mojżesz, On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation. History and Philosophy of Logic, vol. 12 (1991), no. 2, pp. 225–233. Translated from the German and with commentaries by Dale Jacquette.Google Scholar
Rosenstein, Joseph G., Linear orderings, Pure and Applied Mathematics, vol. 98, Academic Press [Harcourt Brace Jovanovich Publishers], New York, 1982.Google Scholar
Simpson, Stephen G., First-order theory of the degrees of recursive unsolvability. Annals of Mathematics (2), vol. 105 (1977), no. 1, pp. 121–139.Google Scholar
Slaman, Theodore A., Global properties of the Turing degrees and the Turing jump, Computational Prospects of Infinity. Part I. Tutorials, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 14, World Scientific Publishing, Hackensack, New Jersey, 2008, pp. 83–101.Google Scholar
Tarski, Alfred, Cardinal Algebras. With an Appendix: Cardinal Products of Isomorphism Types, by Bjarni Jónsson and Alfred Tarski, Oxford University Press, New York, 1949.Google Scholar