The undecidability of second order linear logic without exponentials

DOI10.2307/2275674MaRDI QIDQ4894725zbMATHOpenAlexFDO

Authors Yves Lafont

Publication date 7 October 1996

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

Full work available at URL https://semanticscholar.org/paper/e98c5b79de095d339aaab53793a828e2b5313676

zbMATH Keywords

undecidabilityphase semanticsencoding of two-counter machinesmultiplicative-additive fragment of second order classical linear logic

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25)

Recommendations

• The undecidability of second order multiplicative linear logic
• scientific article; zbMATH DE number 1114339
• scientific article; zbMATH DE number 1163987

Cites work

• Decision problems for propositional linear logic
• How to Program an Infinite Abacus
• Linear logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Some Syntactical Observations on Linear Logic

Cited in

(10)

• Phase semantics for light linear logic
• A PSPACE-complete fragment of second-order linear logic
• The undecidability of second order multiplicative linear logic
• Synthetic Undecidability of MSELL via FRACTRAN Mechanised in Coq
• Language models for some extensions of the Lambek calculus
• Undecidability of multiplicative subexponential logic
• scientific article; zbMATH DE number 517072 (Why is no real title available?)
• System NEL is undecidable
• Encoding Hamiltonian circuits into multiplicative linear logic
• Word problem for knotted residuated lattices.

This page was built for publication: The undecidability of second order linear logic without exponentials

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