ISBN details
- ISBN 10: 0306110393
- ISBN 13: 9780306110399
Overview
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.Other Details
- Publisher: Consultants Bureau
- Language: eng English
- Format: print
- Edition: 1996
- Dimensions: xiv, 264 p. : ill. ; 24 cm.
- Date Published: 1996
- Authors: Ershov, I︠u︡. L. (i︠u︡riĭ Leonidovich)