A Decidable Variety that is Finitely Undecidable
Jeong, Joohee
J. Symbolic Logic, Tome 64 (1999) no. 1, p. 651-677 / Harvested from Project Euclid
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.
Publié le : 1999-06-14
Classification: 
@article{1183745800,
     author = {Jeong, Joohee},
     title = {A Decidable Variety that is Finitely Undecidable},
     journal = {J. Symbolic Logic},
     volume = {64},
     number = {1},
     year = {1999},
     pages = { 651-677},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745800}
}
Jeong, Joohee. A Decidable Variety that is Finitely Undecidable. J. Symbolic Logic, Tome 64 (1999) no. 1, pp.  651-677. http://gdmltest.u-ga.fr/item/1183745800/