Kooperativer Bibliotheksverbund

UID:

Umfang: 1 online resource (xi, 356 pages) : , digital, PDF file(s).

Ausgabe: Fourth edition.

ISBN: 9781139164931 (ebook)

Inhalt: This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.

Anmerkung: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Enumerability -- , Diagonalization -- , Turing Computability -- , Uncomputability -- , Abacus Computability -- , Recursive Functions -- , Recursive Sets and Relations -- , Equivalent Definitions of Computability -- , A Precis of First-Order Logic: Syntax -- , A Precis of First-Order Logic: Semantics -- , The Undecidability of First-Order Logic -- , Models -- , The Existence of Models -- , Proofs and Completeness -- , Arithmetization -- , Representability of Recursive Functions -- , Indefinability, Undecidability, Incompleteness -- , The Unprovability of Consistency -- , Normal Forms -- , The Craig Interpolation Theorem -- , Monadic and Dyadic Logic -- , Second-Order Logic.

Weitere Ausg.: Print version: ISBN 9780521809757

Sprache: Englisch

URL: https://doi.org/10.1017/CBO9781139164931

URL: https://doi.org/10.1017/CBO9781139164931

URL: Volltext  (lizenzpflichtig)

URL: Inhaltstext

URL: Volltext  (lizenzpflichtig)

URL: Inhaltstext

UID:

Umfang: XI, 356 S. : graph. Darst. ; 27 cm.

Ausgabe: 4. ed., 1. publ.

ISBN: 0-521-80975-4 , 0-521-00758-5

Anmerkung: Includes bibliographical references (S. 348) and index

Sprache: Englisch

Fachgebiete: Mathematik , Philosophie

Schlagwort(e): Berechenbarkeit ; Mathematische Logik

URL: http://www.loc.gov/catdir/description/cam022/2001043302.html

URL: Table of contents

URL: Inhaltsverzeichnis

URL: Verlagsangaben

URL: Inhaltstext

Mehr zum Autor: Jeffrey, Richard C., 1926-2002.

UID:

Umfang: XI, 356 S. : , graph. Darst.

Ausgabe: 4. ed., repr. with corr.

ISBN: 0-521-00758-5

Sprache: Englisch

Fachgebiete: Mathematik , Philosophie

Schlagwort(e): Berechenbarkeit ; Mathematische Logik

Mehr zum Autor: Jeffrey, Richard C., 1926-2002.

UID:

Umfang: 1 online resource (xi, 356 pages) : , digital, PDF file(s).

Ausgabe: 4th ed. / George S. Boolos, John P. Burgess, Richard C. Jeffrey.

ISBN: 1-107-12499-9 , 1-283-32957-3 , 1-139-13406-X , 9786613329578 , 1-139-16493-7 , 1-139-13034-X , 0-511-20229-6 , 0-511-07806-4 , 0-511-07649-5

Inhalt: This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.

Anmerkung: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Enumerability -- , Diagonalization -- , Turing Computability -- , Uncomputability -- , Abacus Computability -- , Recursive Functions -- , Recursive Sets and Relations -- , Equivalent Definitions of Computability -- , A Precis of First-Order Logic: Syntax -- , A Precis of First-Order Logic: Semantics -- , The Undecidability of First-Order Logic -- , Models -- , The Existence of Models -- , Proofs and Completeness -- , Arithmetization -- , Representability of Recursive Functions -- , Indefinability, Undecidability, Incompleteness -- , The Unprovability of Consistency -- , Normal Forms -- , The Craig Interpolation Theorem -- , Monadic and Dyadic Logic -- , Second-Order Logic. , English

Weitere Ausg.: ISBN 0-521-00758-5

Weitere Ausg.: ISBN 0-521-80975-4

Sprache: Englisch