JOURNAL ARTICLE

Decidability problem for finite Heyting algebras

Katarzyna IdziakPaweł M. Idziak

Year: 1988 Journal:   Journal of Symbolic Logic Vol: 53 (3)Pages: 729-735   Publisher: Cambridge University Press

Abstract

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.

Keywords:
Decidability Variety (cybernetics) Mathematics Heyting algebra Pure mathematics Order (exchange) Algebra over a field Discrete mathematics

Metrics

17
Cited By
1.54
FWCI (Field Weighted Citation Impact)
19
Refs
0.83
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Algebra and Logic
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Logic, Reasoning, and Knowledge
Physical Sciences →  Computer Science →  Artificial Intelligence
semigroups and automata theory
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

Locally finite varieties of Heyting algebras

Guram BezhanishviliRevaz Grigolia

Journal:   Algebra Universalis Year: 2005 Vol: 54 (4)Pages: 465-473
JOURNAL ARTICLE

Decidability of the Projective Beth Property in Varieties of Heyting Algebras

L. L. Maksimova

Journal:   Algebra and Logic Year: 2001 Vol: 40 (3)Pages: 159-165
JOURNAL ARTICLE

The word problem for Heyting algebras

Alain Touraille

Journal:   Algebra Universalis Year: 1987 Vol: 24 (1-2)Pages: 120-127
BOOK-CHAPTER

Heyting Algebras

Jair Minoro Abe

Intelligent systems reference library Year: 2025 Pages: 51-62
BOOK

Heyting Algebras

Leo Esakia

Trends in logic Year: 2019
© 2026 ScienceGate Book Chapters — All rights reserved.