Event domains, stable functions and proof-nets
<p>We pursue the program of exposing the intrinsic mathematical structure of the &apos;&apos;space of proofs&apos;&apos; of a logical system [S. Abramsky and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, <em>Journal of Symboli...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2007
|
| Subjects: |
| _version_ | 1826302394748633088 |
|---|---|
| author | Abramsky, S |
| author_facet | Abramsky, S |
| author_sort | Abramsky, S |
| collection | OXFORD |
| description | <p>We pursue the program of exposing the intrinsic mathematical structure of the &apos;&apos;space of proofs&apos;&apos; of a logical system [S. Abramsky and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, <em>Journal of Symbolic Logic</em>, (1994), vol. 59, no. 2, 543–574]. We study the case of Multiplicative-Additive Linear Logic (MALL). We use tools from Domain theory to develop a semantic notion of proof net for MALL, and prove a Sequentialization Theorem. This work forms part of a continuation of previous joint work with Radha Jagadeesan [S. Abramsky and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, <em>Journal of Symbolic Logic</em>, (1994), vol. 59, no. 2, 543–574] and Paul-André Melliès [S. Abramsky and P.-A. Melliès. Concurrent Games and Full Completeness. <em>Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science</em>, 431–44, 1999].</p> |
| first_indexed | 2024-03-07T05:46:53Z |
| format | Journal article |
| id | oxford-uuid:e782b755-bbdb-437f-8d4b-b1701826eaca |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T05:46:53Z |
| publishDate | 2007 |
| record_format | dspace |
| spelling | oxford-uuid:e782b755-bbdb-437f-8d4b-b1701826eaca2022-03-27T10:39:20ZEvent domains, stable functions and proof-netsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:e782b755-bbdb-437f-8d4b-b1701826eacaComputer science (mathematics)EnglishOxford University Research Archive - Valet2007Abramsky, S<p>We pursue the program of exposing the intrinsic mathematical structure of the &apos;&apos;space of proofs&apos;&apos; of a logical system [S. Abramsky and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, <em>Journal of Symbolic Logic</em>, (1994), vol. 59, no. 2, 543–574]. We study the case of Multiplicative-Additive Linear Logic (MALL). We use tools from Domain theory to develop a semantic notion of proof net for MALL, and prove a Sequentialization Theorem. This work forms part of a continuation of previous joint work with Radha Jagadeesan [S. Abramsky and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, <em>Journal of Symbolic Logic</em>, (1994), vol. 59, no. 2, 543–574] and Paul-André Melliès [S. Abramsky and P.-A. Melliès. Concurrent Games and Full Completeness. <em>Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science</em>, 431–44, 1999].</p> |
| spellingShingle | Computer science (mathematics) Abramsky, S Event domains, stable functions and proof-nets |
| title | Event domains, stable functions and proof-nets |
| title_full | Event domains, stable functions and proof-nets |
| title_fullStr | Event domains, stable functions and proof-nets |
| title_full_unstemmed | Event domains, stable functions and proof-nets |
| title_short | Event domains, stable functions and proof-nets |
| title_sort | event domains stable functions and proof nets |
| topic | Computer science (mathematics) |
| work_keys_str_mv | AT abramskys eventdomainsstablefunctionsandproofnets |