Computability and logic:
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2007
|
Ausgabe: | 5. ed. |
Schlagworte: | |
Online-Zugang: | Table of contents only Publisher description Inhaltsverzeichnis |
Beschreibung: | Hier auch später erschienene, unveränderte Nachdrucke Includes bibliographical references (p. 341) and index |
Beschreibung: | XIII, 350 S. Ill. |
ISBN: | 9780521877527 0521877520 9780521701464 0521701465 |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV023419904 | ||
003 | DE-604 | ||
005 | 20230309 | ||
007 | t | ||
008 | 080729s2007 xxka||| |||| 00||| eng d | ||
010 | |a 2007014225 | ||
020 | |a 9780521877527 |c hbk. |9 978-0-521-87752-7 | ||
020 | |a 0521877520 |c hbk. |9 0-521-87752-0 | ||
020 | |a 9780521701464 |c pbk. |9 978-0-521-70146-4 | ||
020 | |a 0521701465 |c pbk. |9 0-521-70146-5 | ||
035 | |a (OCoLC)122526900 | ||
035 | |a (DE-599)BVBBV023419904 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
044 | |a xxk |c GB | ||
049 | |a DE-703 |a DE-M347 |a DE-20 |a DE-573 |a DE-473 | ||
050 | 0 | |a QA9.59 | |
082 | 0 | |a 511.3/52 | |
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
100 | 1 | |a Boolos, George |d 1940-1996 |e Verfasser |0 (DE-588)171984196 |4 aut | |
245 | 1 | 0 | |a Computability and logic |c George S. Boolos ; John P. Burgess ; Richard C. Jeffrey |
250 | |a 5. ed. | ||
264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2007 | |
300 | |a XIII, 350 S. |b Ill. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
500 | |a Includes bibliographical references (p. 341) and index | ||
650 | 4 | |a Computable functions | |
650 | 4 | |a Recursive functions | |
650 | 4 | |a Logic, Symbolic and mathematical | |
650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
689 | 0 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Burgess, John P. |d 1948- |e Verfasser |0 (DE-588)139005250 |4 aut | |
700 | 1 | |a Jeffrey, Richard C. |d 1926-2002 |e Verfasser |0 (DE-588)119344491 |4 aut | |
856 | 4 | |u http://www.loc.gov/catdir/toc/ecip0715/2007014225.html |3 Table of contents only | |
856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0729/2007014225-d.html |3 Publisher description | |
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=016602356&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-016602356 |
Datensatz im Suchindex
_version_ | 1804137812094615552 |
---|---|
adam_text | Titel: Computability and logic
Autor: Boolos, George
Jahr: 2007
Contents
Preface to the Fifth Edition page xi
COMPUTABILITY THEORY
1 Enumerability 3
1.1 Enumerability 3
1.2 Enumerable Sets 7
2 Diagonalization 16
3 Turing Computability 23
4 Uncomputability 35
4.1 The Halting Problem 35
4.2 The Productivity Function 40
5 Abacus Computability 45
5.1 Abacus Machines 45
5.2 Simulating Abacus Machines by Turing Machines 51
5.3 The Scope of Abacus Computability 57
6 Recursive Functions 63
6.1 Primitive Recursive Functions 63
6.2 Minimization 70
7 Recursive Sets and Relations 73
7.1 Recursive Relations 73
7.2 Semirecursive Relations 80
7.3 Further Examples 83
8 Equivalent Definitions of Computability 88
8.1 Coding Turing Computations 88
8.2 Universal Turing Machines 94
8.3 Recursively Enumerable Sets 96
vj¡¡ CONTENTS
BASIC METALOGIC
9 A Précis of First-Order Logic: Syntax 101
9.1 First-Order Logic 101
9.2 Syntax 106
10 A Précis of First-Order Logic: Semantics 114
10.1 Semantics 114
1 IQ
10.2 Metalogical Notions liy
11 The Undecidability of First-Order Logic 126
11.1 Logic and Turing Machines 126
11.2 Logic and Primitive Recursive Functions 1 32
12 Models 137
12.1 The Size and Number of Models l^7
12.2 Equivalence Relations 1^2
12.3 The Löwenheim-Skolem and Compactness Theorems 146
13 The Existence of Models 153
13.1 Outline of the Proof I53
13.2 The First Stage of the Proof I56
13.3 The Second Stage of the Proof I57
13.4 The Third Stage of the Proof 160
13.5 Nonenumerable Languages 162
14 Proofs and Completeness 166
14.1 Sequent Calculus 166
14.2 Soundness and Completeness 174
14.3 Other Proof Procedures and Hubert s Thesis 179
15 Arithmetization 187
15.1 Arithmetization of Syntax 187
15.2 Gödel Numbers 192
15.3 More Gödel Numbers 196
16 Representability of Recursive Functions 199
16.1 Arithmetical Definability 199
16.2 Minimal Arithmetic and Representability 207
16.3 Mathematical Induction 212
16.4 Robinson Arithmetic 216
17 Indefinability, Undecidability, Incompleteness 220
17.1 The Diagonal Lemma and the Limitative Theorems 220
17.2 Undecidable Sentences 224
17.3 Undecidable Sentences without the Diagonal Lemma 226
18 The Unprovability of Consistency 232
CONTENTS ix
FURTHER TOPICS
19 Normal Forms 243
19.1 Disjunctive and Prenex Normal Forms 243
19.2 Skolem Normal Form 247
19.3 Herbrand s Theorem 253
19.4 Eliminating Function Symbols and Identity 255
20 The Craig Interpolation Theorem 260
20.1 Craig s Theorem and Its Proof 260
20.2 Robinson s Joint Consistency Theorem 264
20.3 Beth s Definability Theorem 265
21 Monadic and Dyadic Logic 270
21.1 Solvable and Unsolvable Decision Problems 270
21.2 Monadic Logic 273
21.3 Dyadic Logic 275
22 Second-Order Logic 279
23 Arithmetical Definability 286
23.1 Arithmetical Definability and Truth 286
23.2 Arithmetical Definability and Forcing 289
24 Decidability of Arithmetic without Multiplication 295
25 Nonstandard Models 302
25.1 Order in Nonstandard Models 302
25.2 Operations in Nonstandard Models 306
25.3 Nonstandard Models of Analysis 312
26 Ramsey s Theorem 319
26.1 Ramsey s Theorem: Finitary and Infinitary 319
26.2 Konig s Lemma 322
27 Modal Logic and Provability 327
27.1 Modal Logic 327
27.2 The Logic of Provability 334
27.3 The Fixed Point and Normal Form Theorems 337
Annotated Bibliography 341
Index 343
|
adam_txt |
Titel: Computability and logic
Autor: Boolos, George
Jahr: 2007
Contents
Preface to the Fifth Edition page xi
COMPUTABILITY THEORY
1 Enumerability 3
1.1 Enumerability 3
1.2 Enumerable Sets 7
2 Diagonalization 16
3 Turing Computability 23
4 Uncomputability 35
4.1 The Halting Problem 35
4.2 The Productivity Function 40
5 Abacus Computability 45
5.1 Abacus Machines 45
5.2 Simulating Abacus Machines by Turing Machines 51
5.3 The Scope of Abacus Computability 57
6 Recursive Functions 63
6.1 Primitive Recursive Functions 63
6.2 Minimization 70
7 Recursive Sets and Relations 73
7.1 Recursive Relations 73
7.2 Semirecursive Relations 80
7.3 Further Examples 83
8 Equivalent Definitions of Computability 88
8.1 Coding Turing Computations 88
8.2 Universal Turing Machines 94
8.3 Recursively Enumerable Sets 96
vj¡¡ CONTENTS
BASIC METALOGIC
9 A Précis of First-Order Logic: Syntax 101
9.1 First-Order Logic 101
9.2 Syntax 106
10 A Précis of First-Order Logic: Semantics 114
10.1 Semantics 114
1 IQ
10.2 Metalogical Notions liy
11 The Undecidability of First-Order Logic 126
11.1 Logic and Turing Machines 126
11.2 Logic and Primitive Recursive Functions 1 32
12 Models 137
12.1 The Size and Number of Models l^7
12.2 Equivalence Relations 1^2
12.3 The Löwenheim-Skolem and Compactness Theorems 146
13 The Existence of Models 153
13.1 Outline of the Proof I53
13.2 The First Stage of the Proof I56
13.3 The Second Stage of the Proof I57
13.4 The Third Stage of the Proof 160
13.5 Nonenumerable Languages 162
14 Proofs and Completeness 166
14.1 Sequent Calculus 166
14.2 Soundness and Completeness 174
14.3 Other Proof Procedures and Hubert's Thesis 179
15 Arithmetization 187
15.1 Arithmetization of Syntax 187
15.2 Gödel Numbers 192
15.3 More Gödel Numbers 196
16 Representability of Recursive Functions 199
16.1 Arithmetical Definability 199
16.2 Minimal Arithmetic and Representability 207
16.3 Mathematical Induction 212
16.4 Robinson Arithmetic 216
17 Indefinability, Undecidability, Incompleteness 220
17.1 The Diagonal Lemma and the Limitative Theorems 220
17.2 Undecidable Sentences 224
17.3 Undecidable Sentences without the Diagonal Lemma 226
18 The Unprovability of Consistency 232
CONTENTS ix
FURTHER TOPICS
19 Normal Forms 243
19.1 Disjunctive and Prenex Normal Forms 243
19.2 Skolem Normal Form 247
19.3 Herbrand's Theorem 253
19.4 Eliminating Function Symbols and Identity 255
20 The Craig Interpolation Theorem 260
20.1 Craig's Theorem and Its Proof 260
20.2 Robinson's Joint Consistency Theorem 264
20.3 Beth's Definability Theorem 265
21 Monadic and Dyadic Logic 270
21.1 Solvable and Unsolvable Decision Problems 270
21.2 Monadic Logic 273
21.3 Dyadic Logic 275
22 Second-Order Logic 279
23 Arithmetical Definability 286
23.1 Arithmetical Definability and Truth 286
23.2 Arithmetical Definability and Forcing 289
24 Decidability of Arithmetic without Multiplication 295
25 Nonstandard Models 302
25.1 Order in Nonstandard Models 302
25.2 Operations in Nonstandard Models 306
25.3 Nonstandard Models of Analysis 312
26 Ramsey's Theorem 319
26.1 Ramsey's Theorem: Finitary and Infinitary 319
26.2 Konig's Lemma 322
27 Modal Logic and Provability 327
27.1 Modal Logic 327
27.2 The Logic of Provability 334
27.3 The Fixed Point and Normal Form Theorems 337
Annotated Bibliography 341
Index 343 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Boolos, George 1940-1996 Burgess, John P. 1948- Jeffrey, Richard C. 1926-2002 |
author_GND | (DE-588)171984196 (DE-588)139005250 (DE-588)119344491 |
author_facet | Boolos, George 1940-1996 Burgess, John P. 1948- Jeffrey, Richard C. 1926-2002 |
author_role | aut aut aut |
author_sort | Boolos, George 1940-1996 |
author_variant | g b gb j p b jp jpb r c j rc rcj |
building | Verbundindex |
bvnumber | BV023419904 |
callnumber-first | Q - Science |
callnumber-label | QA9 |
callnumber-raw | QA9.59 |
callnumber-search | QA9.59 |
callnumber-sort | QA 19.59 |
callnumber-subject | QA - Mathematics |
classification_rvk | SK 130 |
ctrlnum | (OCoLC)122526900 (DE-599)BVBBV023419904 |
dewey-full | 511.3/52 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3/52 |
dewey-search | 511.3/52 |
dewey-sort | 3511.3 252 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
discipline_str_mv | Mathematik |
edition | 5. ed. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02270nam a2200541zc 4500</leader><controlfield tag="001">BV023419904</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230309 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080729s2007 xxka||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2007014225</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521877527</subfield><subfield code="c">hbk.</subfield><subfield code="9">978-0-521-87752-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521877520</subfield><subfield code="c">hbk.</subfield><subfield code="9">0-521-87752-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521701464</subfield><subfield code="c">pbk.</subfield><subfield code="9">978-0-521-70146-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521701465</subfield><subfield code="c">pbk.</subfield><subfield code="9">0-521-70146-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)122526900</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023419904</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.59</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/52</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="100" ind1="1" ind2=" "><subfield code="a">Boolos, George</subfield><subfield code="d">1940-1996</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)171984196</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability and logic</subfield><subfield code="c">George S. Boolos ; John P. Burgess ; Richard C. Jeffrey</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">5. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 350 S.</subfield><subfield code="b">Ill.</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="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 341) and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</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">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</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="700" ind1="1" ind2=" "><subfield code="a">Burgess, John P.</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)139005250</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jeffrey, Richard C.</subfield><subfield code="d">1926-2002</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)119344491</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/toc/ecip0715/2007014225.html</subfield><subfield code="3">Table of contents only</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0729/2007014225-d.html</subfield><subfield code="3">Publisher description</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=016602356&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-016602356</subfield></datafield></record></collection> |
id | DE-604.BV023419904 |
illustrated | Illustrated |
index_date | 2024-07-02T21:30:43Z |
indexdate | 2024-07-09T21:18:14Z |
institution | BVB |
isbn | 9780521877527 0521877520 9780521701464 0521701465 |
language | English |
lccn | 2007014225 |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016602356 |
oclc_num | 122526900 |
open_access_boolean | |
owner | DE-703 DE-M347 DE-20 DE-573 DE-473 DE-BY-UBG |
owner_facet | DE-703 DE-M347 DE-20 DE-573 DE-473 DE-BY-UBG |
physical | XIII, 350 S. Ill. |
publishDate | 2007 |
publishDateSearch | 2007 |
publishDateSort | 2007 |
publisher | Cambridge Univ. Press |
record_format | marc |
spelling | Boolos, George 1940-1996 Verfasser (DE-588)171984196 aut Computability and logic George S. Boolos ; John P. Burgess ; Richard C. Jeffrey 5. ed. Cambridge [u.a.] Cambridge Univ. Press 2007 XIII, 350 S. Ill. txt rdacontent n rdamedia nc rdacarrier Hier auch später erschienene, unveränderte Nachdrucke Includes bibliographical references (p. 341) and index Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 s Mathematische Logik (DE-588)4037951-6 s DE-604 Burgess, John P. 1948- Verfasser (DE-588)139005250 aut Jeffrey, Richard C. 1926-2002 Verfasser (DE-588)119344491 aut http://www.loc.gov/catdir/toc/ecip0715/2007014225.html Table of contents only http://www.loc.gov/catdir/enhancements/fy0729/2007014225-d.html Publisher description HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016602356&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Boolos, George 1940-1996 Burgess, John P. 1948- Jeffrey, Richard C. 1926-2002 Computability and logic Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
subject_GND | (DE-588)4037951-6 (DE-588)4138368-0 |
title | Computability and logic |
title_auth | Computability and logic |
title_exact_search | Computability and logic |
title_exact_search_txtP | Computability and logic |
title_full | Computability and logic George S. Boolos ; John P. Burgess ; Richard C. Jeffrey |
title_fullStr | Computability and logic George S. Boolos ; John P. Burgess ; Richard C. Jeffrey |
title_full_unstemmed | Computability and logic George S. Boolos ; John P. Burgess ; Richard C. Jeffrey |
title_short | Computability and logic |
title_sort | computability and logic |
topic | Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
topic_facet | Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik Berechenbarkeit |
url | http://www.loc.gov/catdir/toc/ecip0715/2007014225.html http://www.loc.gov/catdir/enhancements/fy0729/2007014225-d.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016602356&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT boolosgeorge computabilityandlogic AT burgessjohnp computabilityandlogic AT jeffreyrichardc computabilityandlogic |