| Definability and Computability 1996 Edition Contributor(s): Ershov, Yuri L. (Author) |
|
 |
ISBN: 0306110393 ISBN-13: 9780306110399 Publisher: Springer OUR PRICE: $208.99 Product Type: Hardcover Published: April 1996 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Logic |
| Dewey: 511.3 |
| LCCN: 96017132 |
| Series: Siberian School of Algebra and Logic |
| Physical Information: 0.86" H x 6.92" W x 9.1" (1.19 lbs) 264 pages |
| Descriptions, Reviews, Etc. |
| Publisher 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. |
