The finite embeddability property for residuated groupoids.
DOI10.1007/s00012-014-0284-1zbMath1305.06012OpenAlexW2098479118MaRDI 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
computational complexityfinite embeddability propertydecidability of universal theoriesfinite partial subalgebrasresiduated groupoids
Formal languages and automata (68Q45) Other algebras related to logic (03G25) Ordered semigroups and monoids (06F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Properties of classes of models (03C52) Other generalizations of distributive lattices (06D75)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: The finite embeddability property for residuated groupoids.