Definability and computability
Author(s)
Bibliographic Information
Definability and computability
（Siberian school of algebra and logic）
Consultants Bureau, c1996
Available at / 10 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 257-260) and index
Description and Table of Contents
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 Goedel 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.
Table of Contents
Sigmadefinability and the Goedel Incompleteness Theorem. Computability on Admissible Sets. Selected Topics. Appendix. Index.
by "Nielsen BookData"