First order logic and automated theorem proving:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
New York [u.a.]
Springer
1996
|
| Ausgabe: | 2. ed. |
| Schriftenreihe: | Graduate texts in computer science
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | WST: First-order logic and automated theorem proving. - Literaturverz. S. 315 - 318 |
| Beschreibung: | XVI, 326 S. |
| ISBN: | 0387945938 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010613253 | ||
| 003 | DE-604 | ||
| 005 | 20021206 | ||
| 007 | t| | ||
| 008 | 960129s1996 gw |||| 00||| ger d | ||
| 016 | 7 | |a 946514143 |2 DE-101 | |
| 020 | |a 0387945938 |c Pp. : DM 68.00 |9 0-387-94593-8 | ||
| 035 | |a (OCoLC)247119105 | ||
| 035 | |a (DE-599)BVBBV010613253 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29T |a DE-91G |a DE-739 |a DE-19 |a DE-473 |a DE-11 |a DE-188 | ||
| 082 | 0 | |a 511.3 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a ST 304 |0 (DE-625)143653: |2 rvk | ||
| 084 | |a MAT 030f |2 stub | ||
| 084 | |a DAT 706f |2 stub | ||
| 084 | |a DAT 540f |2 stub | ||
| 100 | 1 | |a Fitting, Melvin |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a First order logic and automated theorem proving |c Melvin Fitting |
| 246 | 1 | 3 | |a First-order logic and automated theorem proving |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a New York [u.a.] |b Springer |c 1996 | |
| 300 | |a XVI, 326 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Graduate texts in computer science | |
| 500 | |a WST: First-order logic and automated theorem proving. - Literaturverz. S. 315 - 318 | ||
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Stufe 1 |0 (DE-588)4362503-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prädikatenlogik |0 (DE-588)4046974-8 |2 gnd |9 rswk-swf |
| 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 | |8 1\p |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007080864&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007080864 | |
Datensatz im Suchindex
| _version_ | 1826212314712375296 |
|---|---|
| adam_text |
MELVIN FITTING
FIRST-ORDER LOGIC
AND
AUTOMATED
THEOREM
PROVING
SECOND EDITION
SPRINGER
CONTENTS
PREFACE VII
PREFACE TO THE SECOND EDITION XI
1 BACKGROUND 1
2 PROPOSITIONAL LOGIC 9
2.1 INTRODUCTION 9
2.2 PROPOSITIONAL LOGIC-SYNTAX 10
2.3 PROPOSITIONAL LOGIC-SEMANTICS 14
2.4 BOOLEAN VALUATIONS 16
2.5 THE REPLACEMENT THEOREM 20
2.6 UNIFORM NOTATION 23
2.7 KONIG'S LEMMA 26
2.8 NORMAL FORMS 27
2.9 NORMAL FORM IMPLEMENTATIONS 35
XIV CONTENTS
3 SEMANTIC TABLEAUX AND RESOLUTION 41
3.1 PROPOSITIONAL SEMANTIC TABLEAUX 41
3.2 PROPOSITIONAL TABLEAUX IMPLEMENTATIONS 47
3.3 PROPOSITIONAL RESOLUTION ., 51
3.4 SOUNDNESS 55
3.5 HINTIKKA'S LEMMA 58
3.6 THE MODEL EXISTENCE THEOREM 59
3.7 TABLEAU AND RESOLUTION COMPLETENESS 64
3.8 COMPLETENESS WITH RESTRICTIONS 69
3.9 PROPOSITIONAL CONSEQUENCE 74
4 OTHER PROPOSITIONAL PROOF PROCEDURES 77
4.1 HILBERT SYSTEMS 77
4.2 NATURAL DEDUCTION 86
4.3 THE SEQUENT CALCULUS 92
4.4 THE DAVIS-PUTNAM PROCEDURE 98
4.5 COMPUTATIONAL COMPLEXITY 104
5 FIRST-ORDER LOGIC 109.
5.1 FIRST-ORDER LOGIC-SYNTAX 109
5.2 SUBSTITUTIONS 113
5.3 FIRST-ORDER SEMANTICS 117
5.4 HERBRAND MODELS 123
5.5 FIRST-ORDER UNIFORM NOTATION 124
5.6 HINTIKKA'S LEMMA 127
5.7 PARAMETERS 128
5.8 THE MODEL EXISTENCE THEOREM 129
5.9 APPLICATIONS 132
5.10 LOGICAL CONSEQUENCE . . 135
CONTENTS XV
6 FIRST-ORDER PROOF
PROCEDURES
137
6.1
FIRST-ORDER SEMANTIC TABLEAUX 137
6.2 FIRST-ORDER RESOLUTION 141
6.3 SOUNDNESS 142
6.4 COMPLETENESS 143
6.5 HILBERT SYSTEMS 146
6.6 NATURAL DEDUCTION AND GENTZEN SEQUENTS 149
7 IMPLEMENTING TABLEAUX AND RESOLUTION 151
7.1 WHAT NEXT 151
7.2 UNIFICATION 152
7.3 UNIFICATION IMPLEMENTED 161
7.4 FREE-VARIABLE SEMANTIC TABLEAUX 166
7.5 A TABLEAU IMPLEMENTATION 169
7.6 FREE-VARIABLE RESOLUTION 184
7.7 SOUNDNESS 188
7.8 FREE-VARIABLE TABLEAU COMPLETENESS 191
7.9 FREE-VARIABLE RESOLUTION COMPLETENESS 196
8 FURTHER FIRST-ORDER FEATURES 203
8.1 INTRODUCTION 203
8.2 THE REPLACEMENT THEOREM 203
8.3 SKOLEMIZATION 206
8.4 PRENEX FORM 209
8.5 THE AE-CALCULUS 212
8.6 HERBRAND'S THEOREM 215
8.7 HERBRAND'S THEOREM, CONSTRUCTIVELY 221
8.8 GENTZEN'S THEOREM 225
8.9 CUT ELIMINATION 228
8.10 DO CUTS SHORTEN PROOFS? 243
8.11 CRAIG'S INTERPOLATION THEOREM 254
8.12 CRAIG'S INTERPOLATION THEOREM-CONSTRUCTIVELY 257
8.13 BETH'S DEFINABILITY THEOREM 263
8.14 LYNDON'S HOMORNORPHISM THEOREM 266
XVI CONTENTS
9 EQUALITY
271
9.1 INTRODUCTION 271
9.2 SYNTAX AND SEMANTICS 273
9.3 THE EQUALITY AXIOMS 276
9.4 HINTIKKA'S LEMMA 279
9.5 THE MODEL EXISTENCE THEOREM 284
9.6 CONSEQUENCES 285
9.7 TABLEAU AND RESOLUTION SYSTEMS 288
9.8 ALTERNATE TABLEAU AND RESOLUTION SYSTEMS 294
9.9 A FREE-VARIABLE TABLEAU SYSTEM WITH EQUALITY 298
9.10 A TABLEAU IMPLEMENTATION WITH EQUALITY 305
9.11 PARAMODULATION 312
REFERENCES .
315
INDEX 319 |
| any_adam_object | 1 |
| author | Fitting, Melvin |
| author_facet | Fitting, Melvin |
| author_role | aut |
| author_sort | Fitting, Melvin |
| author_variant | m f mf |
| building | Verbundindex |
| bvnumber | BV010613253 |
| classification_rvk | SK 130 ST 304 |
| classification_tum | MAT 030f DAT 706f DAT 540f |
| ctrlnum | (OCoLC)247119105 (DE-599)BVBBV010613253 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV010613253</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20021206</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960129s1996 gw |||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">946514143</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387945938</subfield><subfield code="c">Pp. : DM 68.00</subfield><subfield code="9">0-387-94593-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)247119105</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010613253</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 304</subfield><subfield code="0">(DE-625)143653:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 030f</subfield><subfield code="2">stub</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">Fitting, Melvin</subfield><subfield code="e">Verfasser</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="246" ind1="1" ind2="3"><subfield code="a">First-order logic and automated theorem proving</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 326 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="0" ind2=" "><subfield code="a">Graduate texts in computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">WST: First-order logic and automated theorem proving. - Literaturverz. S. 315 - 318</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">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">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="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="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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007080864&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007080864</subfield></datafield></record></collection> |
| id | DE-604.BV010613253 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-10T13:02:59Z |
| institution | BVB |
| isbn | 0387945938 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007080864 |
| oclc_num | 247119105 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM DE-739 DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-11 DE-188 |
| owner_facet | DE-29T DE-91G DE-BY-TUM DE-739 DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-11 DE-188 |
| physical | XVI, 326 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Springer |
| record_format | marc |
| series2 | Graduate texts in computer science |
| spelling | Fitting, Melvin Verfasser aut First order logic and automated theorem proving Melvin Fitting First-order logic and automated theorem proving 2. ed. New York [u.a.] Springer 1996 XVI, 326 S. txt rdacontent n rdamedia nc rdacarrier Graduate texts in computer science WST: First-order logic and automated theorem proving. - Literaturverz. S. 315 - 318 Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Stufe 1 (DE-588)4362503-4 gnd rswk-swf Prädikatenlogik (DE-588)4046974-8 gnd rswk-swf 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 1\p DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007080864&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Fitting, Melvin First order logic and automated theorem proving Mathematische Logik (DE-588)4037951-6 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd Stufe 1 (DE-588)4362503-4 gnd Prädikatenlogik (DE-588)4046974-8 gnd |
| subject_GND | (DE-588)4037951-6 (DE-588)4069034-9 (DE-588)4362503-4 (DE-588)4046974-8 |
| title | First order logic and automated theorem proving |
| title_alt | 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_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 | Mathematische Logik (DE-588)4037951-6 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd Stufe 1 (DE-588)4362503-4 gnd Prädikatenlogik (DE-588)4046974-8 gnd |
| topic_facet | Mathematische Logik Automatisches Beweisverfahren Stufe 1 Prädikatenlogik |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007080864&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT fittingmelvin firstorderlogicandautomatedtheoremproving |