Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T04:06:43.220Z Has data issue: false hasContentIssue false

Decidability problem for finite Heyting algebras

Published online by Cambridge University Press:  12 March 2014

Katarzyna Idziak
Affiliation:
Department of Logic, Jagiellonian University, Cracow, Poland
Pawel M. Idziak
Affiliation:
Department of Logic, Jagiellonian University, Cracow, Poland

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1988

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.)

Article purchase

Temporarily unavailable