Diagonalization and Self-Reference by Raymond M. Smullyan

Diagonalization and Self-Reference

byRaymond M. Smullyan

Hardcover | February 1, 1984

not yet rated|write a review

Pricing and Purchase Info

$326.45 online 
$427.50
Earn 1632 plum® points

Ships within 1-3 weeks

Ships free on orders over $25

Not available in stores

about

The main purpose of this book is to present a unified treatment of fixed points as they occur in Godel's incompleteness proofs, recursion theory, combinatory logic, semantics, and metamathematics. The book provides a survey of introductory material and a summary of recent research. The firstchapters are of an introductory nature and consist mainly of exercises with solutions given to most of them.

About The Author

Raymond M. Smullyan is at Indiana University.
The Lady or the Tiger?: and Other Logic Puzzles
The Lady or the Tiger?: and Other Logic Puzzles

by Raymond M. Smullyan

$16.40$19.50

Out of stock online

Not available in stores

Set Theory and the Continuum Problem
Set Theory and the Continuum Problem

by Raymond M. Smullyan

$20.95

In stock online

Not available in stores

This Book Needs No Title: A Budget of Living Paradoxes
This Book Needs No Title: A Budget of Living Paradoxes

by Raymond Smullyan

$15.08$16.95

In stock online

Not available in stores

Shop this author

Details & Specs

Title:Diagonalization and Self-ReferenceFormat:HardcoverDimensions:412 pages, 9.21 × 6.14 × 1.02 inPublished:February 1, 1984Publisher:Oxford University Press

The following ISBNs are associated with this title:

ISBN - 10:0198534507

ISBN - 13:9780198534501

Look for similar items by category:

Customer Reviews of Diagonalization and Self-Reference

Reviews

Extra Content

Table of Contents

I Introduction to Self-Reference and Recursion1. Introduction to self-reference2. Some classical fixed point argument compared3. How to silence a universale machine4. Some general incompleteness theorems5. Self-reference in arithmetic6. Introduction to formal systems and recursion7. A universal system and its applicationsII Systems with Effective Properties8. Arithmetization of formal systems9. Elementary formal systems and incompleteness proofs10. Doubly indexed relational systems11. Effective representation systemsIII Fixed Point Theorems in a General Setting12. Sequential systems13. Strong fixed point properties14. Multiple fixed point properties15. Synchronization and pairing functions16. Some further relations between fixed point propertiesIV Combinators and Sequential systems17. Fixed point properties of combinatory logic18. Formal combinatory logic19. A second variety of fixed point theorems20. Extended sequential systems