|
![]() |
|||
|
||||
OverviewIn 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. Full Product DetailsAuthor: Yuri L. ErshovPublisher: Springer Science+Business Media Imprint: Kluwer Academic/Plenum Publishers Edition: 1996 ed. Dimensions: Width: 15.60cm , Height: 1.90cm , Length: 23.40cm Weight: 1.270kg ISBN: 9780306110399ISBN 10: 0306110393 Pages: 264 Publication Date: 30 April 1996 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsSigmadefinability and the Goedel Incompleteness Theorem. Computability on Admissible Sets. Selected Topics. Appendix. Index.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |