First-order logic and automated theorem proving:
This graduate-level text presents fundamental concepts and results of classical logic in a rigorous mathematical style. Applications to automated theorem proving are considered and usable Prolog programs provided. It will serve both as a first text in formal logic and an introduction to automation i...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York ; Berlin ; Heidelberg ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara ; Singapore ; Tokyo
Springer
1996
|
| Ausgabe: | Second edition |
| Schriftenreihe: | Graduate texts in computer science
|
| Schlagworte: | |
| Online-Zugang: | TUM02 TUM01 Volltext |
| Zusammenfassung: | This graduate-level text presents fundamental concepts and results of classical logic in a rigorous mathematical style. Applications to automated theorem proving are considered and usable Prolog programs provided. It will serve both as a first text in formal logic and an introduction to automation issues for students in computer science or mathematics. The book treats propositional logic, first-order logic, and first-order logic with equality. In each case the initial presentation is semantic, to define the intended subjects independently of the choice of proof mechanism. Then many kinds of proof procedure are introduced. Results such as completeness, compactness, and interpolation are established, and theorem provers are implemented in Prolog. This new edition includes material on AE calculus, Herbrand's Theorem, Gentzen's Theorem, and related topics |
| Beschreibung: | 1 Online-Ressource (xvi, 326 Seiten) Illustrationen |
| ISBN: | 9781461223603 |
| DOI: | 10.1007/978-1-4612-2360-3 |
Internformat
MARC
| LEADER | 00000nmm a22000001c 4500 | ||
|---|---|---|---|
| 001 | BV048296176 | ||
| 003 | DE-604 | ||
| 005 | 20220913 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 220623s1996 xxu|||| o||u| ||||||eng d | ||
| 020 | |a 9781461223603 |9 978-1-4612-2360-3 | ||
| 024 | 7 | |a 10.1007/978-1-4612-2360-3 |2 doi | |
| 035 | |a (OCoLC)1334062313 | ||
| 035 | |a (DE-599)GBV749242957 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c XD-US | ||
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA8.9-QA10.3 | |
| 082 | 0 | |a 005.131 |2 23 | |
| 084 | |a DAT 706 |2 stub | ||
| 084 | |a DAT 540 |2 stub | ||
| 084 | |a MAT 030 |2 stub | ||
| 100 | 1 | |a Fitting, Melvin |d 1942- |e Verfasser |0 (DE-588)172076331 |4 aut | |
| 245 | 1 | 0 | |a First-order logic and automated theorem proving |c Melvin Fitting |
| 250 | |a Second edition | ||
| 264 | 1 | |a New York ; Berlin ; Heidelberg ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara ; Singapore ; Tokyo |b Springer |c 1996 | |
| 300 | |a 1 Online-Ressource (xvi, 326 Seiten) |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Graduate texts in computer science | |
| 520 | 3 | |a This graduate-level text presents fundamental concepts and results of classical logic in a rigorous mathematical style. Applications to automated theorem proving are considered and usable Prolog programs provided. It will serve both as a first text in formal logic and an introduction to automation issues for students in computer science or mathematics. The book treats propositional logic, first-order logic, and first-order logic with equality. In each case the initial presentation is semantic, to define the intended subjects independently of the choice of proof mechanism. Then many kinds of proof procedure are introduced. Results such as completeness, compactness, and interpolation are established, and theorem provers are implemented in Prolog. This new edition includes material on AE calculus, Herbrand's Theorem, Gentzen's Theorem, and related topics | |
| 533 | |f Springer eBook Collection. Computer Science | ||
| 650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prädikatenlogik |0 (DE-588)4046974-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Stufe 1 |0 (DE-588)4362503-4 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Computer science | |
| 653 | 0 | |a Logic design | |
| 653 | 0 | |a Logic, Symbolic and mathematical | |
| 689 | 0 | 0 | |a Prädikatenlogik |0 (DE-588)4046974-8 |D s |
| 689 | 0 | 1 | |a Stufe 1 |0 (DE-588)4362503-4 |D s |
| 689 | 0 | 2 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
| 689 | 1 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-4612-7515-2 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4612-2360-3 |x Resolving-System |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-30-PQE | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-033676058 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4612-2360-3 |l TUM02 |p ZDB-30-PQE |x Resolving-System |3 Volltext | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/munchentech/detail.action?docID=3077179 |l TUM01 |p ZDB-30-PQE |q TUM_Einzelkauf_2022 |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804184133737381888 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Fitting, Melvin 1942- |
| author_GND | (DE-588)172076331 |
| author_facet | Fitting, Melvin 1942- |
| author_role | aut |
| author_sort | Fitting, Melvin 1942- |
| author_variant | m f mf |
| building | Verbundindex |
| bvnumber | BV048296176 |
| callnumber-first | Q - Science |
| callnumber-label | QA8 |
| callnumber-raw | QA8.9-QA10.3 |
| callnumber-search | QA8.9-QA10.3 |
| callnumber-sort | QA 18.9 Q A10 13 |
| callnumber-subject | QA - Mathematics |
| classification_tum | DAT 706 DAT 540 MAT 030 |
| collection | ZDB-30-PQE |
| ctrlnum | (OCoLC)1334062313 (DE-599)GBV749242957 |
| dewey-full | 005.131 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.131 |
| dewey-search | 005.131 |
| dewey-sort | 15.131 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/978-1-4612-2360-3 |
| edition | Second edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03342nmm a22006131c 4500</leader><controlfield tag="001">BV048296176</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220913 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">220623s1996 xxu|||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461223603</subfield><subfield code="9">978-1-4612-2360-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4612-2360-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1334062313</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV749242957</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA8.9-QA10.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.131</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 540</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 030</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fitting, Melvin</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)172076331</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">First-order logic and automated theorem proving</subfield><subfield code="c">Melvin Fitting</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York ; Berlin ; Heidelberg ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara ; Singapore ; Tokyo</subfield><subfield code="b">Springer</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xvi, 326 Seiten)</subfield><subfield code="b">Illustrationen</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Graduate texts in computer science</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This graduate-level text presents fundamental concepts and results of classical logic in a rigorous mathematical style. Applications to automated theorem proving are considered and usable Prolog programs provided. It will serve both as a first text in formal logic and an introduction to automation issues for students in computer science or mathematics. The book treats propositional logic, first-order logic, and first-order logic with equality. In each case the initial presentation is semantic, to define the intended subjects independently of the choice of proof mechanism. Then many kinds of proof procedure are introduced. Results such as completeness, compactness, and interpolation are established, and theorem provers are implemented in Prolog. This new edition includes material on AE calculus, Herbrand's Theorem, Gentzen's Theorem, and related topics</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">Springer eBook Collection. Computer Science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prädikatenlogik</subfield><subfield code="0">(DE-588)4046974-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Stufe 1</subfield><subfield code="0">(DE-588)4362503-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer science</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Logic design</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Prädikatenlogik</subfield><subfield code="0">(DE-588)4046974-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Stufe 1</subfield><subfield code="0">(DE-588)4362503-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-4612-7515-2</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4612-2360-3</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033676058</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4612-2360-3</subfield><subfield code="l">TUM02</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="x">Resolving-System</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/munchentech/detail.action?docID=3077179</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">TUM_Einzelkauf_2022</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV048296176 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T20:05:19Z |
| indexdate | 2024-07-10T09:34:30Z |
| institution | BVB |
| isbn | 9781461223603 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033676058 |
| oclc_num | 1334062313 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 1 Online-Ressource (xvi, 326 Seiten) Illustrationen |
| psigel | ZDB-30-PQE ZDB-30-PQE TUM_Einzelkauf_2022 |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Springer |
| record_format | marc |
| series2 | Graduate texts in computer science |
| spelling | Fitting, Melvin 1942- Verfasser (DE-588)172076331 aut First-order logic and automated theorem proving Melvin Fitting Second edition New York ; Berlin ; Heidelberg ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara ; Singapore ; Tokyo Springer 1996 1 Online-Ressource (xvi, 326 Seiten) Illustrationen txt rdacontent c rdamedia cr rdacarrier Graduate texts in computer science This graduate-level text presents fundamental concepts and results of classical logic in a rigorous mathematical style. Applications to automated theorem proving are considered and usable Prolog programs provided. It will serve both as a first text in formal logic and an introduction to automation issues for students in computer science or mathematics. The book treats propositional logic, first-order logic, and first-order logic with equality. In each case the initial presentation is semantic, to define the intended subjects independently of the choice of proof mechanism. Then many kinds of proof procedure are introduced. Results such as completeness, compactness, and interpolation are established, and theorem provers are implemented in Prolog. This new edition includes material on AE calculus, Herbrand's Theorem, Gentzen's Theorem, and related topics Springer eBook Collection. Computer Science Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Prädikatenlogik (DE-588)4046974-8 gnd rswk-swf Stufe 1 (DE-588)4362503-4 gnd rswk-swf Computer science Logic design Logic, Symbolic and mathematical Prädikatenlogik (DE-588)4046974-8 s Stufe 1 (DE-588)4362503-4 s Automatisches Beweisverfahren (DE-588)4069034-9 s DE-604 Mathematische Logik (DE-588)4037951-6 s Erscheint auch als Druck-Ausgabe 978-1-4612-7515-2 https://doi.org/10.1007/978-1-4612-2360-3 Resolving-System URL des Erstveröffentlichers Volltext |
| spellingShingle | Fitting, Melvin 1942- First-order logic and automated theorem proving Automatisches Beweisverfahren (DE-588)4069034-9 gnd Mathematische Logik (DE-588)4037951-6 gnd Prädikatenlogik (DE-588)4046974-8 gnd Stufe 1 (DE-588)4362503-4 gnd |
| subject_GND | (DE-588)4069034-9 (DE-588)4037951-6 (DE-588)4046974-8 (DE-588)4362503-4 |
| title | First-order logic and automated theorem proving |
| title_auth | First-order logic and automated theorem proving |
| title_exact_search | First-order logic and automated theorem proving |
| title_exact_search_txtP | First-order logic and automated theorem proving |
| title_full | First-order logic and automated theorem proving Melvin Fitting |
| title_fullStr | First-order logic and automated theorem proving Melvin Fitting |
| title_full_unstemmed | First-order logic and automated theorem proving Melvin Fitting |
| title_short | First-order logic and automated theorem proving |
| title_sort | first order logic and automated theorem proving |
| topic | Automatisches Beweisverfahren (DE-588)4069034-9 gnd Mathematische Logik (DE-588)4037951-6 gnd Prädikatenlogik (DE-588)4046974-8 gnd Stufe 1 (DE-588)4362503-4 gnd |
| topic_facet | Automatisches Beweisverfahren Mathematische Logik Prädikatenlogik Stufe 1 |
| url | https://doi.org/10.1007/978-1-4612-2360-3 |
| work_keys_str_mv | AT fittingmelvin firstorderlogicandautomatedtheoremproving |