Deciding the word problem in pure double Boolean algebras
type: Item
instance of: scholarly article
title: Deciding the word problem in pure double Boolean algebras
zbMATH Open document ID: 1283.06027
author: Philippe Balbiani
published in: Journal of Applied Logic
publication date: 2013-05-02T00:00:00Z
Mathematics Subject Classification ID: 06E75
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03D40
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 6160209
zbMATH Keywords: formal contexts
zbMATH Keywords: pure double Boolean algebras
zbMATH Keywords: equational logic
zbMATH Keywords: axiomatization
zbMATH Keywords: completeness
zbMATH Keywords: complexity
zbMATH Keywords: decidability
zbMATH Keywords: word problem
MaRDI profile type: Publication
full work available at URL: j.jal.2012.04.003
OpenAlex ID: W2040914670
cites work: Alternation
cites work: Q4530231
cites work: Q4230685
cites work: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
cites work: Algebras of semiconcepts and double Boolean algebras
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: The polynomial-time hierarchy
cites work: Concept Lattices
cites work: Formal Concept Analysis
cites work: A Solution of the Word Problem for Free Double Boolean Algebras
cites work: Q5493135
cites work: RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
cites work: Q2754239
DOI: 10.1016/J.JAL.2012.04.003
description: scientific article; zbMATH DE number 6160209