Decidability Problem for Finite Heyting Algebras
Idziak, Katarzyna ; Idziak, Pawel M.
J. Symbolic Logic, Tome 53 (1988) no. 1, p. 729-735 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
The aim of this paper is to characterize varieties of Heyting algebras with decidable theory of their finite members. Actually we prove that such varieties are exactly the varieties generated by linearly ordered algebras. It contrasts to the result of Burris [2] saying that in the case of whole varieties, only trivial variety and the variety of Boolean algebras have decidable first order theories.
Publié le : 1988-09-14
Classification:  
@article{1183742716,
     author = {Idziak, Katarzyna and Idziak, Pawel M.},
     title = {Decidability Problem for Finite Heyting Algebras},
     journal = {J. Symbolic Logic},
     volume = {53},
     number = {1},
     year = {1988},
     pages = { 729-735},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742716}
}

Idziak, Katarzyna; Idziak, Pawel M. Decidability Problem for Finite Heyting Algebras. J. Symbolic Logic, Tome 53 (1988) no. 1, pp.  729-735. http://gdmltest.u-ga.fr/item/1183742716/