MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE

DOI10.1017/JSL.2021.46MaRDI QIDQ5100054zbMATH OpenOpenAlexFDO

Authors Nikolaos Galatos, Gavin st. John

Publication date 29 August 2022

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

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

zbMATH Keywords

decidabilityequational theoryfull Lambek calculusresiduated latticesimple extensionssubstructural logicword problem

Mathematics Subject Classification ID

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

Recommendations

• Extended Kripke lemma and decidability for hypersequent substructural logics
• FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
• Decidability and complexity in weakening and contraction hypersequent substructural logics
• Undecidability of multiplicative subexponential logic
• scientific article; zbMATH DE number 5289966

Cites work

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

Cited in

(5)

• FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
• Most simple extensions of $\mathsf{FL_e}$ are undecidable
• Semiconic idempotent logic. I: Structure and local deduction theorems.
• Decidability and complexity in weakening and contraction hypersequent substructural logics
• Weakening relations over duals of limit ordinals

This page was built for publication: MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100054)