{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:19Z","timestamp":1761611179756},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":6493,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1996,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently, Lincoln, Scedrov and Shankar showed that the multiplicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-additive fragment of second order classical linear logic is also undecidable, using an encoding of two-counter machines originally due to Kanovich. The faithfulness of this encoding is proved by means of the phase semantics.<\/jats:p>","DOI":"10.2307\/2275674","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T18:58:29Z","timestamp":1146941909000},"page":"541-548","source":"Crossref","is-referenced-by-count":17,"title":["The undecidability of second order linear logic without exponentials"],"prefix":"10.1017","volume":"61","author":[{"given":"Yves","family":"Lafont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200017412_ref002","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629150"},{"key":"S0022481200017412_ref003","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629150.007"},{"key":"S0022481200017412_ref005","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1961-032-6"},{"key":"S0022481200017412_ref004","volume-title":"Information and Computation","author":"Lafont","year":"1996"},{"key":"S0022481200017412_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S0022481200017412_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(92)90075-B"},{"key":"S0022481200017412_ref009","doi-asserted-by":"publisher","DOI":"10.1142\/9789812794499_0027"},{"key":"S0022481200017412_ref008","first-page":"239","volume-title":"10-th annual IEEE Symposium on logic in computer science","author":"Scedrov","year":"1995"},{"key":"S0022481200017412_ref007","doi-asserted-by":"publisher","DOI":"10.2307\/1970290"},{"key":"S0022481200017412_ref010","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/1.4.537"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200017412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T17:29:15Z","timestamp":1557682155000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200017412\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["S0022481200017412"],"URL":"https:\/\/doi.org\/10.2307\/2275674","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}