Deciding the word problem in pure double Boolean algebras
From MaRDI portal
Publication:1948275
DOI10.1016/j.jal.2012.04.003zbMath1283.06027OpenAlexW2040914670MaRDI QIDQ1948275
Publication date: 2 May 2013
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2012.04.003
complexitycompletenessequational logicword problemdecidabilityaxiomatizationformal contextspure double Boolean algebras
Knowledge representation (68T30) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Generalizations of Boolean algebras (06E75)
Related Items (4)
A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts ⋮ Kripke contexts, double Boolean algebras with operators and corresponding modal systems ⋮ Topological representation of double Boolean algebras ⋮ Filters, ideals and congruences on double Boolean algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The polynomial-time hierarchy
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- A Solution of the Word Problem for Free Double Boolean Algebras
- RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
- Alternation
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Formal Concept Analysis
- Concept Lattices
- Concept Lattices
This page was built for publication: Deciding the word problem in pure double Boolean algebras