Logic for computer science: foundations of automatic theorem proving
This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested i...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Mineola, New York
Dover Publications, Inc.
2015
|
| Ausgabe: | Second edition, Dover edition |
| Schriftenreihe: | Dover books on computer science
|
| Schlagworte: | |
| Online-Zugang: | TUM01 |
| Zusammenfassung: | This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in fir |
| Beschreibung: | "This Dover edition, first published in 2015, is an unabridged republication of the revised 2003 online edition of the work originally published by Harper & Row, New York, in 1986. A new Preface to the Dover Edition has been specially prepared for this volume." |
| Beschreibung: | 1 Online-Ressource |
| ISBN: | 9780486805085 0486805085 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV048294601 | ||
| 003 | DE-604 | ||
| 005 | 20220913 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 220622s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9780486805085 |9 978-0-486-80508-5 | ||
| 020 | |a 0486805085 |9 0486805085 | ||
| 035 | |a (OCoLC)1334046004 | ||
| 035 | |a (DE-599)BVBBV048294601 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 540 |2 stub | ||
| 084 | |a MAT 036 |2 stub | ||
| 084 | |a DAT 530 |2 stub | ||
| 084 | |a DAT 706 |2 stub | ||
| 084 | |a DAT 350 |2 stub | ||
| 100 | 1 | |a Gallier, Jean H. |d 1949- |e Verfasser |0 (DE-588)122585615 |4 aut | |
| 245 | 1 | 0 | |a Logic for computer science |b foundations of automatic theorem proving |c Jean H. Gallier, Department of Computer and Information Science University of Pennsylvania |
| 250 | |a Second edition, Dover edition | ||
| 264 | 1 | |a Mineola, New York |b Dover Publications, Inc. |c 2015 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Dover books on computer science | |
| 500 | |a "This Dover edition, first published in 2015, is an unabridged republication of the revised 2003 online edition of the work originally published by Harper & Row, New York, in 1986. A new Preface to the Dover Edition has been specially prepared for this volume." | ||
| 505 | 8 | |a Cover; Title page; Copyright; Table of Contents; Preface (Dover Edition); Preface (1985 Edition); How to use this Book as A Text; Chapter 1: Introduction; Chapter 2: Mathematical Preliminaries; 2.1 Relations, Functions, Partial Orders, Induction; 2.1.1 Relations; 2.1.2 Partial Functions, Total Functions; 2.1.3 Composition of Relations and Functions; 2.1.4 Injections, Surjections, Bijections; 2.1.5 Direct Image, Inverse Image; 2.1.6 Sequences; 2.1.7 Natural Numbers and Countability; 2.1.8 Equivalence Relations; 2.1.9 Partial and Total Orders; 2.1.10 Well-Founded Sets and Complete Induction | |
| 505 | 8 | |a 3.3.1 The Semantics of Propositions3.3.2 Satisfiability, Unsatisfiability, Tautologies; 3.3.3 Truth Functions and Functionally Complete Sets of Connectives; 3.3.4 Logical Equivalence and Boolean Algebras; * 3.3.5 NP-Complete Problems; Problems; 3.4 Proof Theory of Propositional Logic: The Gentzen System G2 3.4.1 Basic Idea: Searching for a Counter Example; 3.4.2 Sequents and the Gentzen System G'; 3.4.3 Falsifiable and Valid Sequents; 3.4.4 Axioms, Deduction Trees, Proof Trees, Counter Example Trees; 3.4.5 Soundness of the Gentzen System G2 ; 3.4.6 The Search Procedure | |
| 505 | 8 | |a 3.4.7 Completeness of the Gentzen System G2 .4.8 Conjunctive and Disjunctive Normal Form; 3.4.9 Negation Normal Form; Problems; 3.5 Proof Theory for Infinite Sequents: Extended Completeness of G2 ; 3.5.1 Infinite Sequents; 3.5.2 The Search Procedure for Infinite Sequents; 3.5.3 König's Lemma; 3.5.4 Signed Formulae; 3.5.5 Hintikka Sets; 3.5.6 Extended Completeness of the Gentzen System G2 3.5.7 Compactness, Model Existence, Consistency; 3.5.8 Maximal Consistent Sets; Problems; 3.6 More on Gentzen Systems: The Cut Rule; 3.6.1 Using Auxiliary Lemmas in Proofs; 3.6.2 The Gentzen System LK2 | |
| 505 | 8 | |a 3.6.3 Logical Equivalence of G2 LK2 and LK2 -- {cut}3.6.4 Gentzen's Hauptsatz for LK2 (Cut elimination theorem for LK'); 3.6.5 Characterization of Consistency in LK2 Problems; Notes and Suggestions for Further Reading; Chapter 4: Resolution in Propositional Logic; 4.1 Introduction; 4.2 A Special Gentzen System; 4.2.1 Definition of the System GCNF2 4.2.2 Soundness of the System GCNF2 4.2.3 Completeness of the System GCNF2 Problems; 4.3 The Resolution Method for Propositional Logic; 4.3.1 Resolution DAGs; 4.3.2 Definition of the Resolution Method for Propositional Logic | |
| 520 | 3 | |a This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in fir | |
| 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 |
| 653 | 0 | |a Automatic theorem proving | |
| 653 | 0 | |a Logic, Symbolic and mathematical | |
| 653 | 0 | |a Théorèmes / Démonstration automatique | |
| 653 | 0 | |a Logique symbolique et mathématique | |
| 653 | 0 | |a MATHEMATICS / General | |
| 653 | 0 | |a MATHEMATICS / Logic | |
| 653 | 0 | |a COMPUTERS / Computer Science | |
| 653 | 0 | |a Automatic theorem proving | |
| 653 | 0 | |a Logic, Symbolic and mathematical | |
| 653 | 6 | |a Electronic books | |
| 689 | 0 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
| 689 | 0 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |z 978-0-486-78082-5 |a Gallier, Jean H. |t Logic for Computer Science : Foundations of Automatic Theorem Proving, Second Edition |d Newburyport : Dover Publications, ©2015 |n Druck-Ausgabe, Paperback |z 978-0-486-78082-5 |z 0-486-78082-1 |
| 912 | |a ZDB-4-NLEBK | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-033674505 | ||
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1156459 |l TUM01 |p ZDB-4-NLEBK |q TUM_Einzelkauf_2022 |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804184130952364032 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Gallier, Jean H. 1949- |
| author_GND | (DE-588)122585615 |
| author_facet | Gallier, Jean H. 1949- |
| author_role | aut |
| author_sort | Gallier, Jean H. 1949- |
| author_variant | j h g jh jhg |
| building | Verbundindex |
| bvnumber | BV048294601 |
| classification_tum | DAT 540 MAT 036 DAT 530 DAT 706 DAT 350 |
| collection | ZDB-4-NLEBK |
| contents | Cover; Title page; Copyright; Table of Contents; Preface (Dover Edition); Preface (1985 Edition); How to use this Book as A Text; Chapter 1: Introduction; Chapter 2: Mathematical Preliminaries; 2.1 Relations, Functions, Partial Orders, Induction; 2.1.1 Relations; 2.1.2 Partial Functions, Total Functions; 2.1.3 Composition of Relations and Functions; 2.1.4 Injections, Surjections, Bijections; 2.1.5 Direct Image, Inverse Image; 2.1.6 Sequences; 2.1.7 Natural Numbers and Countability; 2.1.8 Equivalence Relations; 2.1.9 Partial and Total Orders; 2.1.10 Well-Founded Sets and Complete Induction 3.3.1 The Semantics of Propositions3.3.2 Satisfiability, Unsatisfiability, Tautologies; 3.3.3 Truth Functions and Functionally Complete Sets of Connectives; 3.3.4 Logical Equivalence and Boolean Algebras; * 3.3.5 NP-Complete Problems; Problems; 3.4 Proof Theory of Propositional Logic: The Gentzen System G2 3.4.1 Basic Idea: Searching for a Counter Example; 3.4.2 Sequents and the Gentzen System G'; 3.4.3 Falsifiable and Valid Sequents; 3.4.4 Axioms, Deduction Trees, Proof Trees, Counter Example Trees; 3.4.5 Soundness of the Gentzen System G2 ; 3.4.6 The Search Procedure 3.4.7 Completeness of the Gentzen System G2 .4.8 Conjunctive and Disjunctive Normal Form; 3.4.9 Negation Normal Form; Problems; 3.5 Proof Theory for Infinite Sequents: Extended Completeness of G2 ; 3.5.1 Infinite Sequents; 3.5.2 The Search Procedure for Infinite Sequents; 3.5.3 König's Lemma; 3.5.4 Signed Formulae; 3.5.5 Hintikka Sets; 3.5.6 Extended Completeness of the Gentzen System G2 3.5.7 Compactness, Model Existence, Consistency; 3.5.8 Maximal Consistent Sets; Problems; 3.6 More on Gentzen Systems: The Cut Rule; 3.6.1 Using Auxiliary Lemmas in Proofs; 3.6.2 The Gentzen System LK2 3.6.3 Logical Equivalence of G2 LK2 and LK2 -- {cut}3.6.4 Gentzen's Hauptsatz for LK2 (Cut elimination theorem for LK'); 3.6.5 Characterization of Consistency in LK2 Problems; Notes and Suggestions for Further Reading; Chapter 4: Resolution in Propositional Logic; 4.1 Introduction; 4.2 A Special Gentzen System; 4.2.1 Definition of the System GCNF2 4.2.2 Soundness of the System GCNF2 4.2.3 Completeness of the System GCNF2 Problems; 4.3 The Resolution Method for Propositional Logic; 4.3.1 Resolution DAGs; 4.3.2 Definition of the Resolution Method for Propositional Logic |
| ctrlnum | (OCoLC)1334046004 (DE-599)BVBBV048294601 |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | Second edition, Dover edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05657nmm a2200637 c 4500</leader><controlfield tag="001">BV048294601</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220913 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">220622s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780486805085</subfield><subfield code="9">978-0-486-80508-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0486805085</subfield><subfield code="9">0486805085</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1334046004</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048294601</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</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 036</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530</subfield><subfield code="2">stub</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 350</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gallier, Jean H.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122585615</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Logic for computer science</subfield><subfield code="b">foundations of automatic theorem proving</subfield><subfield code="c">Jean H. Gallier, Department of Computer and Information Science University of Pennsylvania</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition, Dover edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Mineola, New York</subfield><subfield code="b">Dover Publications, Inc.</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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">Dover books on computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"This Dover edition, first published in 2015, is an unabridged republication of the revised 2003 online edition of the work originally published by Harper & Row, New York, in 1986. A new Preface to the Dover Edition has been specially prepared for this volume."</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Cover; Title page; Copyright; Table of Contents; Preface (Dover Edition); Preface (1985 Edition); How to use this Book as A Text; Chapter 1: Introduction; Chapter 2: Mathematical Preliminaries; 2.1 Relations, Functions, Partial Orders, Induction; 2.1.1 Relations; 2.1.2 Partial Functions, Total Functions; 2.1.3 Composition of Relations and Functions; 2.1.4 Injections, Surjections, Bijections; 2.1.5 Direct Image, Inverse Image; 2.1.6 Sequences; 2.1.7 Natural Numbers and Countability; 2.1.8 Equivalence Relations; 2.1.9 Partial and Total Orders; 2.1.10 Well-Founded Sets and Complete Induction</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">3.3.1 The Semantics of Propositions3.3.2 Satisfiability, Unsatisfiability, Tautologies; 3.3.3 Truth Functions and Functionally Complete Sets of Connectives; 3.3.4 Logical Equivalence and Boolean Algebras; * 3.3.5 NP-Complete Problems; Problems; 3.4 Proof Theory of Propositional Logic: The Gentzen System G2 3.4.1 Basic Idea: Searching for a Counter Example; 3.4.2 Sequents and the Gentzen System G'; 3.4.3 Falsifiable and Valid Sequents; 3.4.4 Axioms, Deduction Trees, Proof Trees, Counter Example Trees; 3.4.5 Soundness of the Gentzen System G2 ; 3.4.6 The Search Procedure</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">3.4.7 Completeness of the Gentzen System G2 .4.8 Conjunctive and Disjunctive Normal Form; 3.4.9 Negation Normal Form; Problems; 3.5 Proof Theory for Infinite Sequents: Extended Completeness of G2 ; 3.5.1 Infinite Sequents; 3.5.2 The Search Procedure for Infinite Sequents; 3.5.3 König's Lemma; 3.5.4 Signed Formulae; 3.5.5 Hintikka Sets; 3.5.6 Extended Completeness of the Gentzen System G2 3.5.7 Compactness, Model Existence, Consistency; 3.5.8 Maximal Consistent Sets; Problems; 3.6 More on Gentzen Systems: The Cut Rule; 3.6.1 Using Auxiliary Lemmas in Proofs; 3.6.2 The Gentzen System LK2</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">3.6.3 Logical Equivalence of G2 LK2 and LK2 -- {cut}3.6.4 Gentzen's Hauptsatz for LK2 (Cut elimination theorem for LK'); 3.6.5 Characterization of Consistency in LK2 Problems; Notes and Suggestions for Further Reading; Chapter 4: Resolution in Propositional Logic; 4.1 Introduction; 4.2 A Special Gentzen System; 4.2.1 Definition of the System GCNF2 4.2.2 Soundness of the System GCNF2 4.2.3 Completeness of the System GCNF2 Problems; 4.3 The Resolution Method for Propositional Logic; 4.3.1 Resolution DAGs; 4.3.2 Definition of the Resolution Method for Propositional Logic</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in fir</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="653" ind1=" " ind2="0"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Théorèmes / Démonstration automatique</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Logique symbolique et mathématique</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">MATHEMATICS / General</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">MATHEMATICS / Logic</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">COMPUTERS / Computer Science</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="653" ind1=" " ind2="6"><subfield code="a">Electronic books</subfield></datafield><datafield tag="689" ind1="0" 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="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="z">978-0-486-78082-5</subfield><subfield code="a">Gallier, Jean H.</subfield><subfield code="t">Logic for Computer Science : Foundations of Automatic Theorem Proving, Second Edition</subfield><subfield code="d">Newburyport : Dover Publications, ©2015</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-0-486-78082-5</subfield><subfield code="z">0-486-78082-1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-NLEBK</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033674505</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1156459</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-4-NLEBK</subfield><subfield code="q">TUM_Einzelkauf_2022</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV048294601 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T20:04:42Z |
| indexdate | 2024-07-10T09:34:27Z |
| institution | BVB |
| isbn | 9780486805085 0486805085 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033674505 |
| oclc_num | 1334046004 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 1 Online-Ressource |
| psigel | ZDB-4-NLEBK ZDB-4-NLEBK TUM_Einzelkauf_2022 |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Dover Publications, Inc. |
| record_format | marc |
| series2 | Dover books on computer science |
| spelling | Gallier, Jean H. 1949- Verfasser (DE-588)122585615 aut Logic for computer science foundations of automatic theorem proving Jean H. Gallier, Department of Computer and Information Science University of Pennsylvania Second edition, Dover edition Mineola, New York Dover Publications, Inc. 2015 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Dover books on computer science "This Dover edition, first published in 2015, is an unabridged republication of the revised 2003 online edition of the work originally published by Harper & Row, New York, in 1986. A new Preface to the Dover Edition has been specially prepared for this volume." Cover; Title page; Copyright; Table of Contents; Preface (Dover Edition); Preface (1985 Edition); How to use this Book as A Text; Chapter 1: Introduction; Chapter 2: Mathematical Preliminaries; 2.1 Relations, Functions, Partial Orders, Induction; 2.1.1 Relations; 2.1.2 Partial Functions, Total Functions; 2.1.3 Composition of Relations and Functions; 2.1.4 Injections, Surjections, Bijections; 2.1.5 Direct Image, Inverse Image; 2.1.6 Sequences; 2.1.7 Natural Numbers and Countability; 2.1.8 Equivalence Relations; 2.1.9 Partial and Total Orders; 2.1.10 Well-Founded Sets and Complete Induction 3.3.1 The Semantics of Propositions3.3.2 Satisfiability, Unsatisfiability, Tautologies; 3.3.3 Truth Functions and Functionally Complete Sets of Connectives; 3.3.4 Logical Equivalence and Boolean Algebras; * 3.3.5 NP-Complete Problems; Problems; 3.4 Proof Theory of Propositional Logic: The Gentzen System G2 3.4.1 Basic Idea: Searching for a Counter Example; 3.4.2 Sequents and the Gentzen System G'; 3.4.3 Falsifiable and Valid Sequents; 3.4.4 Axioms, Deduction Trees, Proof Trees, Counter Example Trees; 3.4.5 Soundness of the Gentzen System G2 ; 3.4.6 The Search Procedure 3.4.7 Completeness of the Gentzen System G2 .4.8 Conjunctive and Disjunctive Normal Form; 3.4.9 Negation Normal Form; Problems; 3.5 Proof Theory for Infinite Sequents: Extended Completeness of G2 ; 3.5.1 Infinite Sequents; 3.5.2 The Search Procedure for Infinite Sequents; 3.5.3 König's Lemma; 3.5.4 Signed Formulae; 3.5.5 Hintikka Sets; 3.5.6 Extended Completeness of the Gentzen System G2 3.5.7 Compactness, Model Existence, Consistency; 3.5.8 Maximal Consistent Sets; Problems; 3.6 More on Gentzen Systems: The Cut Rule; 3.6.1 Using Auxiliary Lemmas in Proofs; 3.6.2 The Gentzen System LK2 3.6.3 Logical Equivalence of G2 LK2 and LK2 -- {cut}3.6.4 Gentzen's Hauptsatz for LK2 (Cut elimination theorem for LK'); 3.6.5 Characterization of Consistency in LK2 Problems; Notes and Suggestions for Further Reading; Chapter 4: Resolution in Propositional Logic; 4.1 Introduction; 4.2 A Special Gentzen System; 4.2.1 Definition of the System GCNF2 4.2.2 Soundness of the System GCNF2 4.2.3 Completeness of the System GCNF2 Problems; 4.3 The Resolution Method for Propositional Logic; 4.3.1 Resolution DAGs; 4.3.2 Definition of the Resolution Method for Propositional Logic This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in fir Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Automatic theorem proving Logic, Symbolic and mathematical Théorèmes / Démonstration automatique Logique symbolique et mathématique MATHEMATICS / General MATHEMATICS / Logic COMPUTERS / Computer Science Electronic books Automatisches Beweisverfahren (DE-588)4069034-9 s Mathematische Logik (DE-588)4037951-6 s DE-604 Erscheint auch als 978-0-486-78082-5 Gallier, Jean H. Logic for Computer Science : Foundations of Automatic Theorem Proving, Second Edition Newburyport : Dover Publications, ©2015 Druck-Ausgabe, Paperback 978-0-486-78082-5 0-486-78082-1 |
| spellingShingle | Gallier, Jean H. 1949- Logic for computer science foundations of automatic theorem proving Cover; Title page; Copyright; Table of Contents; Preface (Dover Edition); Preface (1985 Edition); How to use this Book as A Text; Chapter 1: Introduction; Chapter 2: Mathematical Preliminaries; 2.1 Relations, Functions, Partial Orders, Induction; 2.1.1 Relations; 2.1.2 Partial Functions, Total Functions; 2.1.3 Composition of Relations and Functions; 2.1.4 Injections, Surjections, Bijections; 2.1.5 Direct Image, Inverse Image; 2.1.6 Sequences; 2.1.7 Natural Numbers and Countability; 2.1.8 Equivalence Relations; 2.1.9 Partial and Total Orders; 2.1.10 Well-Founded Sets and Complete Induction 3.3.1 The Semantics of Propositions3.3.2 Satisfiability, Unsatisfiability, Tautologies; 3.3.3 Truth Functions and Functionally Complete Sets of Connectives; 3.3.4 Logical Equivalence and Boolean Algebras; * 3.3.5 NP-Complete Problems; Problems; 3.4 Proof Theory of Propositional Logic: The Gentzen System G2 3.4.1 Basic Idea: Searching for a Counter Example; 3.4.2 Sequents and the Gentzen System G'; 3.4.3 Falsifiable and Valid Sequents; 3.4.4 Axioms, Deduction Trees, Proof Trees, Counter Example Trees; 3.4.5 Soundness of the Gentzen System G2 ; 3.4.6 The Search Procedure 3.4.7 Completeness of the Gentzen System G2 .4.8 Conjunctive and Disjunctive Normal Form; 3.4.9 Negation Normal Form; Problems; 3.5 Proof Theory for Infinite Sequents: Extended Completeness of G2 ; 3.5.1 Infinite Sequents; 3.5.2 The Search Procedure for Infinite Sequents; 3.5.3 König's Lemma; 3.5.4 Signed Formulae; 3.5.5 Hintikka Sets; 3.5.6 Extended Completeness of the Gentzen System G2 3.5.7 Compactness, Model Existence, Consistency; 3.5.8 Maximal Consistent Sets; Problems; 3.6 More on Gentzen Systems: The Cut Rule; 3.6.1 Using Auxiliary Lemmas in Proofs; 3.6.2 The Gentzen System LK2 3.6.3 Logical Equivalence of G2 LK2 and LK2 -- {cut}3.6.4 Gentzen's Hauptsatz for LK2 (Cut elimination theorem for LK'); 3.6.5 Characterization of Consistency in LK2 Problems; Notes and Suggestions for Further Reading; Chapter 4: Resolution in Propositional Logic; 4.1 Introduction; 4.2 A Special Gentzen System; 4.2.1 Definition of the System GCNF2 4.2.2 Soundness of the System GCNF2 4.2.3 Completeness of the System GCNF2 Problems; 4.3 The Resolution Method for Propositional Logic; 4.3.1 Resolution DAGs; 4.3.2 Definition of the Resolution Method for Propositional Logic Automatisches Beweisverfahren (DE-588)4069034-9 gnd Mathematische Logik (DE-588)4037951-6 gnd |
| subject_GND | (DE-588)4069034-9 (DE-588)4037951-6 |
| title | Logic for computer science foundations of automatic theorem proving |
| title_auth | Logic for computer science foundations of automatic theorem proving |
| title_exact_search | Logic for computer science foundations of automatic theorem proving |
| title_exact_search_txtP | Logic for computer science foundations of automatic theorem proving |
| title_full | Logic for computer science foundations of automatic theorem proving Jean H. Gallier, Department of Computer and Information Science University of Pennsylvania |
| title_fullStr | Logic for computer science foundations of automatic theorem proving Jean H. Gallier, Department of Computer and Information Science University of Pennsylvania |
| title_full_unstemmed | Logic for computer science foundations of automatic theorem proving Jean H. Gallier, Department of Computer and Information Science University of Pennsylvania |
| title_short | Logic for computer science |
| title_sort | logic for computer science foundations of automatic theorem proving |
| title_sub | foundations of automatic theorem proving |
| topic | Automatisches Beweisverfahren (DE-588)4069034-9 gnd Mathematische Logik (DE-588)4037951-6 gnd |
| topic_facet | Automatisches Beweisverfahren Mathematische Logik |
| work_keys_str_mv | AT gallierjeanh logicforcomputersciencefoundationsofautomatictheoremproving |