MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE

DOI10.1017/jsl.2021.46OpenAlexW3022956083MaRDI QIDQ5100054

Gavin st. John, Nikolaos Galatos

Publication date: 29 August 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.00645

zbMATH Keywords

word problemdecidabilitysubstructural logicequational theoryresiduated latticefull Lambek calculussimple extensions

Mathematics Subject Classification ID

Lattices of varieties (08B15) Logical aspects of lattices and related structures (03G10) Ordered semigroups and monoids (06F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic proof theory for substructural logics: cut-elimination and completions
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Residuated lattices. An algebraic glimpse at substructural logics
• Decision problems for propositional linear logic
• The FEP for some varieties of fully distributive knotted residuated lattices
• Word problem for knotted residuated lattices.
• FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
• The finite model property for knotted extensions of propositional linear logic
• Algebraizable logics
• How to Program an Infinite Abacus
• THE STRUCTURE OF COMMUTATIVE RESIDUATED LATTICES
• Residuated frames with applications to decidability
• The complexity of decision procedures in relevance logic II