Overview

Mathematical Logic / Edition 2

This classic introduction to the main areas of mathematical logic provides the
basis for a first graduate course in the subject. It embodies the viewpoint that
mathematical logic is not a collection of vaguely related results, but a coherent
method of attacking some of the most interesting problems, which face the
mathematician. The author presents the basic concepts in an unusually clear and
accessible fashion, concentrating on what he views as the central topics of
mathematical logic: proof theory, model theory, recursion theory, axiomatic number
theory, and set theory. There are many exercises, and they provide the outline of
what amounts to a second book that goes into all topics in more depth. This book
has played a role in the education of many mature and accomplished researchers.

Show More
Product Details

ISBN-13: 9781568811352
Publisher: Taylor & Francis
Publication date: 02/09/2001
Edition description: New Edition
Pages: 356
Product dimensions: 6.60(w) x 9.26(h) x 0.74(d)
Table of Contents
Chapter 1 The Nature of Mathematical Logic
1.1 Axiom systems 1
1.2 Formal systems 2
1.3 Syntactical variables 6
Chapter 2 First-Order Theories
2.1 Functions and predicates 9
2.2 Truth functions 10
2.3 Variables and quantifiers 12
2.4 First-order languages 14
2.5 Structures 18
2.6 Logical axioms and rules 20
Problems 23
Chapter 3 Theorems in First-Order Theories
3.1 The tautology theorem 26
3.2 Results on quantifiers 31
3.3 The deduction theorem 33
3.4 The equivalence and equality theorems 34
3.5 Prenex form 36
Problems 39
Chapter 4 The Characterization Problem
4.1 The reduction theorem 41
4.2 The completeness theorem 43
4.3 The consistency theorem 48
4.4 Herbrand's theorem 52
4.5 Addition of function symbols 55
4.6 Extensions by definitions 57
4.7 Interpretations 61
Problems 65
Chapter 5 The Theory of Models
5.1 The compactness theorem 69
5.2 Isomorphisms and substructures 71
5.3 Cardinality of models 78
5.4 Joint consistency 79
5.5 Complete theories 82
5.6 Categoricity 88
Problems 92
Chapter 6 Incompleteness and Undecidability
6.1 Calculability 106
6.2 Recursive functions 108
6.3 Explicit definitions 110
6.4 Sequence numbers 115
6.5 Church's thesis 119
6.6 Expression numbers 122
6.7 Representability 126
6.8 Church's theorem and the incompleteness theorem 131
6.9 Undecidability 133
Problems 137
Chapter 7 Recursion Theory
7.1 Partial functions 144
7.2 Functionals and relations 147
7.3 Properties of recursive functionals 150
7.4 Indices 156
7.5 The arithmetical hierarchy 160
7.6 Relative recursiveness 164
7.7 Degrees 169
7.8 The analytical hierarchy 173
7.9 Hyperarithmetical relations 175
7.10 The characterization theorem 179
7.11 Basis theorems 185
Problems 190
Chapter 8 The Natural Numbers
8.1 Peano arithmetic 204
8.2 The theorem on consistency proofs 209
8.3 The consistency proof 214
8.4 Applications of the consistency proof 223
8.5 Second-order arithmetic 227
Problems 233
Chapter 9 Set Theory
9.1 Axioms for sets 238
9.2 Development of set theory 240
9.3 Ordinals 246
9.4 Cardinals 252
9.5 Interpretations of set theory 260
9.6 Constructible sets 270
9.7 The axiom of constructibility 277
9.8 Forcing 282
9.9 The independence proofs 293
9.10 Large cardinals 303
Problems 315
Appendix The Word Problem 321
Index 337