Computability Computable Functions, Logic, and the Foundations of Mathematics, with Computability: A Timeline
Edition: 2nd 2000
List price: $37.95
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
Description: This intuitive introduction to computability theory contains numerous background discussions which introduce the reader to the folkloric and philosophical aspects of recursion theory and logic.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $37.95
Copyright year: 2000
Publication date: 7/12/1999
Size: 7.00" wide x 9.25" long x 0.50" tall
Preface. Acknowledgements. I. THE FUNDAMENTALS. 1. Paradoxes. 2. What do the Paradoxes Mean? 3. Whole Numbers. 4. Functions. 5. Proofs. 6. Infinite Collections? 7. Hilber "On the Infinite." II. COMPUTABLE FUNCTIONS. 8. Computability. 9. Turing Machines. 10. The Most Amazing Fact and Church's Thesis. 11. Primitive Recursive Functions. 12. The Grzegorczyk Hierarchy. 13. Multiple Recursion. 14. The Least Search Operator. 15. Partial Recursive Functions. 16. Numbering and Partial Recursive Functions. 17. Listability. 18. Turing Machines Computable = Partial Recursive. III. LOGIC AND ARITHMETIC. 19. Propositional Logic. 20. An Overview of First-Order Logic and Gdel's Theorems. 21. First-Order Arithmetic. 22. Functions Representable in Formal Arithmetic. 23. The Undecidability of Arithmetic. 24. The Unprovability of Consistency. IV. CHURCH'S THESIS AND CONSTRUCTIVE MATHEMATICS. 25. Church's Thesis. 26. Constructivist Views of Mathematics. Bibliography. GLOSSARY AND INDEX OF NOTATION. INDEX.