Abstract
Quantifier-free prepositional linear affine logic (i.e. linear logic with weakening) is decidable [Kop, Laf2]. Lafont and Scedrov proved that the multiplicative fragment of second-order linear logic is undecidable [LS]. In this paper we show that second order linear affine logic is undecidable as well. At the same time it turns out that even its multiplicative fragment is undecidable. Moreover, we obtain a whide class of undecidabile second order logics which lie between the Lambek calculus (LC) and linear affine logic. The proof is based on an encoding of two-counter Minsky machines in second order linear affine logic. The faithfulness of the encoding is proved by means of the phase semantics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
