The finite embeddability property for residuated groupoids.

DOI10.1007/s00012-014-0284-1zbMath1305.06012MaRDI QIDQ2510712

Rostislav Horčík, Zuzana Haniková

Publication date: 1 August 2014

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

Full work available at URL: https://doi.org/10.1007/s00012-014-0284-1

zbMATH Keywords

computational complexityfinite embeddability propertydecidability of universal theoriesfinite partial subalgebrasresiduated groupoids

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03G25: Other algebras related to logic

06F05: Ordered semigroups and monoids

03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)

03C52: Properties of classes of models

06D75: Other generalizations of distributive lattices

Related Items

Unnamed Item, THE LOGIC OF RESOURCES AND CAPABILITIES, Some Syntactic Interpretations in Different Systems of Full Lambek Calculus, UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS, Finite coverability property, Semilinear substructural logics with the finite embeddability property, Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids, Residuated expansions of lattice-ordered structures

Cites Work

• The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
• Nonassociative Lambek Calculus with Additives and Context-Free Languages
• Algebraic Structures with Hard Equivalence and Minimization Problems
• NONASSOCIATIVE SUBSTRUCTURAL LOGICS AND THEIR SEMILINEAR EXTENSIONS: AXIOMATIZATION AND COMPLETENESS PROPERTIES
• On the finite embeddability property for residuated ordered groupoids
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• Semantics for relevant logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item