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

DOI10.1007/S00012-019-0609-1OpenAlexW3099537738MaRDI QIDQ2317378FDOQ2317378

Authors: Dmitry Shkatov, C. 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

Recommendations

• The finite embeddability property for residuated groupoids.
• scientific article; zbMATH DE number 1341613
• Complexity of the universal theory of modal algebras
• Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators
• On the complexity of the equational theory of residuated Boolean algebras

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)

Cites Work

• Modal logic
• Decision problems for propositional linear logic
• Lambek calculus is NP-complete
• Algebraic methods in philosophical logic
• The undecidability of entailment and relevant implication
• Title not available (Why is that?)
• Using the Universal Modality: Gains and Questions
• Title not available (Why is that?)
• Residuated lattices. An algebraic glimpse at substructural logics
• Adding involution to residuated structures
• The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
• Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributive full Lambek calculus has the finite model property
• Nonassociative Lambek Calculus with Additives and Context-Free Languages
• Cut elimination and strong separation for substructural logics: an algebraic approach
• Domino-tiling games
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the finite embeddability property for residuated ordered groupoids
• Complexity of the universal theory of modal algebras
• Distributive residuated frames and generalized bunched implication algebras
• Undecidability of consequence relation in full non-associative Lambek calculus
• The finite embeddability property for residuated groupoids.
• Title not available (Why is that?)

Cited In (7)

• Complexity of the universal theory of modal algebras
• Title not available (Why is that?)
• Residuated expansions of lattice-ordered structures
• Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
• Computational complexity for bounded distributive lattices with negation
• On residuated lattices with universal quantifiers
• Complexity of the universal theory of residuated ordered groupoids

This page was built for publication: Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317378)