Decidability problem for finite Heyting algebras

DOI10.2307/2274568zbMath0664.06008OpenAlexW2117196124MaRDI 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 algebrasfinite membersdecidable first order theorylinearly ordered Heyting algebras

Mathematics Subject Classification ID

Heyting algebras (lattice-theoretic aspects) (06D20) Decidability of theories and sets of sentences (03B25) Varieties (08B99)

Related Items (10)

V. Yankov’s Contributions to Propositional Logic ⋮ Yankov Characteristic Formulas (An Algebraic Account) ⋮ Characteristic formulas of partial Heyting 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 ⋮ On decidable varieties of Heyting algebras ⋮ The decidability of some classes of Stone algebras ⋮ A sufficient condition for finite decidability ⋮ Constant-Query Testability of Assignments to Constraint Satisfaction Problems

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

This page was built for publication: Decidability problem for finite Heyting algebras