On the Complexity of the Equational Theory of Residuated Boolean Algebras

DOI10.1007/978-3-662-52921-8_17zbMath1478.03083OpenAlexW2481798033MaRDI QIDQ2820699

Minghui Ma, Zhe Lin

Publication date: 9 September 2016

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-52921-8_17

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logical aspects of Boolean algebras (03G05)

Related Items (1)

Extensions of Lambek Calculi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relational semantics of the Lambek calculus extended with classical propositional logic
• Relation algebras as residuated Boolean algebras
• Adjoining units to residuated Boolean algebras
• Interpolation and FEP for logics of residuated algebras
• A substructural logic for layered graphs
• Some Varieties Containing Relation Algebras
• Decidability of Relation Algebras with Weakened Associativity
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Undecidable Varieties of Semilattice—ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus
• Multi-Sorted Residuation

This page was built for publication: On the Complexity of the Equational Theory of Residuated Boolean Algebras