Skip to main content Accessibility help
×
Home

UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS

  • KAREL CHVALOVSKÝ (a1)

Abstract

We prove that the consequence relation in the Full Non-associative Lambek Calculus is undecidable. An encoding of the halting problem for 2-tag systems using finitely many sequents in the language {⋅,∨} is presented. Therefore already the consequence relation in this fragment is undecidable. Moreover, the construction works even when the structural rules of exchange and contraction are added.

Copyright

References

Hide All
[1]Blok, Willem J. and van Alten, Clint J., On the finite embeddability property for residuated ordered groupoids. Transactions of the American Mathematical Society, vol. 357 (2004), no. 10, pp. 41414157.
[2]Buszkowski, Wojciech, Some decision problems in the theory of syntactic categories. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 28 (1982), no. 33–38, pp. 539548.
[3]Buszkowski, Wojciech, Lambek calculus with nonlogical axioms, Language and grammar: Studies in mathematical linguistics and natural language (Casadio, C., Scott, P. J., and Seely, R. A. G., editors), CSLI Lecture Notes, no. 168, CSLI, Stanford, CA, 2005, pp. 7793.
[4]Buszkowski, Wojciech and Farulewski, Maciej, Non-associative Lambek calculus with additives and context-free languages, Languages: From formal to natural (Grumberg, Orna, Kaminski, Michael, Katz, Shmuel, and Wintner, Shuly, editors), Lecture Notes in Computer Science, no. 5533, Springer, Berlin, Heidelberg, 2009, pp. 4558.
[5]Cocke, John and Minsky, Marvin Lee, Universality of Tag systems with P=2. Journal of the ACM, vol. 11 (1964), no. 1, pp. 1520.
[6]Došen, Kosta, Sequent-systems and groupoid models. I. Studia Logica, vol. 47 (1988), no. 4, pp. 353385 (English).
[7]Farulewski, Maciej, Finite embeddability property for residuated groupoids. Reports on Mathematical Logic, vol. 43 (2008), pp. 2542.
[8]Galatos, Nikolaos, Jipsen, Peter, Kowalski, Tomasz, and Ono, Hiroakira, Residuated lattices: An algebraic glimpse at substructural logics, Studies in Logic and the Foundations of Mathematics, vol. 151, Elsevier, Amsterdam, 2007.
[9]Galatos, Nikolaos and Ono, Hiroakira, Cut elimination and strong separation for substructural logics: An algebraic approach. Annals of Pure and Applied Logic, vol. 161 (2010), no. 9, pp. 10971133.
[10]Grätzer, George, Lattice theory: Foundation, Birkhäuser, Basel, 2011.
[11]Haniková, Zuzana and Horčík, Rostislav, Finite embeddability property for residuated groupoids. Algebra Universalis, vol. 72 (2014), no. 1, pp. 113. doi:10.1007/s00012-014-0284-1.
[12]Hori, Ryuichi, Ono, Hiroakira, and Schellinx, Harold, Extending intuitionistic linear logic with knotted structural rules. Notre Dame Journal of Formal Logic, vol. 35(1994), no. 2, pp. 219242.
[13]Lambek, Joachim, The mathematics of sentence structure. American Mathematical Monthly, vol. 65 (1958), no. 3, pp. 154170.
[14]Lambek, Joachim, On the calculus of syntactic types, Structure of language and its mathematical aspects (Jakobson, Roman, editor), American Mathematical Society, Providence, RI, 1961, pp. 166178.
[15]Ono, Hiroakira, Proof-theoretic methods in nonclassical logic: An introduction, Theories of types and proofs (Takahashi, M., Okada, M., and Dezani-Ciancaglini, M., editors), MSJ Memoirs, vol. 2, Mathematical Society of Japan, Tokyo, 1998, pp. 207254.
[16]Post, Emil Leon, Formal reductions of the general combinatorial decision problem. American Journal of Mathematics, vol. 65 (1943), no. 2, pp. 197215.
[17]Troelstra, Anne Sjerp, Lectures on linear logic, CSLI lecture notes, no. 29, Center for the Study of Language and Information, Stanford, CA, 1992.

Keywords

UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS

  • KAREL CHVALOVSKÝ (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed