Publication:2678341

DOI10.3103/S1066369X22050061MaRDI QIDQ2678341FDOQ2678341

Yanyan Li

Publication date: 23 January 2023

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

finitely generated algebraword problemHeyting algebramodal algebrapseudo-Boolean algebra

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computability and recursion theory (03Dxx) General logic (03Bxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of propositional linear temporal logics in simple cases
• Relationships between nondeterministic and deterministic tape complexities
• The complexity of theorem-proving procedures
• Recursive Unsolvability of a problem of Thue
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Intuitionistic propositional logic is polynomial-space complete
• THE CALCULUS OF THE WEAK "LAW OF EXCLUDED MIDDLE"
• On formulas of one variable in intuitionistic propositional calculus
• The decision problem of provability logic with only one atom
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• Complexity of intuitionistic propositional logic and its fragments
• Complexity and expressivity of propositional dynamic logics with finitely many variables
• Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
• Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables
• Complexity of finite-variable fragments of products with K
• Complexity of finite-variable fragments of propositional modal logics of symmetric frames
• Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
• Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages

Cited In (1)

• Polynomial space hardness without disjunction property

This page was built for publication: Computational complexity of the word problem in modal and Heyting algebras with a small number of generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678341)