Phase semantics for light linear logic (extended abstract)

Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov

Research output: Contribution to journalConference articlepeer-review

11 Citations (Scopus)


Light linear logic is a refinement of the propositions-as-types paradigm to polynomial-time computation. A semantic setting for the underlying logical system is introduced here in terms of fibred phase spaces. Strong completeness is established, with a purely semantic proof of cut elimination as a consequence. A number of mathematical examples of fibred phase spaces are presented that illustrate subtleties of light linear logic.

Original languageEnglish
Pages (from-to)221-234
Number of pages14
JournalElectronic Notes in Theoretical Computer Science
Publication statusPublished - 1997
Externally publishedYes
EventMFPS XIII, Mathematical Foundations of Progamming Semantics, Thirteenth Annual Conference - Pittsburgh, PA, United States
Duration: 1997 Mar 231997 Mar 26

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Phase semantics for light linear logic (extended abstract)'. Together they form a unique fingerprint.

Cite this