Stratified Bounded Affine Logic for Logarithmic Space

@article{Schpp2007StratifiedBA,
  title={Stratified Bounded Affine Logic for Logarithmic Space},
  author={Ulrich Sch{\"o}pp},
  journal={22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)},
  year={2007},
  pages={411-420}
}
A number of complexity classes, most notably PTIME, have been characterised by sub-systems of linear logic. In this paper we show that the functions computable in logarithmic space can also be characterised by a restricted version of linear logic. We introduce stratified bounded affine logic (SBAL), a restricted version of bounded linear logic, in which not only the modality, but also the universal quantifier is bounded by a resource polynomial. We show that the proofs of certain sequents in… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Linear Logic

Theor. Comput. Sci. • 1987
View 11 Excerpts
Highly Influenced

Complexity Aspects of Programming Language Design

P. Møller-Neegaard
PhD thesis, Brandeis University • 2004
View 1 Excerpt

Soft linear logic and polynomial time

Theor. Comput. Sci. • 2004
View 1 Excerpt

Geometry of Interaction and Linear Combinatory Algebras

Mathematical Structures in Computer Science • 2002
View 3 Excerpts

Similar Papers

Loading similar papers…