Word problem for knotted residuated lattices.
From MaRDI portal
Publication:2254319
DOI10.1016/j.jpaa.2014.06.015zbMath1312.06012MaRDI QIDQ2254319
Publication date: 4 February 2015
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpaa.2014.06.015
word problem; residuated lattices; Burnside problem; finite embeddability property; join-semilattice-ordered residuated semigroups
06F05: Ordered semigroups and monoids
03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
Related Items
MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE, Finite embeddability property for residuated lattices via regular languages, The FEP for some varieties of fully distributive knotted residuated lattices, FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Residuated lattices. An algebraic glimpse at substructural logics
- Rational languages and the Burnside problem
- Extending intuitionistic linear logic with knotted structural rules
- The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
- On square-increasing ordered monoids and idempotent semirings
- The finite model property for knotted extensions of propositional linear logic
- How to Program an Infinite Abacus
- ALGORITHMIC PROBLEMS IN VARIETIES
- The undecidability of second order linear logic without exponentials
- Residuated frames with applications to decidability
- On the finite embeddability property for residuated ordered groupoids
- Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
- Semigroups satisfying x m+n = x n
