Journal of Symbolic Logic

A Decidable Variety that is Finitely Undecidable

Joohee Jeong

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

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.

Article information

Source
J. Symbolic Logic, Volume 64, Issue 2 (1999), 651-677.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183745800

Mathematical Reviews number (MathSciNet)
MR1777777

Zentralblatt MATH identifier
0935.03017

JSTOR
links.jstor.org

Citation

Jeong, Joohee. A Decidable Variety that is Finitely Undecidable. J. Symbolic Logic 64 (1999), no. 2, 651--677. https://projecteuclid.org/euclid.jsl/1183745800


Export citation