Definability and Computability
| AUTHOR | Ershov, Yuri L. |
| PUBLISHER | Springer (04/30/1996) |
| PRODUCT TYPE | Hardcover (Hardcover) |
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.
Show More
Product Format
Product Details
ISBN-13:
9780306110399
ISBN-10:
0306110393
Binding:
Hardback or Cased Book (Sewn)
Content Language:
English
More Product Details
Page Count:
264
Carton Quantity:
28
Product Dimensions:
6.92 x 0.86 x 9.10 inches
Weight:
1.19 pound(s)
Feature Codes:
Bibliography,
Index,
Illustrated
Country of Origin:
US
Subject Information
BISAC Categories
Mathematics | Logic
Dewey Decimal:
511.3
Library of Congress Control Number:
96017132
Descriptions, Reviews, Etc.
publisher marketing
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.
Show More
List Price $239.00
Your Price
$236.61