Pages that link to "Item:Q1917079"

The following pages link to The undecidability of second order multiplicative linear logic (Q1917079):

Displaying 13 items.

• Decision problems for propositional linear logic (Q1192352) (← links)
• Undecidability results on two-variable logics (Q1306795) (← links)
• First-order linear logic without modalities is NEXPTIME-hard (Q1342252) (← links)
• Phase semantics for light linear logic (Q1398478) (← links)
• A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. (Q1603701) (← links)
• On the decision problem for MELL (Q1733062) (← links)
• Linear concurrent constraint programming: Operational and phase semantics (Q1854410) (← links)
• A PSPACE-complete fragment of second-order linear logic (Q1960427) (← links)
• The decidability of the intensional fragment of classical linear logic (Q2517231) (← links)
• Language models for some extensions of the Lambek calculus (Q2672665) (← links)
• The finite model property for various fragments of linear logic (Q4382470) (← links)
• System NEL is Undecidable (Q4924537) (← links)
• Encoding Hamiltonian circuits into multiplicative linear logic (Q5958784) (← links)