The undecidability of second order multiplicative linear logic
From MaRDI portal
Publication:1917079
DOI10.1006/inco.1996.0019zbMath0852.03003MaRDI QIDQ1917079
Publication date: 5 December 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0019
undecidability; phase semantics; counter machines; multiplicative fragment of second-order propositional linear logic
03B25: Decidability of theories and sets of sentences
03B20: Subsystems of classical logic (including intuitionistic logic)
03D10: Turing machines and related notions
03F99: Proof theory and constructive mathematics
Related Items
The finite model property for various fragments of linear logic, System NEL is Undecidable, Encoding Hamiltonian circuits into multiplicative linear logic, Phase semantics for light linear logic, A uniform semantic proof for cut-elimination and completeness of various first and higher order logics., On the decision problem for MELL, Linear concurrent constraint programming: Operational and phase semantics, A PSPACE-complete fragment of second-order linear logic, Language models for some extensions of the Lambek calculus