Computability and Logic

by
Edition: 4th
Format: Hardcover
Pub. Date: 2002-03-25
Publisher(s): Cambridge University Press
List Price: $99.99

Rent Textbook

Select for Price
There was a problem. Please try again later.

New Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

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.

Table of Contents

Preface x
COMPUTABILITY THEORY
Enumerability
3(13)
Enumerability
3(4)
Enumerable Sets
7(9)
Diagonalization
16(7)
Turing Computability
23(12)
Uncomputability
35(10)
The Halting Problem
35(5)
The Productivity Function
40(5)
Abacus Computability
45(18)
Abacus Machines
45(6)
Simulating Abacus Machines by Turing Machines
51(6)
The Scope of Abacus Computability
57(6)
Recursive Functions
63(10)
Primitive Recursive Functions
63(7)
Minimization
70(3)
Recursive Sets and Relations
73(15)
Recursive Relations
73(7)
Semirecursive Relations
80(3)
Further Examples
83(5)
Equivalent Definitions of Computability
88(13)
Coding Turing Computations
88(6)
Universal Turing Machines
94(2)
Recursively Enumerable Sets
96(5)
BASIC METALOGIC
A Precis of First-Order Logic: Syntax
101(13)
First-Order Logic
101(5)
Syntax
106(8)
A Precis of First-Order Logic: Semantics
114(12)
Semantics
114(5)
Metalogical Notions
119(7)
The Undecidability of First-Order Logic
126(11)
Logic and Turing Machines
126(6)
Logic and Primitive Recursive Functions
132(5)
Models
137(16)
The Size and Number of Models
137(5)
Equivalence Relations
142(4)
The Lowenheim-Skolem and Compactness Theorems
146(7)
The Existence of Models
153(13)
Outline of the Proof
153(3)
The First Stage of the Proof
156(1)
The Second Stage of the Proof
157(3)
The Third Stage of the Proof
160(2)
Nonenumerable Languages
162(4)
Proofs and Completeness
166(21)
Sequent Calculus
166(8)
Soundness and Completeness
174(5)
Other Proof Procedures and Hilbert's Thesis
179(8)
Arithmetization
187(12)
Arithmetization of Syntax
187(5)
Godel Numbers
192(4)
More Godel Numbers
196(3)
Representability of Recursive Functions
199(22)
Arithmetical Definability
199(8)
Minimal Arithmetic and Representability
207(5)
Mathematical Induction
212(3)
Robinson Arithmetic
215(6)
Indefinability, Undecidability, Incompleteness
221(12)
The Diagonal Lemma and the Limitative Theorems
221(4)
Undecidable Sentences
225(2)
Undecidable Sentences without the Diagonal Lemma
227(6)
The Unprovability of Consistency
233(10)
FURTHER TOPICS
Normal Forms
243(17)
Disjunctive and Prenex Normal Forms
243(4)
Skolem Normal Form
247(6)
Herbrand's Theorem
253(2)
Eliminating Function Symbols and Identity
255(5)
The Craig Interpolation Theorem
260(10)
Craig's Theorem and Its Proof
260(4)
Robinson's Joint Consistency Theorem
264(1)
Beth's Definability Theorem
265(5)
Monadic and Dyadic Logic
270(9)
Solvable and Unsolvable Decision Problems
270(3)
Monadic Logic
273(2)
Dyadic Logic
275(4)
Second-Order Logic
279(7)
Arithmetical Definability and Truth
286(16)
Arithmetical Definability and Forcing
289(6)
Decidability of Arithmetic without Multiplication
295(7)
Nonstandard Models
302(17)
Order in Nonstandard Models
302(4)
Operations in Nonstandard Models
306(6)
Nonstandard Models of Analysis
312(7)
Ramsey's Theorem
319(8)
Ramsey's Theorem: Finitary and Infinitary
319(3)
Konig's Lemma
322(5)
Modal Logic and Provability
327(14)
Modal Logic
327(7)
The Logic of Provability
334(3)
The Fixed Point and Normal Form Theorems
337(4)
Hints for Selected Problems 341(7)
Annotated Bibliography 348(1)
Index 349

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.