Computational complexity for bounded distributive lattices with negation

DOI10.1016/J.APAL.2021.102962OpenAlexW3133831446MaRDI QIDQ2032990

Dmitry Shkatov, Clint J. van Alten

Publication date: 14 June 2021

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2021.102962

zbMATH Keywords

computational complexityuniversal theorypartial algebradistributive lattice with negation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Pseudocomplemented lattices (06D15) De Morgan algebras, ?ukasiewicz algebras (lattice-theoretic aspects) (06D30) Generalizations of Boolean algebras (06E75)

Related Items (1)

Complexity of the universal theory of residuated ordered groupoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rules
• Consequence relations and admissible rules
• Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
• Negation in the context of gaggle theory
• Distributive lattices with an additional unary operation
• Propositional dynamic logic of regular programs
• Intuitionistic propositional logic is polynomial-space complete
• Semantic analysis of orthologic
• On the polynomial-space completeness of intuitionistic propositional logic
• Complexity of the universal theory of modal algebras
• Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
• STABLE CANONICAL RULES
• Canonical rules
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Complexity of finite-variable fragments of propositional modal logics of symmetric frames
• Mathematical Foundations of Computer Science 2003
• Lattices With Involution
• Equational Classes of Distributive Pseudo-Complemented Lattices
• Boolean Algebras with Operators. Part I
• Boolean Algebras with Operators

This page was built for publication: Computational complexity for bounded distributive lattices with negation