Contents
Chapter 1. Introduction 1
§1.1. Approach 1
§1.2. Some History 4
§1.3. Notes on Use of the Text 6
§1.4. Acknowledgements and References 7
Chapter 2. Background 9
§2.1. First-Order Logic 9
§2.2. Sets 15
§2.3. Relations 21
§2.4. Bijection and Isomorphism 29
§2.5. Recursion and Induction 30
§2.6. Some Notes on Proofs and Abstraction 37
Chapter 3. Defining Computability 41
§3.1. Functions, Sets, and Sequences 41
§3.2. Turing Machines 43
§3.3. Partial Recursive Functions 50
§3.4. Coding and Countability 56
§3.5. A Universal Turing Machine 62
v
Previous Page Next Page