A Problem Course in Mathematical Logic Volume II Computability and Incompleteness

By Bilaniuk, Stefan

Book Id: WPLBN0000661973
Format Type: PDF eBook:
File Size: 0.4 MB
Reproduction Date: 2005

Title:	A Problem Course in Mathematical Logic Volume II Computability and Incompleteness
Author:	Bilaniuk, Stefan
Volume:
Language:	English
Subject:	Science., Mathematics, Logic
Collections:
Historic Publication Date:
Publisher:


Citation APA MLA Chicago Bilaniuk, B. S. (n.d.). A Problem Course in Mathematical Logic Volume II Computability and Incompleteness. Retrieved from http://gutenberg.us/

Description
Mathematics document containing theorems and formulas.

Excerpt
Excerpt: Various people and institutions deserve the credit for this text: All the people who developed the subject. My teachers and colleagues, especially Gregory H. Moore, whose mathematical logic course convinced me that I wanted to do the student. The students at Trent University who suffered, suffer, and will suffer through assorted versions of this text. Trent University and the taxpayers of Ontario, who paid my salary. Ohio University, where I spent my sabbatical in 1995{96. All the people and organizations who developed the software and hardware with which this book was prepared. Anyone else I've missed. Any blame properly accrues to the author.

Table of Contents
Contents Preface v Introduction 1 Computability 5 Chapter 10. Turing Machines 7 Chapter 11. Variations and Simulations 13 Chapter 12. Universal Turing Machines and the Halting Problem 17 Chapter 13. Computable and Non-Computable Functions 25 Chapter 14. Primitive Recursive Functions 29 Chapter 15. Recursive Functions 35 Incompleteness 41 Chapter 16. Preliminaries 43 Chapter 17. Coding First-Order Logic 45 Chapter 18. De ning Recursive Functions In Arithmetic 49 Chapter 19. The Incompleteness Theorem 53 Hints 57 Chapter 10. Hints 59 Chapter 11. Hints 61 Chapter 12. Hints 63 Chapter 13. Hints 65 Chapter 14. Hints 67 Chapter 15. Hints 69