Preface |
Informal statement calculus / 1: |
Statements and connectives / 1.1: |
Truth functions and truth tables / 1.2: |
Rules for manipulation and substitution / 1.3: |
Normal forms / 1.4: |
Adequate sets of connectives / 1.5: |
Arguments and validity / 1.6: |
Formal statement calculus / 2: |
The formal system L / 2.1: |
The Adequacy Theorem for L / 2.2: |
Informal predicate calculus / 3: |
Predicates and quantifiers / 3.1: |
First order languages / 3.2: |
Interpretations / 3.3: |
Satisfaction, truth / 3.4: |
Skolemisation / 3.5: |
Formal predicate calculus / 4: |
The formal system K[subscript se] / 4.1: |
Equivalence, substitution / 4.2: |
Prenex form / 4.3: |
The Adequacy Theorem for K / 4.4: |
Models / 4.5: |
Mathematical systems / 5: |
Introduction / 5.1: |
First order systems with equality / 5.2: |
The theory of groups / 5.3: |
First order arithmetic / 5.4: |
Formal set theory / 5.5: |
Consistency and models / 5.6: |
The Godel Incompleteness Theorem / 6: |
Expressibility / 6.1: |
Recursive functions and relations / 6.3: |
Godel numbers / 6.4: |
The incompleteness proof / 6.5: |
Computability, unsolvability, undecidability / 7: |
Algorithms and computability / 7.1: |
Turing machines / 7.2: |
Word problems / 7.3: |
Undecidability of formal systems / 7.4: |
Countable and uncountable sets / Appendix: |
Hints and solutions to selected exercises |
References and further reading |
Glossary of symbols |
Index |
Preface |
Informal statement calculus / 1: |
Statements and connectives / 1.1: |