A Problem Course In Mathematical Logics

pdf, 727 kb, 166 pages download : http://www.artikel-software.com/blog table of contents preface v introduction ix part i. propositional logic 1 chapter 1. language 3 chapter 2. truth assignments 7 chapter 3. deductions 11 chapter 4. soundness and completeness 15 hints for chapters 1{4 17 part ii. first-order logic 21 chapter 5. languages 23 chapter 6. structures and models 33 chapter 7. deductions 41 chapter 8. soundness and completeness 47 chapter 9. applications of compactness 53 hints for chapters 5{9 59 part iii. computability 65 chapter 10. turing machines 67 chapter 11. variations and simulations 75 chapter 12. computable and non-computable functions 81 chapter 13. recursive functions 87 chapter 14. characterizing computability 95 hints for chapters 10{14 101 part iv. incompleteness 109 chapter 15. preliminaries 111 chapter 16. coding first-order logic 113 chapter 17. de

ning recursive functions in arithmetic 117 chapter 18. the incompleteness theorem 123 hints for chapters 15{18 127 appendices 131 appendix a. a little set theory 133 appendix b. the greek alphabet 135 appendix c. logic limericks 137 appendix d. gnu free documentation license 139 appendix. bibliography 147 appendix. index 149