In CSL’99 Roversi pointed out that the Turing machine encoding of Girard’s seminal paper ”Light Linear Logic” has a flaw. Moreover he presented a working version of the encoding in Light Affine Logic, but not in Light Linear Logic. In this paper we present a working version of the encoding in Light Linear Logic. The idea of the encoding is based on a remark… (More)

@article{Matsuoka2004PtimeCO,
title={P-time Completeness of Light Linear Logic and its Nondeterministic Extension},
author={Satoshi Matsuoka},
journal={CoRR},
year={2004},
volume={cs.LO/0410034}
}