A proof environment for arithmetic with the omega rule:
Abstract: "An important technique for investigating derivability in formal systems of arithmetic has been to embed such systems into semi- formal systems with the [omega]-rule. This paper exploits this notion within the domain of automated theorem-proving and discusses the implementation of suc...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1993
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
645 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "An important technique for investigating derivability in formal systems of arithmetic has been to embed such systems into semi- formal systems with the [omega]-rule. This paper exploits this notion within the domain of automated theorem-proving and discusses the implementation of such a proof environment, namely the CORE system which implements a version of the primitive recursive [omega]-rule. This involves providing an appropriate representation for infinite proofs, and a means of verifying properties of such objects. By means of the CORE system, from a finite number of instances a conjecture for a proof of the universally quantified formula is automatically derived by an inductive inference algorithm, and checked for correctness. In addition, candidates for cut formulae are generated by an explanation-based learning algorithm." |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010464662 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951107s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31987508 | ||
| 035 | |a (DE-599)BVBBV010464662 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA76.952 | |
| 100 | 1 | |a Baker, Siani |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A proof environment for arithmetic with the omega rule |c Siani Baker and Alan Smaill |
| 264 | 1 | |a Edinburgh |c 1993 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 645 | |
| 520 | 3 | |a Abstract: "An important technique for investigating derivability in formal systems of arithmetic has been to embed such systems into semi- formal systems with the [omega]-rule. This paper exploits this notion within the domain of automated theorem-proving and discusses the implementation of such a proof environment, namely the CORE system which implements a version of the primitive recursive [omega]-rule. This involves providing an appropriate representation for infinite proofs, and a means of verifying properties of such objects. By means of the CORE system, from a finite number of instances a conjecture for a proof of the universally quantified formula is automatically derived by an inductive inference algorithm, and checked for correctness. In addition, candidates for cut formulae are generated by an explanation-based learning algorithm." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Automatic theorem proving | |
| 700 | 1 | |a Smaill, Alan |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 645 |w (DE-604)BV010450646 |9 645 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006972912 | ||
Datensatz im Suchindex
| _version_ | 1804124897022050304 |
|---|---|
| any_adam_object | |
| author | Baker, Siani Smaill, Alan |
| author_facet | Baker, Siani Smaill, Alan |
| author_role | aut aut |
| author_sort | Baker, Siani |
| author_variant | s b sb a s as |
| building | Verbundindex |
| bvnumber | BV010464662 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.952 |
| callnumber-search | QA76.952 |
| callnumber-sort | QA 276.952 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)31987508 (DE-599)BVBBV010464662 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02039nam a2200361 cb4500</leader><controlfield tag="001">BV010464662</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951107s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31987508</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010464662</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-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.952</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baker, Siani</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A proof environment for arithmetic with the omega rule</subfield><subfield code="c">Siani Baker and Alan Smaill</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">645</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "An important technique for investigating derivability in formal systems of arithmetic has been to embed such systems into semi- formal systems with the [omega]-rule. This paper exploits this notion within the domain of automated theorem-proving and discusses the implementation of such a proof environment, namely the CORE system which implements a version of the primitive recursive [omega]-rule. This involves providing an appropriate representation for infinite proofs, and a means of verifying properties of such objects. By means of the CORE system, from a finite number of instances a conjecture for a proof of the universally quantified formula is automatically derived by an inductive inference algorithm, and checked for correctness. In addition, candidates for cut formulae are generated by an explanation-based learning algorithm."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</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">Automatic theorem proving</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Smaill, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">645</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">645</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006972912</subfield></datafield></record></collection> |
| id | DE-604.BV010464662 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:57Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006972912 |
| oclc_num | 31987508 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Baker, Siani Verfasser aut A proof environment for arithmetic with the omega rule Siani Baker and Alan Smaill Edinburgh 1993 13 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 645 Abstract: "An important technique for investigating derivability in formal systems of arithmetic has been to embed such systems into semi- formal systems with the [omega]-rule. This paper exploits this notion within the domain of automated theorem-proving and discusses the implementation of such a proof environment, namely the CORE system which implements a version of the primitive recursive [omega]-rule. This involves providing an appropriate representation for infinite proofs, and a means of verifying properties of such objects. By means of the CORE system, from a finite number of instances a conjecture for a proof of the universally quantified formula is automatically derived by an inductive inference algorithm, and checked for correctness. In addition, candidates for cut formulae are generated by an explanation-based learning algorithm." Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Smaill, Alan Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 645 (DE-604)BV010450646 645 |
| spellingShingle | Baker, Siani Smaill, Alan A proof environment for arithmetic with the omega rule Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving |
| title | A proof environment for arithmetic with the omega rule |
| title_auth | A proof environment for arithmetic with the omega rule |
| title_exact_search | A proof environment for arithmetic with the omega rule |
| title_full | A proof environment for arithmetic with the omega rule Siani Baker and Alan Smaill |
| title_fullStr | A proof environment for arithmetic with the omega rule Siani Baker and Alan Smaill |
| title_full_unstemmed | A proof environment for arithmetic with the omega rule Siani Baker and Alan Smaill |
| title_short | A proof environment for arithmetic with the omega rule |
| title_sort | a proof environment for arithmetic with the omega rule |
| topic | Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic theorem proving |
| topic_facet | Bionics and artificial intelligence Computer software Mathematics Mathematik Automatic theorem proving |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT bakersiani aproofenvironmentforarithmeticwiththeomegarule AT smaillalan aproofenvironmentforarithmeticwiththeomegarule |