Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Undecidability of a Newly Proposed Calculus for CatLog3

  • Conference paper
  • First Online:
Formal Grammar (FG 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11668))

Included in the following conference series:

Abstract

In his recent papers “Parsing/theorem-proving for logical grammar CatLog3” and “A note on movement in logical grammar”, Glyn Morrill proposes a new substructural calculus to be used as the basis for the categorial grammar parser CatLog3. In this paper we prove that the derivability problem for a fragment of this calculus is algorithmically undecidable.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrusci, V.M.: A comparison between Lambek syntactic calculus and intuitionistic linear logic. Zeitschr. Math. Logik Grundl. Math. 36, 11–15 (1990). https://doi.org/10.1002/malq.19900360103

    Article  MathSciNet  MATH  Google Scholar 

  2. Ajdukiewicz, K.: Die syntaktische Konnexität. Stud. Philos. 1, 1–27 (1935)

    MATH  Google Scholar 

  3. Bar-Hillel, Y.: A quasi-arithmetical notation for syntactic description. Language 29, 47–58 (1953)

    Article  Google Scholar 

  4. Buszkowski, W.: Some decision problems in the theory of syntactic categories. Zeitschr. Math. Logik Grundl. Math. 28, 539–548 (1982). https://doi.org/10.1002/malq.19820283308

    Article  MathSciNet  MATH  Google Scholar 

  5. Buszkowski, W., Palka, E.: Infinitary action logic: complexity models and grammars. Stud. Logica. 89(1), 1–18 (2008)

    Article  MathSciNet  Google Scholar 

  6. Chomsky, N.: Three models for the description of language. IRE Trans. Inf. Theory I T–2(3), 113–124 (1956)

    Article  Google Scholar 

  7. Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50(1), 1–102 (1987). https://doi.org/10.1016/0304-3975(87)90045-4

    Article  MathSciNet  MATH  Google Scholar 

  8. Girard, J.-Y.: A new constructive logic: classical logic. Math. Struct. Comput. Sci. 1(3), 255–296 (1991). https://doi.org/10.1017/S0960129500001328

    Article  MathSciNet  MATH  Google Scholar 

  9. Girard, J.-Y.: On the unity of logic. Ann. Pure Appl. Logic 59(3), 201–217 (1993). https://doi.org/10.1016/0168-0072(93)90093-S

    Article  MathSciNet  MATH  Google Scholar 

  10. Girard, J.-Y.: Light linear logic. Inf. Comput. 143(2), 175–204 (1998). https://doi.org/10.1006/inco.1998.2700

    Article  MathSciNet  MATH  Google Scholar 

  11. Kanovich, M., Kuznetsov, S., Scedrov, A.: On Lambek’s restriction in the presence of exponential modalities. In: Artemov, S., Nerode, A. (eds.) LFCS 2016. LNCS, vol. 9537, pp. 146–158. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-27683-0_11

    Chapter  MATH  Google Scholar 

  12. 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–256. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53042-9_14

    Chapter  Google Scholar 

  13. Kanovich, M., Kuznetsov, S., Scedrov, A.: Reconciling Lambek’s restriction, cut-elimination, and substitution in the presence of exponential modalities. Annals Pure Applied Logic, accepted for publication. arXiv:1608.02254 (2016)

  14. 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–340. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-55751-8_26

    Chapter  MATH  Google Scholar 

  15. Kanovich, M., Kuznetsov, S., Scedrov, A.: Lambek calculus enriched with multiplexing (abstract). In: International Conference of Mal’tsev Meeting 2018, Collection of Abstracts. Sobolev Institute of Mathematics and Novosibirsk State University, Novosibirsk (2018). http://www.math.nsc.ru/conference/malmeet/18/maltsev18.pdf

  16. Kanovich, M., Kuznetsov, S., Nigam, V., Scedrov, A.: Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci. (2018). https://doi.org/10.1017/S0960129518000117. Accessed 2 May 2018

  17. 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–245. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94205-6_16

    Chapter  Google Scholar 

  18. Kozen, D.: On the complexity of reasoning in Kleene algebra. Inf. Comput. 179, 152–162 (2002). https://doi.org/10.1006/inco.2001.2960

    Article  MathSciNet  MATH  Google Scholar 

  19. Kuznetsov, S.L.: On the Lambek calculus with a unit and one division. Moscow Univ. Math. Bull. 66(4), 173–175 (2011). https://doi.org/10.3103/S0027132211040085

    Article  MathSciNet  MATH  Google Scholar 

  20. 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–198. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-55386-2_13

    Chapter  Google Scholar 

  21. Lafont, Y.: Soft linear logic and polynomial time. Theor. Comput. Sci. 318(12), 163–180 (2004). https://doi.org/10.1016/j.tcs.2003.10.018

    Article  MathSciNet  MATH  Google Scholar 

  22. Lambek, J.: The mathematics of sentence structure. Am. Math. Mon. 65, 154–170 (1958). https://doi.org/10.2307/2310058

    Article  MathSciNet  MATH  Google Scholar 

  23. Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Ann. Pure Appl. Logic 56(1–3), 239–311 (1992). https://doi.org/10.1016/0168-0072(92)90075-B

    Article  MathSciNet  MATH  Google Scholar 

  24. Markov, A.: On the impossibility of certain algorithms in the theory of associative systems. Doklady Acad. Sci. USSR (N. S.) 55, 583–586 (1947)

    MathSciNet  Google Scholar 

  25. Moortgat, M.: Multimodal linguistic inference. J. Logic Lang. Inf. 5(3/4), 349–385 (1996). https://doi.org/10.1007/BF00159344

    Article  MathSciNet  MATH  Google Scholar 

  26. Morrill, G.: Categorial formalisation of relativisation: pied piping, islands, and extraction sites. Technical report LSI-92-23-R, Universitat Politècnica de Catalunya (1992)

    Google Scholar 

  27. Morrill, G.V.: Categorial Grammar: Logical Syntax, Semantics, and Processing. Oxford University Press, Oxford (2011)

    Google Scholar 

  28. Morrill, G., Valentín, O.: Computational coverage of TLG: nonlinearity. In: Proceedings of NLCS 2015. EPiC Series, vol. 32, pp. 51–63 (2015)

    Google Scholar 

  29. Morrill, G.: Grammar logicised: relativisation. Linguist. Philos. 40(2), 119–163 (2017). https://doi.org/10.1007/s10988-016-9197-0

    Article  Google Scholar 

  30. 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–101. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-662-57784-4_5

    Chapter  Google Scholar 

  31. Morrill, G.: A note on movement in logical grammar. J. Lang. Model. 6(2), 353–363 (2018). https://doi.org/10.15398/jlm.v6i2.233

    Article  Google Scholar 

  32. Morrill, G.: Parsing/theorem-proving for logical grammar CatLog3. J. Logic Lang. Inf. (2019). https://doi.org/10.1007/s10849-018-09277-w. Accessed 18 Jan 2019

    Article  MathSciNet  Google Scholar 

  33. Post, E.L.: Recursive unsolvability of a problem of Thue. J. Symb. Logic 12, 1–11 (1947)

    Article  MathSciNet  Google Scholar 

  34. Thue, A.: Probleme über Veränderungen von Zeichenreihen nach gegebener Regeln. Kra. Vidensk. Selsk. Skrifter. 10, 1–34 (1914)

    Google Scholar 

Download references

Acknowledgments

The authors are thankful to the anonymous referees for helpful comments and interesting questions. They would also like to thank Glyn Morrill for fruitful discussions of linguistic motivations for the calculi Morrill introduced in [27,28,29, 31, 32], which are considered in this paper.

Funding

The work of Max Kanovich and Andre Scedrov was supported by the Russian Science Foundation under grant 17-11-01294 and performed at National Research University Higher School of Economics, Moscow, Russia. The work of Stepan Kuznetsov was supported by the Young Russian Mathematics award, by the grant MK-430.2019.1 of the President of Russia, and by the Russian Foundation for Basic Research grant 18-01-00822. Section 3 was contributed by Kanovich and Scedrov. Section 4 was contributed by Kuznetsov. Sections 1, 2, and 5 were contributed jointly and equally by all co-authors.

Author information

Authors and Affiliations

  1. University College London, London, UK

    Max Kanovich

  2. Steklov Mathematical Institute of the RAS, Moscow, Russia

    Stepan Kuznetsov

  3. University of Pennsylvania, Philadelphia, USA

    Andre Scedrov

  4. National Research University Higher School of Economics, Moscow, Russia

    Max Kanovich, Stepan Kuznetsov & Andre Scedrov

  5. Institute of Oriental Studies of the RAS, Languages Department, Moscow, Russia

    Max Kanovich

Authors
  1. Max Kanovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stepan Kuznetsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andre Scedrov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stepan Kuznetsov .

Editor information

Editors and Affiliations

  1. University of Trento, Povo, Italy

    Raffaella Bernardi

  2. Universität Leipzig, Leipzig, Germany

    Greg Kobele

  3. LORIA, Inria Nancy, Villers-lès-Nancy, France

    Sylvain Pogodalla

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer-Verlag GmbH Germany, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kanovich, M., Kuznetsov, S., Scedrov, A. (2019). Undecidability of a Newly Proposed Calculus for CatLog3. In: Bernardi, R., Kobele, G., Pogodalla, S. (eds) Formal Grammar. FG 2019. Lecture Notes in Computer Science(), vol 11668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-59648-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-59648-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-59647-0

  • Online ISBN: 978-3-662-59648-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation