Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids

DOI10.1007/s00012-019-0609-1OpenAlexW3099537738MaRDI QIDQ2317378

Dmitry Shkatov, Clint J. van Alten

Publication date: 9 August 2019

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.05556

zbMATH Keywords

complexityuniversal theorypartial algebrabounded distributive lattice with operatorbounded residuated distributive lattice-ordered groupoid

Mathematics Subject Classification ID

Other algebras related to logic (03G25) Ordered structures (06F99) Distributive lattices (06D99)

Related Items

Residuated expansions of lattice-ordered structures, Complexity of the universal theory of residuated ordered groupoids, Computational complexity for bounded distributive lattices with negation, Complexity of the universal theory of modal algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
• Cut elimination and strong separation for substructural logics: an algebraic approach
• Residuated lattices. An algebraic glimpse at substructural logics
• Distributive full Lambek calculus has the finite model property
• Decision problems for propositional linear logic
• Distributive residuated frames and generalized bunched implication algebras
• Adding involution to residuated structures
• The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
• Domino-tiling games
• Complexity of the universal theory of modal algebras
• Lambek calculus is NP-complete
• The finite embeddability property for residuated groupoids.
• Nonassociative Lambek Calculus with Additives and Context-Free Languages
• The undecidability of entailment and relevant implication
• Using the Universal Modality: Gains and Questions
• On the finite embeddability property for residuated ordered groupoids
• UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS