Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-28T20:13:45.507Z Has data issue: false hasContentIssue false
  • English
  • Français

A decidable variety that is finitely undecidable

Published online by Cambridge University Press:  12 March 2014

Joohee Jeong
Joohee Jeong*
Affiliation:
Topology and Geometry Research Center, Kyungpook National University, Taegu. S., Korea702-701, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We construct a decidable first-order theory T such that the theory of its finite models is undecidable. Moreover, T will be equationally axiomatizable and of finite type.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 64 , Issue 2 , June 1999 , pp. 651 - 677
Copyright
Copyright © Association for Symbolic Logic 1999

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] Burris, S. and Sankappanavar, H., A course in universal algebra, Graduate Texts in Mathematics, Springer-Verlag, 1981.Google Scholar
[2] Burris, S. and Werner, H., Sheaf constructions and their elementary properties, Transactions of the American Mathematical Society, vol. 248 (1979), no. 2, pp. 269–309.Google Scholar
[3] Chang, C. and Keisler, H., Model theory, 3rd ed., North-Holland, 1990.Google Scholar
[4] Comer, S., Finite inseparability of some theories of cylindrification algebras, this Journal, vol. 34 (1969), no. 2, pp. 171–176.Google Scholar
[5] Ehrenfeucht, A., Decidability of the theory of one function, Notices of the American Mathematical Society, vol. 6 (1959), p. 268.Google Scholar
[6] Lavrov, Ershov, Tatmanov, , and Taitslin, , Elementary theories, Russian Mathematical Surveys, vol. 20 (1965), no. 4, pp. 35–105.Google Scholar
[7] Feferman, S. and Vaught, R., The first order properties of products of algebraic systems, Fundamenta Mathematicae, vol. 57 (1959), pp. 57–103.Google Scholar
[8] Idziak, P., Varieties with decidable finite algebras II: Permutability, Algebra Universalis, vol. 26 (1989), pp. 247–256.Google Scholar
[9] Jeong, J., On finitely decidable varieties, Ph.D. thesis , University of California, Berkeley, 1991.Google Scholar
[10] McKenzie, R., McNulty, G., and Taylor, W., Algebras, lattices, varieties, vol. 1, Wadsworth and Brooks/Cole, 1987.Google Scholar
[11] McKenzie, R. and Valeriote, M., The structure of decidable locally finite varieties, Progress in Mathematics, no. 79, Birkhäuser, 1989.Google Scholar
[12] Rabin, M., Decidability of second-order theories & automata on infinite trees, Transactions of the American Mathematical Society, vol. 141 (1969), pp. 1–35.Google Scholar
[13] Tarski, A., Arithmetical classes and types of Boolean algebras, Bulletin of the American Mathematical Society, vol. 55 (1949), p. 64.Google Scholar
[14] Willard, R., Decidable discriminator varieties from unary classes, Transactions of the American Mathematical Society, vol. 336 (1993), no. 1, pp. 311–333.CrossRefGoogle Scholar
[15] Zamyatin, A., Varieties of associative rings whose elementary theory is decidable, Soviet Matematika Doklady, vol. 17 (1976), no. 4, pp. 996–999.Google Scholar
[16] Zamyatin, A., A non-abelian variety of groups has an undecidable elementary theory, Algebra and Logic, vol. 17 (1978), pp. 13–17.Google Scholar