Skip to main content Accessibility help
×
×
Home

The undecidability theorem for the Horn-like fragment of linear logic (Revisited)

  • MAX KANOVICH (a1) (a2)
Abstract

There has been an increased interest in the decision problems for linear logic and its fragments. Here, we give a fully self-contained, easy-to-follow, but fully detailed, direct and constructive proof of the undecidability of a very simple Horn-like fragment of linear logic, which is accessible to a wide range of people. Namely, we show that there is a direct correspondence between terminated computations of a Minsky machine M and cut-free linear logic derivations for a Horn-like sequent of the form

\begin{equation*} \bang{\Phi_M},\ l_1 \vdash l_0, \end{equation*}
where ΦM consists only of Horn-like implications of the following simple forms
\begin{equation*} (l \llto l'),\ \ ((l\otimes r) \llto l'),\ \ (l\llto (r\otimes l')),\ \ and \ \ (l\llto (l'\oplus l'')), \end{equation*}
where l1, l0, l, l′, l″ and r stand for literals.

Neither negation, nor &, nor constants, nor embedded implications/bangs are used here.

Furthermore, our particular correspondence constructed above provides decidability for each of the Horn-like fragments whenever we confine ourselves to any two forms of the above Horn-like implications, along with the complexity bounds that come from the proof.

Copyright
References
Hide All
Girard, J.-Y. (1987). Linear logic. Theoretical Computer Science 50 (1)1102.
Girard, J.-Y. (1995). Linear logic: Its syntax and semantics. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic, London Mathematical Society Lecture Notes, volume 222, Cambridge University Press 142.
Kanovich, M. (1995). The direct simulation of Minsky machines in linear logic. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic, London Mathematical Society Lecture Notes, volume 222, Cambridge University Press 123145.
Kosaraju, R.S. (1982). Decidability of reachability in vector addition systems. In: Proceedings of the 14th Annual Symposium on Theory of Computing 267–281. Preliminary Version.
Lincoln, P., Mitchell, J., Scedrov, A. and Shankar, N. (1992). Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56 (1–3)239311.
Mayr, E. (1984). An algorithm for the general Petri net reachability problem. SIAM Journal on Computing 13 (3)441460.
Minsky, M. (1961). Recursive unsolvability of Post's problem of ‘tag’ and other topics in the theory of Turing machines. Annals of Mathematics 74 (3)437455.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

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