Skip to main content
Article thumbnail
Location of Repository

Obsessional cliques: a semantic characterization of bounded time complexity

By Olivier Laurent and Lorenzo Tortora De Falco

Abstract

We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting the morphisms of the category REL to obsessional cliques yields models of ELL and SLL. Conversely, we prove that these models are relatively complete: an LL proof whose interpretation is an obsessional clique is always an ELL/SLL proof. These results are achieved by introducing a system of ELL/SLL untyped proof-nets, which is both correct and complete with respect to elementary/polynomial time complexity

Topics: computational complexity, linear logic, denotational semantics, [MATH.MATH-LO] Mathematics [math]/Logic [math.LO], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]
Publisher: IEEE
Year: 2006
DOI identifier: 10.1109/LICS.2006.37
OAI identifier: oai:HAL:hal-00096274v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.