The undecidability of second order linear logic without exponentials

DOI10.2307/2275674zbMATH Open0866.03005OpenAlexW2006177255MaRDI QIDQ4894725FDOQ4894725

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

Recommendations

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

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)

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Encoding Hamiltonian circuits into multiplicative linear logic
• Phase semantics for light linear logic
• Language models for some extensions of the Lambek calculus
• System NEL is Undecidable
• A PSPACE-complete fragment of second-order 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)