Computational complexity of the word problem in modal and Heyting algebras with a small number of generators
From MaRDI portal
Publication:2678341
DOI10.3103/S1066369X22050061MaRDI QIDQ2678341
Publication date: 23 January 2023
Published in: Russian Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intuitionistic propositional logic is polynomial-space complete
- The decision problem of provability logic with only one atom
- Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables
- The complexity of propositional linear temporal logics in simple cases
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
- Relationships between nondeterministic and deterministic tape complexities
- Complexity of intuitionistic propositional logic and its fragments
- On formulas of one variable in intuitionistic propositional calculus
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Recursive Unsolvability of a problem of Thue
- Complexity and expressivity of propositional dynamic logics with finitely many variables
- Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
- Complexity of finite-variable fragments of propositional modal logics of symmetric frames
- THE CALCULUS OF THE WEAK "LAW OF EXCLUDED MIDDLE"
- The complexity of theorem-proving procedures
- Complexity of finite-variable fragments of products with K
- Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
This page was built for publication: Computational complexity of the word problem in modal and Heyting algebras with a small number of generators
