Complexity of the universal theory of residuated ordered groupoids

DOI10.1007/s10849-022-09392-9MaRDI QIDQ6169326

Clint J. van Alten, Dmitry Shkatov

Publication date: 14 August 2023

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

zbMATH Keywords

universal theorypartial algebraresiduated algebraresiduated ordered groupoid

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rules
• Consequence relations and admissible rules
• Hypersequent rules with restricted contexts for propositional modal logics
• Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
• On the complexity of nonassociative Lambek calculus with unit
• Algebraic structures in categorial grammar
• Model theory.
• Residuation, structural rules and context freeness
• The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
• Computational complexity for bounded distributive lattices with negation
• Proof complexity of substructural logics
• Complexity of the universal theory of modal algebras
• Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
• STABLE CANONICAL RULES
• Interpolation and FEP for logics of residuated algebras
• The Mathematics of Sentence Structure
• Canonical rules
• Powerset Residuated Algebras and Generalized Lambek Calculus
• Basic logic: reflection, symmetry, visibility
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• On the finite embeddability property for residuated ordered groupoids
• The complexity of theorem-proving procedures

This page was built for publication: Complexity of the universal theory of residuated ordered groupoids