A proof system for finite trees:
Abstract: "In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal lo...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1995
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,63 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol [2] and Blackburn and Meyer-Viol [5]. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving." |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011064802 | ||
| 003 | DE-604 | ||
| 005 | 20200123 | ||
| 007 | t | ||
| 008 | 961118s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)35649311 | ||
| 035 | |a (DE-599)BVBBV011064802 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 088 | |a CS R9563 | ||
| 100 | 1 | |a Blackburn, Patrick |d 1959- |e Verfasser |0 (DE-588)174091478 |4 aut | |
| 245 | 1 | 0 | |a A proof system for finite trees |c P. Blackburn ; W. Meyer-Viol ; M. de Rijke |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 95,63 | |
| 520 | 3 | |a Abstract: "In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol [2] and Blackburn and Meyer-Viol [5]. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving." | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Meyer-Viol, Wilfried |e Verfasser |4 aut | |
| 700 | 1 | |a Rijke, Maarten de |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,63 |w (DE-604)BV008928356 |9 95,63 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007410710 | ||
Datensatz im Suchindex
| _version_ | 1804125553910874112 |
|---|---|
| any_adam_object | |
| author | Blackburn, Patrick 1959- Meyer-Viol, Wilfried Rijke, Maarten de |
| author_GND | (DE-588)174091478 |
| author_facet | Blackburn, Patrick 1959- Meyer-Viol, Wilfried Rijke, Maarten de |
| author_role | aut aut aut |
| author_sort | Blackburn, Patrick 1959- |
| author_variant | p b pb w m v wmv m d r md mdr |
| building | Verbundindex |
| bvnumber | BV011064802 |
| ctrlnum | (OCoLC)35649311 (DE-599)BVBBV011064802 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01761nam a2200337 cb4500</leader><controlfield tag="001">BV011064802</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200123 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961118s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35649311</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011064802</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="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">CS R9563</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Blackburn, Patrick</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)174091478</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A proof system for finite trees</subfield><subfield code="c">P. Blackburn ; W. Meyer-Viol ; M. de Rijke</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">95,63</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol [2] and Blackburn and Meyer-Viol [5]. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meyer-Viol, Wilfried</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rijke, Maarten de</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">95,63</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,63</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007410710</subfield></datafield></record></collection> |
| id | DE-604.BV011064802 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007410710 |
| oclc_num | 35649311 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | 19 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Blackburn, Patrick 1959- Verfasser (DE-588)174091478 aut A proof system for finite trees P. Blackburn ; W. Meyer-Viol ; M. de Rijke Amsterdam 1995 19 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,63 Abstract: "In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol [2] and Blackburn and Meyer-Viol [5]. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving." Logic, Symbolic and mathematical Trees (Graph theory) Meyer-Viol, Wilfried Verfasser aut Rijke, Maarten de Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,63 (DE-604)BV008928356 95,63 |
| spellingShingle | Blackburn, Patrick 1959- Meyer-Viol, Wilfried Rijke, Maarten de A proof system for finite trees Logic, Symbolic and mathematical Trees (Graph theory) |
| title | A proof system for finite trees |
| title_auth | A proof system for finite trees |
| title_exact_search | A proof system for finite trees |
| title_full | A proof system for finite trees P. Blackburn ; W. Meyer-Viol ; M. de Rijke |
| title_fullStr | A proof system for finite trees P. Blackburn ; W. Meyer-Viol ; M. de Rijke |
| title_full_unstemmed | A proof system for finite trees P. Blackburn ; W. Meyer-Viol ; M. de Rijke |
| title_short | A proof system for finite trees |
| title_sort | a proof system for finite trees |
| topic | Logic, Symbolic and mathematical Trees (Graph theory) |
| topic_facet | Logic, Symbolic and mathematical Trees (Graph theory) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT blackburnpatrick aproofsystemforfinitetrees AT meyerviolwilfried aproofsystemforfinitetrees AT rijkemaartende aproofsystemforfinitetrees |