Mathematical logic for computer science:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
London ; Heidelberg ; New York ; Dordrecht
Springer
2012
|
| Ausgabe: | Third edition |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | xv, 346 Seiten Diagramme |
| ISBN: | 9781447141280 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV040338661 | ||
| 003 | DE-604 | ||
| 005 | 20201205 | ||
| 007 | t | ||
| 008 | 120727s2012 |||| |||| 00||| eng d | ||
| 020 | |a 9781447141280 |c pbk |9 978-1-4471-4128-0 | ||
| 035 | |a (OCoLC)802788985 | ||
| 035 | |a (DE-599)HBZHT017222897 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-573 |a DE-83 | ||
| 084 | |a 03-01 |2 msc | ||
| 084 | |a 68T27 |2 msc | ||
| 084 | |a DAT 540f |2 stub | ||
| 084 | |a MAT 030f |2 stub | ||
| 084 | |a 03B70 |2 msc | ||
| 084 | |a 68N17 |2 msc | ||
| 100 | 1 | |a Ben-Arî, Môtî |d 1948- |0 (DE-588)121144844 |4 aut | |
| 245 | 1 | 0 | |a Mathematical logic for computer science |c Mordechai Ben-Ari |
| 250 | |a Third edition | ||
| 264 | 1 | |a London ; Heidelberg ; New York ; Dordrecht |b Springer |c 2012 | |
| 300 | |a xv, 346 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logische Programmierung |0 (DE-588)4195096-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logik |0 (DE-588)4036202-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Logik |0 (DE-588)4036202-4 |D s |
| 689 | 1 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-4471-4129-7 |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025192957&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-025192957 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804149370919059456 |
|---|---|
| adam_text | Titel: Mathematical logic for computer science
Autor: Ben-Arî, Môtî
Jahr: 2012
Contents
1 Introduction................................ 1
1.1 The Origins of Mathematical Logic................ 1
1.2 Propositional Logic........................ 2
1.3 First-Order Logic ......................... 3
1.4 Modal and Temporal Logics.................... 4
1.5 Program Verification........................ 5
1.6 Summary.............................. 5
1.7 Further Reading.......................... 6
1.8 Exercise.............................. 6
References................................. 6
2 Propositional Logic: Formulas, Models, Tableaux........... 7
2.1 Propositional Formulas...................... 7
2.2 Interpretations........................... 16
2.3 Logical Equivalence........................ 21
2.4 Sets of Boolean Operators *.................... 26
2.5 Satisfiability, Validity and Consequence.............. 29
2.6 Semantic Tableaux......................... 33
2.7 Soundness and Completeness................... 39
2.8 Summary.............................. 44
2.9 Further Reading.......................... 45
2.10 Exercises.............................. 45
References................................. 47
3 Propositional Logic: Deductive Systems ................ 49
3.1 Why Deductive Proofs?...................... 49
3.2 Gentzen System G......................... 51
3.3 Hilbert System H......................... 55
3.4 Derived Rules in H........................ 58
3.5 Theorems for Other Operators................... 62
3.6 Soundness and Completeness of H................ 64
3.7 Consistency ............................ 66
3.8 Strong Completeness and Compactness *............. 67
3.9 Variant Forms of the Deductive Systems * ............ 68
3.10 Summary.............................. 71
3.11 Further Reading.......................... 71
3.12 Exercises.............................. 72
References................................. 73
4 Propositional Logic: Resolution..................... 75
4.1 Conjunctive Normal Form..................... 75
4.2 Clausal Form............................ 77
4.3 Resolution Rule.......................... 80
4.4 Soundness and Completeness of Resolution * .......... 82
4.5 Hard Examples for Resolution *.................. 88
4.6 Summary.............................. 92
4.7 Further Reading.......................... 92
4.8 Exercises.............................. 92
References................................. 93
5 Propositional Logic: Binary Decision Diagrams............ 95
5.1 Motivation Through Truth Tables................. 95
5.2 Definition of Binary Decision Diagrams ............. 97
5.3 Reduced Binary Decision Diagrams................ 98
5.4 Ordered Binary Decision Diagrams................ 102
5.5 Applying Operators to BDDs................... 104
5.6 Restriction and Quantification *.................. 107
5.7 Summary.............................. 109
5.8 Further Reading.......................... 110
5.9 Exercises.............................. 110
References................................. 110
6 Propositional Logic: SAT Solvers.................... 111
6.1 Properties of Clausal Form .................... 111
6.2 Davis-Putnam Algorithm ..................... 115
6.3 DPLL Algorithm.......................... 116
6.4 An Extended Example of the DPLL Algorithm.......... 117
6.5 Improving the DPLL Algorithm.................. 122
6.6 Stochastic Algorithms....................... 125
6.7 Complexity of SAT * ....................... 126
6.8 Summary.............................. 128
6.9 Further Reading.......................... 128
6.10 Exercises.............................. 128
References................................. 129
7 First-Order Logic: Formulas, Models, Tableaux............ 131
7.1 Relations and Predicates...................... 131
7.2 Formulas in First-Order Logic................... 133
7.3 Interpretations........................... 136
7.4 Logical Equivalence........................ 140
7.5 Semantic Tableaux......................... 143
7.6 Soundness and Completion of Semantic Tableaux........ 150
7.7 Summary.............................. 153
7.8 Further Reading.......................... 153
7.9 Exercises.............................. 153
References................................. 154
8 First-Order Logic: Deductive Systems................. 155
8.1 Gentzen System G......................... 155
8.2 Hilbert System Jf......................... 158
8.3 Equivalence of H and G..................... 160
8.4 Proofs of Theorems in H..................... 161
8.5 TheC-Rule *............................ 163
8.6 Summary.............................. 165
8.7 Further Reading.......................... 165
8.8 Exercises.............................. 165
References................................. 166
9 First-Order Logic: Terms and Normal Forms............. 167
9.1 First-Order Logic with Functions................. 167
9.2 PCNF and Clausal Form...................... 172
9.3 Herbrand Models ......................... 177
9.4 Herbrand s Theorem *....................... 180
9.5 Summary.............................. 182
9.6 Further Reading.......................... 182
9.7 Exercises.............................. 182
References................................. 183
10 First-Order Logic: Resolution...................... 185
10.1 Ground Resolution......................... 185
10.2 Substitution ............................ 187
10.3 Unification............................. 189
10.4 General Resolution......................... 195
10.5 Soundness and Completeness of General Resolution *...... 198
10.6 Summary.............................. 202
10.7 Further Reading.......................... 202
10.8 Exercises.............................. 202
References................................. 203
11 First-Order Logic: Logic Programming................ 205
11.1 From Formulas in Logic to Logic Programming......... 205
11.2 Horn Clauses and SLD-Resolution ................ 209
11.3 Search Rules in SLD-Resolution ................. 213
11.4 Prolog............................... 216
11.5 Summary.............................. 220
11.6 Further Reading..........................221
11.7 Exercises..............................221
References.................................222
12 First-Order Logic: Undecidability and Model Theory * .......223
12.1 Undecidability of First-Order Logic................ 223
12.2 Decidable Cases of First-Order Logic............... 226
12.3 Finite and Infinite Models..................... 227
12.4 Complete and Incomplete Theories................ 228
12.5 Summary.............................. 229
12.6 Further Reading.......................... 229
12.7 Exercises.............................. 230
References................................. 230
13 Temporal Logic: Formulas, Models, Tableaux.............231
13.1 Introduction............................ 231
13.2 Syntax and Semantics....................... 233
13.3 Models of Time.......................... 237
13.4 Linear Temporal Logic ...................... 240
13.5 Semantic Tableaux......................... 244
13.6 Binary Temporal Operators *................... 258
13.7 Summary.............................. 260
13.8 Further Reading.......................... 261
13.9 Exercises.............................. 261
References................................. 262
14 Temporal Logic: A Deductive System..................263
14.1 Deductive System L .......................263
14.2 Theorems of L..........................264
14.3 Soundness and Completeness of L *...............269
14.4 Axioms for the Binary Temporal Operators *...........271
14.5 Summary..............................271
14.6 Further Reading..........................272
14.7 Exercises..............................272
References.................................272
15 Verification of Sequential Programs...................273
15.1 Correctness Formulas....................... 274
15.2 Deductive System H L...................... 275
15.3 Program Verification........................ 277
15.4 Program Synthesis......................... 279
15.5 Formal Semantics of Programs *................. 283
15.6 Soundness and Completeness of H L *............. 289
15.7 Summary.............................. 293
15.8 Further Reading.......................... 293
15.9 Exercises.............................. 293
References............... ... 295
16 Verification of Concurrent Programs.................. 297
16.1 Definition of Concurrent Programs................ 298
16.2 Formalization of Correctness ................... 300
16.3 Deductive Verification of Concurrent Programs.......... 303
16.4 Programs as Automata....................... 307
16.5 Model Checking of Invariance Properties............. 311
16.6 Model Checking of Liveness Properties.............. 314
16.7 Expressing an LTL Formula as an Automaton .......... 315
16.8 Model Checking Using the Synchronous Automaton....... 317
16.9 Branching-Time Temporal Logic *................ 319
16.10 Symbolic Model Checking * ................... 322
16.11 Summary.............................. 323
16.12 Further Reading.......................... 324
16.13 Exercises.............................. 324
References................................. 325
Appendix Set Theory............................ 327
A.l Finite and Infinite Sets....................... 327
A.2 Set Operators............................ 328
A.3 Sequences............................. 330
A.4 Relations and Functions...................... 331
A.5 Cardinality............................. 333
A.6 Proving Properties of Sets..................... 335
References................................. 336
Index of Symbols................................ 337
Name Index................................... 339
Subject Index.................................. 341
|
| any_adam_object | 1 |
| author | Ben-Arî, Môtî 1948- |
| author_GND | (DE-588)121144844 |
| author_facet | Ben-Arî, Môtî 1948- |
| author_role | aut |
| author_sort | Ben-Arî, Môtî 1948- |
| author_variant | m b a mba |
| building | Verbundindex |
| bvnumber | BV040338661 |
| classification_tum | DAT 540f MAT 030f |
| ctrlnum | (OCoLC)802788985 (DE-599)HBZHT017222897 |
| discipline | Informatik Mathematik |
| edition | Third edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02079nam a2200529 c 4500</leader><controlfield tag="001">BV040338661</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20201205 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120727s2012 |||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447141280</subfield><subfield code="c">pbk</subfield><subfield code="9">978-1-4471-4128-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)802788985</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HBZHT017222897</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><subfield code="a">DE-573</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">03-01</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68T27</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 540f</subfield><subfield code="2">stub</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">03B70</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68N17</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ben-Arî, Môtî</subfield><subfield code="d">1948-</subfield><subfield code="0">(DE-588)121144844</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematical logic for computer science</subfield><subfield code="c">Mordechai Ben-Ari</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Third edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London ; Heidelberg ; New York ; Dordrecht</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xv, 346 Seiten</subfield><subfield code="b">Diagramme</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="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">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logik</subfield><subfield code="0">(DE-588)4036202-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="689" ind1="1" ind2="0"><subfield code="a">Logik</subfield><subfield code="0">(DE-588)4036202-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</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="689" ind1="2" ind2="0"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-4471-4129-7</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=025192957&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025192957</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="883" ind1="1" ind2=" "><subfield code="8">2\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></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV040338661 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:21:57Z |
| institution | BVB |
| isbn | 9781447141280 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025192957 |
| oclc_num | 802788985 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-573 DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-573 DE-83 |
| physical | xv, 346 Seiten Diagramme |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| spelling | Ben-Arî, Môtî 1948- (DE-588)121144844 aut Mathematical logic for computer science Mordechai Ben-Ari Third edition London ; Heidelberg ; New York ; Dordrecht Springer 2012 xv, 346 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Logische Programmierung (DE-588)4195096-3 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Logik (DE-588)4036202-4 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content Mathematische Logik (DE-588)4037951-6 s DE-604 Logik (DE-588)4036202-4 s Informatik (DE-588)4026894-9 s 1\p DE-604 Logische Programmierung (DE-588)4195096-3 s 2\p DE-604 Erscheint auch als Online-Ausgabe 978-1-4471-4129-7 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025192957&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Ben-Arî, Môtî 1948- Mathematical logic for computer science Mathematische Logik (DE-588)4037951-6 gnd Logische Programmierung (DE-588)4195096-3 gnd Informatik (DE-588)4026894-9 gnd Logik (DE-588)4036202-4 gnd |
| subject_GND | (DE-588)4037951-6 (DE-588)4195096-3 (DE-588)4026894-9 (DE-588)4036202-4 (DE-588)4123623-3 |
| title | Mathematical logic for computer science |
| title_auth | Mathematical logic for computer science |
| title_exact_search | Mathematical logic for computer science |
| title_full | Mathematical logic for computer science Mordechai Ben-Ari |
| title_fullStr | Mathematical logic for computer science Mordechai Ben-Ari |
| title_full_unstemmed | Mathematical logic for computer science Mordechai Ben-Ari |
| title_short | Mathematical logic for computer science |
| title_sort | mathematical logic for computer science |
| topic | Mathematische Logik (DE-588)4037951-6 gnd Logische Programmierung (DE-588)4195096-3 gnd Informatik (DE-588)4026894-9 gnd Logik (DE-588)4036202-4 gnd |
| topic_facet | Mathematische Logik Logische Programmierung Informatik Logik Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025192957&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT benarimoti mathematicallogicforcomputerscience |