Proof transformations for equational theories:
Abstract: "This paper contrasts two kinds of proof systems for equational theories: the standard ones obtained by combining the axioms with the laws of equational logic, and alternative systems designed to yield decision procedures for equational problems. Although new matching algorithms for (...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
1989
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
181 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper contrasts two kinds of proof systems for equational theories: the standard ones obtained by combining the axioms with the laws of equational logic, and alternative systems designed to yield decision procedures for equational problems. Although new matching algorithms for (among other theories) associativity, associativity + commutativity, and associativity + commutativity + identity are presented, the emphasis is not so much on individual theories but on the general method of proof transformation as a tool for showing the equivalence of different proof systems After studying proof translations defined by rewriting systems, equivalence tests based on the notion of resolvant theories are used to derive new matching and in some cases unification procedures for a number of equational theories. Finally the computation of resolvant systems is investigated. |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010411141 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951006s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)20797582 | ||
| 035 | |a (DE-599)BVBBV010411141 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-19 | ||
| 100 | 1 | |a Nipkow, Tobias |d 1958- |e Verfasser |0 (DE-588)17275660X |4 aut | |
| 245 | 1 | 0 | |a Proof transformations for equational theories |
| 264 | 1 | |a Cambridge |c 1989 | |
| 300 | |a 17 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 181 | |
| 520 | 3 | |a Abstract: "This paper contrasts two kinds of proof systems for equational theories: the standard ones obtained by combining the axioms with the laws of equational logic, and alternative systems designed to yield decision procedures for equational problems. Although new matching algorithms for (among other theories) associativity, associativity + commutativity, and associativity + commutativity + identity are presented, the emphasis is not so much on individual theories but on the general method of proof transformation as a tool for showing the equivalence of different proof systems | |
| 520 | 3 | |a After studying proof translations defined by rewriting systems, equivalence tests based on the notion of resolvant theories are used to derive new matching and in some cases unification procedures for a number of equational theories. Finally the computation of resolvant systems is investigated. | |
| 650 | 7 | |a Information theory |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Proof theory | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 181 |w (DE-604)BV004055605 |9 181 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006933114 | ||
Datensatz im Suchindex
| _version_ | 1804124839284310016 |
|---|---|
| any_adam_object | |
| author | Nipkow, Tobias 1958- |
| author_GND | (DE-588)17275660X |
| author_facet | Nipkow, Tobias 1958- |
| author_role | aut |
| author_sort | Nipkow, Tobias 1958- |
| author_variant | t n tn |
| building | Verbundindex |
| bvnumber | BV010411141 |
| ctrlnum | (OCoLC)20797582 (DE-599)BVBBV010411141 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01865nam a2200337 cb4500</leader><controlfield tag="001">BV010411141</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951006s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20797582</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010411141</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-19</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nipkow, Tobias</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)17275660X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proof transformations for equational theories</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">181</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper contrasts two kinds of proof systems for equational theories: the standard ones obtained by combining the axioms with the laws of equational logic, and alternative systems designed to yield decision procedures for equational problems. Although new matching algorithms for (among other theories) associativity, associativity + commutativity, and associativity + commutativity + identity are presented, the emphasis is not so much on individual theories but on the general method of proof transformation as a tool for showing the equivalence of different proof systems</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">After studying proof translations defined by rewriting systems, equivalence tests based on the notion of resolvant theories are used to derive new matching and in some cases unification procedures for a number of equational theories. Finally the computation of resolvant systems is investigated.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information theory</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">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">181</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">181</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006933114</subfield></datafield></record></collection> |
| id | DE-604.BV010411141 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:02Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006933114 |
| oclc_num | 20797582 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM |
| owner_facet | DE-19 DE-BY-UBM |
| physical | 17 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Nipkow, Tobias 1958- Verfasser (DE-588)17275660X aut Proof transformations for equational theories Cambridge 1989 17 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 181 Abstract: "This paper contrasts two kinds of proof systems for equational theories: the standard ones obtained by combining the axioms with the laws of equational logic, and alternative systems designed to yield decision procedures for equational problems. Although new matching algorithms for (among other theories) associativity, associativity + commutativity, and associativity + commutativity + identity are presented, the emphasis is not so much on individual theories but on the general method of proof transformation as a tool for showing the equivalence of different proof systems After studying proof translations defined by rewriting systems, equivalence tests based on the notion of resolvant theories are used to derive new matching and in some cases unification procedures for a number of equational theories. Finally the computation of resolvant systems is investigated. Information theory sigle Mathematics sigle Mathematik Proof theory Computer Laboratory <Cambridge>: Technical report 181 (DE-604)BV004055605 181 |
| spellingShingle | Nipkow, Tobias 1958- Proof transformations for equational theories Computer Laboratory <Cambridge>: Technical report Information theory sigle Mathematics sigle Mathematik Proof theory |
| title | Proof transformations for equational theories |
| title_auth | Proof transformations for equational theories |
| title_exact_search | Proof transformations for equational theories |
| title_full | Proof transformations for equational theories |
| title_fullStr | Proof transformations for equational theories |
| title_full_unstemmed | Proof transformations for equational theories |
| title_short | Proof transformations for equational theories |
| title_sort | proof transformations for equational theories |
| topic | Information theory sigle Mathematics sigle Mathematik Proof theory |
| topic_facet | Information theory Mathematics Mathematik Proof theory |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT nipkowtobias prooftransformationsforequationaltheories |