Decidability problem for finite Heyting algebras

DOI10.2307/2274568zbMath0664.06008MaRDI QIDQ3815356

Katarzyna Idziak, Paweł M. Idziak

Publication date: 1988

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274568

zbMATH Keywords

variety of Heyting algebras; finite members; decidable first order theory; linearly ordered Heyting algebras

Mathematics Subject Classification ID

06D20: Heyting algebras (lattice-theoretic aspects)

03B25: Decidability of theories and sets of sentences

08B99: Varieties

Related Items

Constant-Query Testability of Assignments to Constraint Satisfaction Problems, The decidability of some classes of Stone algebras, The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences, Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties, Varieties with decidable finite algebras. I: Linearity, A sufficient condition for finite decidability, Characteristic formulas of partial Heyting algebras, On decidable varieties of Heyting algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Undecidability of Brouwerian semilattices
• Equational classes of relative Stone algebras
• Kripke models and intermediate logics
• A criterion for the separable axiomatization of Gödel's $S_n $
• Logic with truth values in A linearly ordered heyting algebra
• A series of successive modifications of Peirce's rule