
Definability and Computability
Yuri L. Ershov(Author)
Plenum Publishing Co.,N.Y.
Published on 30. April 1996
Book
Hardback
XIV, 264 pages
978-0-306-11039-9 (ISBN)
Description
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.
More details
Series
Edition
1996 ed.
Language
English
Place of publication
New York
United States
Publishing group
Springer Science+Business Media
Target group
Professional and scholarly
Research
Illustrations
XIV, 264 p.
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 20 mm
Weight
594 gr
ISBN-13
978-0-306-11039-9 (9780306110399)
Schweitzer Classification
Content
Sigmadefinability and the Godel Incompleteness Theorem. Computability on Admissible Sets. Selected Topics. Appendix. Index.