Definability and Computability

Hardcover | April 30, 1996

byYuri L. Ershov, Yuri L. Ershov

not yet rated|write a review
In this book, Yurii L. Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. He presents a new approach to providing the Gödel incompleteness theorem based on systematic use of the formulas with the restricted quantifiers. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory's development. Other topics discussed are forcing, Sigma-definability, dynamic logic, and Sigma-predicates of finite types.

Pricing and Purchase Info

$388.95

In stock online
Ships free on orders over $25

From the Publisher

In this book, Yurii L. Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. He presents a new approach to providing the Gödel incompleteness theorem based on systematic use of the formulas with the restricted quantifiers. The volume also includes a novel ex...

Format:HardcoverDimensions:278 pages, 9.25 × 6.1 × 0 inPublished:April 30, 1996Publisher:Springer

The following ISBNs are associated with this title:

ISBN - 10:0306110393

ISBN - 13:9780306110399

Customer Reviews of Definability and Computability

Reviews

Extra Content

Table of Contents

Sigmadefinability and the Gödel Incompleteness Theorem. Computability on Admissible Sets. Selected Topics. Appendix. Index.