Word problem for knotted residuated lattices.

DOI10.1016/j.jpaa.2014.06.015zbMath1312.06012OpenAlexW2071193146MaRDI QIDQ2254319

Rostislav Horčík

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

zbMATH Keywords

word problemresiduated latticesBurnside problemfinite embeddability propertyjoin-semilattice-ordered residuated semigroups

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (4)

FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE ⋮ MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE ⋮ The FEP for some varieties of fully distributive knotted residuated lattices ⋮ Finite embeddability property for residuated lattices via regular languages

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Word problem for knotted residuated lattices.