{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:16:12Z","timestamp":1726038972736},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662596470"},{"type":"electronic","value":"9783662596487"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-662-59648-7_5","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:04:09Z","timestamp":1564617849000},"page":"67-83","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Undecidability of a Newly Proposed Calculus for CatLog3"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"given":"Stepan","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,5]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/malq.19900360103","volume":"36","author":"VM Abrusci","year":"1990","unstructured":"Abrusci, V.M.: A comparison between Lambek syntactic calculus and intuitionistic linear logic. Zeitschr. Math. Logik Grundl. Math. 36, 11\u201315 (1990). \n                    https:\/\/doi.org\/10.1002\/malq.19900360103","journal-title":"Zeitschr. Math. Logik Grundl. Math."},{"key":"5_CR2","first-page":"1","volume":"1","author":"K Ajdukiewicz","year":"1935","unstructured":"Ajdukiewicz, K.: Die syntaktische Konnexit\u00e4t. Stud. Philos. 1, 1\u201327 (1935)","journal-title":"Stud. Philos."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.2307\/410452","volume":"29","author":"Y Bar-Hillel","year":"1953","unstructured":"Bar-Hillel, Y.: A quasi-arithmetical notation for syntactic description. Language 29, 47\u201358 (1953)","journal-title":"Language"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1002\/malq.19820283308","volume":"28","author":"W Buszkowski","year":"1982","unstructured":"Buszkowski, W.: Some decision problems in the theory of syntactic categories. Zeitschr. Math. Logik Grundl. Math. 28, 539\u2013548 (1982). \n                    https:\/\/doi.org\/10.1002\/malq.19820283308","journal-title":"Zeitschr. Math. Logik Grundl. Math."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11225-008-9116-7","volume":"89","author":"W Buszkowski","year":"2008","unstructured":"Buszkowski, W., Palka, E.: Infinitary action logic: complexity models and grammars. Stud. Logica. 89(1), 1\u201318 (2008)","journal-title":"Stud. Logica."},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TIT.1956.1056813","volume":"I T\u20132","author":"N Chomsky","year":"1956","unstructured":"Chomsky, N.: Three models for the description of language. IRE Trans. Inf. Theory I T\u20132(3), 113\u2013124 (1956)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50(1), 1\u2013102 (1987). \n                    https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/S0960129500001328","volume":"1","author":"J-Y Girard","year":"1991","unstructured":"Girard, J.-Y.: A new constructive logic: classical logic. Math. Struct. Comput. Sci. 1(3), 255\u2013296 (1991). \n                    https:\/\/doi.org\/10.1017\/S0960129500001328","journal-title":"Math. Struct. Comput. Sci."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0168-0072(93)90093-S","volume":"59","author":"J-Y Girard","year":"1993","unstructured":"Girard, J.-Y.: On the unity of logic. Ann. Pure Appl. Logic 59(3), 201\u2013217 (1993). \n                    https:\/\/doi.org\/10.1016\/0168-0072(93)90093-S","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J-Y Girard","year":"1998","unstructured":"Girard, J.-Y.: Light linear logic. Inf. Comput. 143(2), 175\u2013204 (1998). \n                    https:\/\/doi.org\/10.1006\/inco.1998.2700","journal-title":"Inf. Comput."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-27683-0_11","volume-title":"Logical Foundations of Computer Science","author":"M Kanovich","year":"2016","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: On Lambek\u2019s restriction in the presence of exponential modalities. In: Artemov, S., Nerode, A. (eds.) LFCS 2016. LNCS, vol. 9537, pp. 146\u2013158. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-27683-0_11"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-53042-9_14","volume-title":"Formal Grammar","author":"M Kanovich","year":"2016","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: Undecidability of the Lambek calculus with a relevant modality. In: Foret, A., Morrill, G., Muskens, R., Osswald, R., Pogodalla, S. (eds.) FG 2015-2016. LNCS, vol. 9804, pp. 240\u2013256. Springer, Heidelberg (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-662-53042-9_14"},{"doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: Reconciling Lambek\u2019s restriction, cut-elimination, and substitution in the presence of exponential modalities. Annals Pure Applied Logic, accepted for publication. \n                    arXiv:1608.02254\n                    \n                   (2016)","key":"5_CR13","DOI":"10.1007\/978-3-319-27683-0_11"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-662-55751-8_26","volume-title":"Fundamentals of Computation Theory","author":"M Kanovich","year":"2017","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: Undecidability of the Lambek calculus with subexponential and bracket modalities. In: Klasing, R., Zeitoun, M. (eds.) FCT 2017. LNCS, vol. 10472, pp. 326\u2013340. Springer, Heidelberg (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-662-55751-8_26"},{"unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: Lambek calculus enriched with multiplexing (abstract). In: International Conference of Mal\u2019tsev Meeting 2018, Collection of Abstracts. Sobolev Institute of Mathematics and Novosibirsk State University, Novosibirsk (2018). \n                    http:\/\/www.math.nsc.ru\/conference\/malmeet\/18\/maltsev18.pdf","key":"5_CR15"},{"doi-asserted-by":"publisher","unstructured":"Kanovich, M., Kuznetsov, S., Nigam, V., Scedrov, A.: Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci. (2018). \n                    https:\/\/doi.org\/10.1017\/S0960129518000117\n                    \n                  . Accessed 2 May 2018","key":"5_CR16","DOI":"10.1017\/S0960129518000117"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-94205-6_16","volume-title":"Automated Reasoning","author":"M Kanovich","year":"2018","unstructured":"Kanovich, M., Kuznetsov, S., Nigam, V., Scedrov, A.: A logical framework with commutative and non-commutative subexponentials. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 228\u2013245. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-94205-6_16"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/inco.2001.2960","volume":"179","author":"D Kozen","year":"2002","unstructured":"Kozen, D.: On the complexity of reasoning in Kleene algebra. Inf. Comput. 179, 152\u2013162 (2002). \n                    https:\/\/doi.org\/10.1006\/inco.2001.2960","journal-title":"Inf. Comput."},{"issue":"4","key":"5_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.3103\/S0027132211040085","volume":"66","author":"SL Kuznetsov","year":"2011","unstructured":"Kuznetsov, S.L.: On the Lambek calculus with a unit and one division. Moscow Univ. Math. Bull. 66(4), 173\u2013175 (2011). \n                    https:\/\/doi.org\/10.3103\/S0027132211040085","journal-title":"Moscow Univ. Math. Bull."},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-662-55386-2_13","volume-title":"Logic, Language, Information, and Computation","author":"S Kuznetsov","year":"2017","unstructured":"Kuznetsov, S.: The Lambek calculus with iteration: two variants. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 182\u2013198. Springer, Heidelberg (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-662-55386-2_13"},{"issue":"12","key":"5_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","volume":"318","author":"Y Lafont","year":"2004","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theor. Comput. Sci. 318(12), 163\u2013180 (2004). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2003.10.018","journal-title":"Theor. Comput. Sci."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Am. Math. Mon. 65, 154\u2013170 (1958). \n                    https:\/\/doi.org\/10.2307\/2310058","journal-title":"Am. Math. Mon."},{"issue":"1\u20133","key":"5_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0168-0072(92)90075-B","volume":"56","author":"P Lincoln","year":"1992","unstructured":"Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Ann. Pure Appl. Logic 56(1\u20133), 239\u2013311 (1992). \n                    https:\/\/doi.org\/10.1016\/0168-0072(92)90075-B","journal-title":"Ann. Pure Appl. Logic"},{"key":"5_CR24","first-page":"583","volume":"55","author":"A Markov","year":"1947","unstructured":"Markov, A.: On the impossibility of certain algorithms in the theory of associative systems. Doklady Acad. Sci. USSR (N. S.) 55, 583\u2013586 (1947)","journal-title":"Doklady Acad. Sci. USSR (N. S.)"},{"issue":"3\/4","key":"5_CR25","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00159344","volume":"5","author":"M Moortgat","year":"1996","unstructured":"Moortgat, M.: Multimodal linguistic inference. J. Logic Lang. Inf. 5(3\/4), 349\u2013385 (1996). \n                    https:\/\/doi.org\/10.1007\/BF00159344","journal-title":"J. Logic Lang. Inf."},{"unstructured":"Morrill, G.: Categorial formalisation of relativisation: pied piping, islands, and extraction sites. Technical report LSI-92-23-R, Universitat Polit\u00e8cnica de Catalunya (1992)","key":"5_CR26"},{"key":"5_CR27","volume-title":"Categorial Grammar: Logical Syntax, Semantics, and Processing","author":"GV Morrill","year":"2011","unstructured":"Morrill, G.V.: Categorial Grammar: Logical Syntax, Semantics, and Processing. Oxford University Press, Oxford (2011)"},{"unstructured":"Morrill, G., Valent\u00edn, O.: Computational coverage of TLG: nonlinearity. In: Proceedings of NLCS 2015. EPiC Series, vol. 32, pp. 51\u201363 (2015)","key":"5_CR28"},{"issue":"2","key":"5_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10988-016-9197-0","volume":"40","author":"G Morrill","year":"2017","unstructured":"Morrill, G.: Grammar logicised: relativisation. Linguist. Philos. 40(2), 119\u2013163 (2017). \n                    https:\/\/doi.org\/10.1007\/s10988-016-9197-0","journal-title":"Linguist. Philos."},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-662-57784-4_5","volume-title":"Formal Grammar 2018","author":"G Morrill","year":"2018","unstructured":"Morrill, G., Kuznetsov, S., Kanovich, M., Scedrov, A.: Bracket induction for Lambek calculus with bracket modalities. In: Foret, A., Kobele, G., Pogodalla, S. (eds.) FG 2018. LNCS, vol. 10950, pp. 84\u2013101. Springer, Heidelberg (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-662-57784-4_5"},{"issue":"2","key":"5_CR31","doi-asserted-by":"publisher","first-page":"353","DOI":"10.15398\/jlm.v6i2.233","volume":"6","author":"G Morrill","year":"2018","unstructured":"Morrill, G.: A note on movement in logical grammar. J. Lang. Model. 6(2), 353\u2013363 (2018). \n                    https:\/\/doi.org\/10.15398\/jlm.v6i2.233","journal-title":"J. Lang. Model."},{"issue":"2","key":"5_CR32","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10849-018-09277-w","volume":"28","author":"Glyn Morrill","year":"2019","unstructured":"Morrill, G.: Parsing\/theorem-proving for logical grammar CatLog3. J. Logic Lang. Inf. (2019). \n                    https:\/\/doi.org\/10.1007\/s10849-018-09277-w\n                    \n                  . Accessed 18 Jan 2019","journal-title":"Journal of Logic, Language and Information"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2267170","volume":"12","author":"EL Post","year":"1947","unstructured":"Post, E.L.: Recursive unsolvability of a problem of Thue. J. Symb. Logic 12, 1\u201311 (1947)","journal-title":"J. Symb. Logic"},{"unstructured":"Thue, A.: Probleme \u00fcber Ver\u00e4nderungen von Zeichenreihen nach gegebener Regeln. Kra. Vidensk. Selsk. Skrifter. 10, 1\u201334 (1914)","key":"5_CR34"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59648-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:20:35Z","timestamp":1564618835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59648-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662596470","9783662596487"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59648-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Grammar","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latvia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fg2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fg.phil.hhu.de\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}