Decidability problem for finite Heyting algebras
From MaRDI portal
Recommendations
Cites work
- A criterion for the separable axiomatization of Gödel's S_n
- A series of successive modifications of Peirce's rule
- Equational classes of relative Stone algebras
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 3501559 (Why is no real title available?)
- Kripke models and intermediate logics
- Logic with truth values in A linearly ordered heyting algebra
- Undecidability of Brouwerian semilattices
Cited in
(16)- 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
- Decision methods for linearly ordered Heyting algebras
- Computational complexity of the word problem in modal and Heyting algebras with a small number of generators
- The existence of a near-unanimity term in a finite algebra is decidable
- scientific article; zbMATH DE number 5507563 (Why is no real title available?)
- On decidable varieties of Heyting algebras
- The decidability of some classes of Stone algebras
- Constant-query testability of assignments to constraint satisfaction problems
- V. Yankov’s Contributions to Propositional Logic
- Yankov Characteristic Formulas (An Algebraic Account)
- Decidable quasivarieties of \(\mathrm{p}\)-algebras
- Locally finite varieties of Heyting algebras
This page was built for publication: Decidability problem for finite Heyting algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815356)