Decidability problem for finite Heyting algebras

Journal of Symbolic Logic 53 (3):729-735 (1988)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 86,507

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
90 (#163,048)

6 months
2 (#525,456)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Characteristic Formulas of Partial Heyting Algebras.Alex Citkin - 2013 - Logica Universalis 7 (2):167-193.

Add more citations

References found in this work

Distributive Lattices.Raymond Balbes & Philip Dwinger - 1977 - Journal of Symbolic Logic 42 (4):587-588.
Equational classes of relative Stone algebras.T. Hecht & Tibor Katriňák - 1972 - Notre Dame Journal of Formal Logic 13 (2):248-254.

Add more references