Recursive inseparability in linear logic
We first give our version of the register machines to be simulated by proofs in propositional linear logic. Then we look further into the structure of the computations and show how to extract ”finite counter models” from this structure. In that way we get a version of Trakhtenbrots theorem without going through a completeness theorem for propositional linear logic. Lastly we show that the interpolant I in propositional linear logic of a provable formula A ⊸ B cannot be totally recursive in A and B.
Unable to display preview. Download preview PDF.
- B.E Börger. Berechenbarkeit, Komplexität, Logik. Vieweg Verlag 1985. English translation published by North-Holland.Google Scholar
- LMSS.P D Lincoln, J Mitchell, A Scedrov, N Shankar. Decision problems for propositional linear logic. In Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, St Louis, Missouri, October 1990.Google Scholar
- R.D Roorda Resource Logics: Proof-theoretical Investigations. Thesis. Amsterdam 1991.Google Scholar
- T.A S Troelstra. Lectures on linear logic. CSLI Lecture Notes No 29. 1991Google Scholar