A decision procedure revisited: notes on direct logic, linear logic and its implementations
Abstract: "This paper studies decidable fragments of predicate calculus. We will focus on the structure of Direct Predicate Calculus as defined in [Ketonen and Weyhrauch 1984] in the light of the recent work of Girard [Girard 1987, 1988 A and B] on Linear Logic. Several graph- theoretic results...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1991
|
Schriftenreihe: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
167 |
Schlagworte: | |
Zusammenfassung: | Abstract: "This paper studies decidable fragments of predicate calculus. We will focus on the structure of Direct Predicate Calculus as defined in [Ketonen and Weyhrauch 1984] in the light of the recent work of Girard [Girard 1987, 1988 A and B] on Linear Logic. Several graph- theoretic results are used to prove correspondences between systems of Natural Deduction, Direct Predicate Logic, and Linear Logic. In addition, the implementation of a decision procedure for Direct Predicate Logic is sketched." |
Beschreibung: | 36 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009724299 | ||
003 | DE-604 | ||
005 | 19961025 | ||
007 | t | ||
008 | 940727s1991 |||| 00||| eng d | ||
035 | |a (OCoLC)25327415 | ||
035 | |a (DE-599)BVBBV009724299 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
084 | |a DAT 706f |2 stub | ||
084 | |a DAT 540f |2 stub | ||
100 | 1 | |a Bellin, Gianluigi |e Verfasser |4 aut | |
245 | 1 | 0 | |a A decision procedure revisited |b notes on direct logic, linear logic and its implementations |c by Gianluigi Bellin and Jussi Ketonen |
264 | 1 | |a Edinburgh |c 1991 | |
300 | |a 36 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 167 | |
520 | 3 | |a Abstract: "This paper studies decidable fragments of predicate calculus. We will focus on the structure of Direct Predicate Calculus as defined in [Ketonen and Weyhrauch 1984] in the light of the recent work of Girard [Girard 1987, 1988 A and B] on Linear Logic. Several graph- theoretic results are used to prove correspondences between systems of Natural Deduction, Direct Predicate Logic, and Linear Logic. In addition, the implementation of a decision procedure for Direct Predicate Logic is sketched." | |
650 | 4 | |a Künstliche Intelligenz | |
650 | 4 | |a Artificial intelligence | |
650 | 4 | |a Proof theory | |
700 | 1 | |a Ketonen, Jussi |e Verfasser |4 aut | |
830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 167 |w (DE-604)BV008930032 |9 167 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006431813 |
Datensatz im Suchindex
_version_ | 1804124071574634496 |
---|---|
any_adam_object | |
author | Bellin, Gianluigi Ketonen, Jussi |
author_facet | Bellin, Gianluigi Ketonen, Jussi |
author_role | aut aut |
author_sort | Bellin, Gianluigi |
author_variant | g b gb j k jk |
building | Verbundindex |
bvnumber | BV009724299 |
classification_tum | DAT 706f DAT 540f |
ctrlnum | (OCoLC)25327415 (DE-599)BVBBV009724299 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01658nam a2200337 cb4500</leader><controlfield tag="001">BV009724299</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)25327415</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009724299</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 706f</subfield><subfield code="2">stub</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">A decision procedure revisited</subfield><subfield code="b">notes on direct logic, linear logic and its implementations</subfield><subfield code="c">by Gianluigi Bellin and Jussi Ketonen</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">36 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">167</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper studies decidable fragments of predicate calculus. We will focus on the structure of Direct Predicate Calculus as defined in [Ketonen and Weyhrauch 1984] in the light of the recent work of Girard [Girard 1987, 1988 A and B] on Linear Logic. Several graph- theoretic results are used to prove correspondences between systems of Natural Deduction, Direct Predicate Logic, and Linear Logic. In addition, the implementation of a decision procedure for Direct Predicate Logic is sketched."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ketonen, Jussi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">167</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">167</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006431813</subfield></datafield></record></collection> |
id | DE-604.BV009724299 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:39:50Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006431813 |
oclc_num | 25327415 |
open_access_boolean | |
physical | 36 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 A decision procedure revisited notes on direct logic, linear logic and its implementations by Gianluigi Bellin and Jussi Ketonen Edinburgh 1991 36 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 167 Abstract: "This paper studies decidable fragments of predicate calculus. We will focus on the structure of Direct Predicate Calculus as defined in [Ketonen and Weyhrauch 1984] in the light of the recent work of Girard [Girard 1987, 1988 A and B] on Linear Logic. Several graph- theoretic results are used to prove correspondences between systems of Natural Deduction, Direct Predicate Logic, and Linear Logic. In addition, the implementation of a decision procedure for Direct Predicate Logic is sketched." Künstliche Intelligenz Artificial intelligence Proof theory Ketonen, Jussi Verfasser aut Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 167 (DE-604)BV008930032 167 |
spellingShingle | Bellin, Gianluigi Ketonen, Jussi A decision procedure revisited notes on direct logic, linear logic and its implementations Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Künstliche Intelligenz Artificial intelligence Proof theory |
title | A decision procedure revisited notes on direct logic, linear logic and its implementations |
title_auth | A decision procedure revisited notes on direct logic, linear logic and its implementations |
title_exact_search | A decision procedure revisited notes on direct logic, linear logic and its implementations |
title_full | A decision procedure revisited notes on direct logic, linear logic and its implementations by Gianluigi Bellin and Jussi Ketonen |
title_fullStr | A decision procedure revisited notes on direct logic, linear logic and its implementations by Gianluigi Bellin and Jussi Ketonen |
title_full_unstemmed | A decision procedure revisited notes on direct logic, linear logic and its implementations by Gianluigi Bellin and Jussi Ketonen |
title_short | A decision procedure revisited |
title_sort | a decision procedure revisited notes on direct logic linear logic and its implementations |
title_sub | notes on direct logic, linear logic and its implementations |
topic | Künstliche Intelligenz Artificial intelligence Proof theory |
topic_facet | Künstliche Intelligenz Artificial intelligence Proof theory |
volume_link | (DE-604)BV008930032 |
work_keys_str_mv | AT bellingianluigi adecisionprocedurerevisitednotesondirectlogiclinearlogicanditsimplementations AT ketonenjussi adecisionprocedurerevisitednotesondirectlogiclinearlogicanditsimplementations |