## Light Affine Set Theory: A Naive Set Theory of Polynomial Time (2004)

Citations: | 8 - 1 self |

### BibTeX

@MISC{Terui04lightaffine,

author = {Kazushige Terui},

title = { Light Affine Set Theory: A Naive Set Theory of Polynomial Time},

year = {2004}

}

### OpenURL

### Abstract

In [7], a naive set theory is introduced based on a polynomial time logical system, Light Linear Logic (LLL). Although it is reasonably claimed that the set theory inherits the intrinsically polytime character from the underlying logic LLL, the discussion there is largely informal, and a formal justification of the claim is not provided sufficiently. Moreover, the syntax is quite complicated in that it is based on a non-traditional hybrid sequent calculus which is required for formulating LLL. In this paper, we consider a naive set theory based on Intuitionistic Light Affine Logic (ILAL), a simplification of LLL introduced by [1], and call it Light Affine Set Theory (LAST). The simplicity of LAST allows us to rigorously verify its polytime character. In particular, we prove that a function over {0, 1} ∗ is computable in polynomial time if and only if it is provably total in LAST.