Complexity of the universal theory of residuated ordered groupoids

DOI10.1007/S10849-022-09392-9MaRDI QIDQ6169326zbMATH OpenFDO

Authors Dmitry Shkatov, C. J. van Alten

Publication date 14 August 2023

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

Full work available at URL https://doi.org/10.1007/S10849-022-09392-9

zbMATH Keywords

partial algebraresiduated algebraresiduated ordered groupoiduniversal theory

Mathematics Subject Classification ID

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

Cites work

• Algebraic structures in categorial grammar
• Basic logic: reflection, symmetry, visibility
• Canonical rules
• Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
• Complexity of the universal theory of modal algebras
• Computational complexity for bounded distributive lattices with negation
• Consequence relations and admissible rules
• scientific article; zbMATH DE number 5289967 (Why is no real title available?)
• scientific article; zbMATH DE number 956466 (Why is no real title available?)
• scientific article; zbMATH DE number 3470465 (Why is no real title available?)
• scientific article; zbMATH DE number 1067867 (Why is no real title available?)
• scientific article; zbMATH DE number 3222127 (Why is no real title available?)
• Hypersequent rules with restricted contexts for propositional modal logics
• Interpolation and FEP for logics of residuated algebras
• Language and grammar. Studies in mathematical linguistics and natural language
• Model theory.
• Non‐associative Lambek Categorial Grammar in Polynomial Time
• On rules
• On the complexity of nonassociative Lambek calculus with unit
• On the finite embeddability property for residuated ordered groupoids
• Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
• Powerset Residuated Algebras and Generalized Lambek Calculus
• Proof complexity of substructural logics
• Residuation, structural rules and context freeness
• Stable canonical rules
• The complexity of theorem-proving procedures
• The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
• The Mathematics of Sentence Structure

Cited in

(2)

• scientific article; zbMATH DE number 5289967 (Why is no real title available?)
• On the finite embeddability property for residuated ordered groupoids

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

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