Proof nets for multiplicative and additive linear logic:
Abstract: "This paper extends the theory of proof nets from Multiplicative Linear Logic to Multiplicative and Additive Linear Logic, by removing the additive boxes. This yields uniqueness of normal form for that fragment and a classification of permutability of inferences in the calculus of seq...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1991
|
| Series: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
161 |
| Subjects: | |
| Summary: | Abstract: "This paper extends the theory of proof nets from Multiplicative Linear Logic to Multiplicative and Additive Linear Logic, by removing the additive boxes. This yields uniqueness of normal form for that fragment and a classification of permutability of inferences in the calculus of sequents for classical Linear Logic." |
| Physical Description: | 40 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009724286 | ||
| 003 | DE-604 | ||
| 005 | 19961025 | ||
| 007 | t | ||
| 008 | 940727s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25327442 | ||
| 035 | |a (DE-599)BVBBV009724286 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 084 | |a DAT 540f |2 stub | ||
| 100 | 1 | |a Bellin, Gianluigi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Proof nets for multiplicative and additive linear logic |c by Gianluigi Bellin |
| 264 | 1 | |a Edinburgh |c 1991 | |
| 300 | |a 40 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 161 | |
| 520 | 3 | |a Abstract: "This paper extends the theory of proof nets from Multiplicative Linear Logic to Multiplicative and Additive Linear Logic, by removing the additive boxes. This yields uniqueness of normal form for that fragment and a classification of permutability of inferences in the calculus of sequents for classical Linear Logic." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Proof theory | |
| 830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 161 |w (DE-604)BV008930032 |9 161 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006431801 | ||
Record in the Search Index
| _version_ | 1804124071576731648 |
|---|---|
| any_adam_object | |
| author | Bellin, Gianluigi |
| author_facet | Bellin, Gianluigi |
| author_role | aut |
| author_sort | Bellin, Gianluigi |
| author_variant | g b gb |
| building | Verbundindex |
| bvnumber | BV009724286 |
| classification_tum | DAT 540f |
| ctrlnum | (OCoLC)25327442 (DE-599)BVBBV009724286 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01368nam a2200325 cb4500</leader><controlfield tag="001">BV009724286</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961025 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940727s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25327442</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009724286</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 540f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bellin, Gianluigi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proof nets for multiplicative and additive linear logic</subfield><subfield code="c">by Gianluigi Bellin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">40 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">161</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper extends the theory of proof nets from Multiplicative Linear Logic to Multiplicative and Additive Linear Logic, by removing the additive boxes. This yields uniqueness of normal form for that fragment and a classification of permutability of inferences in the calculus of sequents for classical Linear Logic."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">161</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">161</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006431801</subfield></datafield></record></collection> |
| id | DE-604.BV009724286 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:39:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006431801 |
| oclc_num | 25327442 |
| open_access_boolean | |
| physical | 40 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
| series2 | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
| spelling | Bellin, Gianluigi Verfasser aut Proof nets for multiplicative and additive linear logic by Gianluigi Bellin Edinburgh 1991 40 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 161 Abstract: "This paper extends the theory of proof nets from Multiplicative Linear Logic to Multiplicative and Additive Linear Logic, by removing the additive boxes. This yields uniqueness of normal form for that fragment and a classification of permutability of inferences in the calculus of sequents for classical Linear Logic." Computer software sigle Mathematics sigle Mathematik Proof theory Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 161 (DE-604)BV008930032 161 |
| spellingShingle | Bellin, Gianluigi Proof nets for multiplicative and additive linear logic Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Computer software sigle Mathematics sigle Mathematik Proof theory |
| title | Proof nets for multiplicative and additive linear logic |
| title_auth | Proof nets for multiplicative and additive linear logic |
| title_exact_search | Proof nets for multiplicative and additive linear logic |
| title_full | Proof nets for multiplicative and additive linear logic by Gianluigi Bellin |
| title_fullStr | Proof nets for multiplicative and additive linear logic by Gianluigi Bellin |
| title_full_unstemmed | Proof nets for multiplicative and additive linear logic by Gianluigi Bellin |
| title_short | Proof nets for multiplicative and additive linear logic |
| title_sort | proof nets for multiplicative and additive linear logic |
| topic | Computer software sigle Mathematics sigle Mathematik Proof theory |
| topic_facet | Computer software Mathematics Mathematik Proof theory |
| volume_link | (DE-604)BV008930032 |
| work_keys_str_mv | AT bellingianluigi proofnetsformultiplicativeandadditivelinearlogic |