Preface |
|
x | |
COMPUTABILITY THEORY |
|
|
|
3 | (13) |
|
|
3 | (4) |
|
|
7 | (9) |
|
|
16 | (7) |
|
|
23 | (12) |
|
|
35 | (10) |
|
|
35 | (5) |
|
The Productivity Function |
|
|
40 | (5) |
|
|
45 | (18) |
|
|
45 | (6) |
|
Simulating Abacus Machines by Turing Machines |
|
|
51 | (6) |
|
The Scope of Abacus Computability |
|
|
57 | (6) |
|
|
63 | (10) |
|
Primitive Recursive Functions |
|
|
63 | (7) |
|
|
70 | (3) |
|
Recursive Sets and Relations |
|
|
73 | (15) |
|
|
73 | (7) |
|
|
80 | (3) |
|
|
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) |
|
|
101 | (5) |
|
|
106 | (8) |
|
A Precis of First-Order Logic: Semantics |
|
|
114 | (12) |
|
|
114 | (5) |
|
|
119 | (7) |
|
The Undecidability of First-Order Logic |
|
|
126 | (11) |
|
Logic and Turing Machines |
|
|
126 | (6) |
|
Logic and Primitive Recursive Functions |
|
|
132 | (5) |
|
|
137 | (16) |
|
The Size and Number of Models |
|
|
137 | (5) |
|
|
142 | (4) |
|
The Lowenheim-Skolem and Compactness Theorems |
|
|
146 | (7) |
|
|
153 | (13) |
|
|
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) |
|
|
162 | (4) |
|
|
166 | (21) |
|
|
166 | (8) |
|
Soundness and Completeness |
|
|
174 | (5) |
|
Other Proof Procedures and Hilbert's Thesis |
|
|
179 | (8) |
|
|
187 | (12) |
|
Arithmetization of Syntax |
|
|
187 | (5) |
|
|
192 | (4) |
|
|
196 | (3) |
|
Representability of Recursive Functions |
|
|
199 | (22) |
|
Arithmetical Definability |
|
|
199 | (8) |
|
Minimal Arithmetic and Representability |
|
|
207 | (5) |
|
|
212 | (3) |
|
|
215 | (6) |
|
Indefinability, Undecidability, Incompleteness |
|
|
221 | (12) |
|
The Diagonal Lemma and the Limitative Theorems |
|
|
221 | (4) |
|
|
225 | (2) |
|
Undecidable Sentences without the Diagonal Lemma |
|
|
227 | (6) |
|
The Unprovability of Consistency |
|
|
233 | (10) |
FURTHER TOPICS |
|
|
|
243 | (17) |
|
Disjunctive and Prenex Normal Forms |
|
|
243 | (4) |
|
|
247 | (6) |
|
|
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) |
|
|
270 | (9) |
|
Solvable and Unsolvable Decision Problems |
|
|
270 | (3) |
|
|
273 | (2) |
|
|
275 | (4) |
|
|
279 | (7) |
|
Arithmetical Definability and Truth |
|
|
286 | (16) |
|
Arithmetical Definability and Forcing |
|
|
289 | (6) |
|
Decidability of Arithmetic without Multiplication |
|
|
295 | (7) |
|
|
302 | (17) |
|
Order in Nonstandard Models |
|
|
302 | (4) |
|
Operations in Nonstandard Models |
|
|
306 | (6) |
|
Nonstandard Models of Analysis |
|
|
312 | (7) |
|
|
319 | (8) |
|
Ramsey's Theorem: Finitary and Infinitary |
|
|
319 | (3) |
|
|
322 | (5) |
|
Modal Logic and Provability |
|
|
327 | (14) |
|
|
327 | (7) |
|
|
334 | (3) |
|
The Fixed Point and Normal Form Theorems |
|
|
337 | (4) |
Hints for Selected Problems |
|
341 | (7) |
Annotated Bibliography |
|
348 | (1) |
Index |
|
349 | |