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.
Lieferbar
ISBN | 9780306110399 |
---|---|
Sprache | eng |
Cover | Fester Einband |
Verlag | Springer Us |
Jahr | 19960430 |
Dieser Artikel hat noch keine Bewertungen.