Definability and Computability (Siberian School of Algebra and Logic) - Hardcover
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.
"synopsis" may belong to another edition of this title.
Language Notes:
Text: English (translation)
Original Language: Russian
Original Language: Russian
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date1996
- ISBN 10 0306110393
- ISBN 13 9780306110399
- BindingHardcover
- Number of pages278
Buy New
Learn more about this copy
US$ 213.49
Shipping:
FREE
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Seller Image
Definability and Computability (Siberian School of Algebra and Logic) by Ershov, Yuri L. [Hardcover ]
Seller:
Rating
Book Description Hardcover. Condition: new. Seller Inventory # 9780306110399
Buy New
US$ 213.49
Convert currency
Seller Image
Definability and Computability
Seller:
Rating
Book Description Condition: New. Seller Inventory # 658318-n
Buy New
US$ 231.32
Convert currency
Stock Image
Definability and Computability (Siberian School of Algebra and Logic)
Published by
Springer
(1996)
ISBN 10: 0306110393
ISBN 13: 9780306110399
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Seller Inventory # ABLIING23Feb2215580098038
Buy New
US$ 229.98
Convert currency
Seller Image
Definability and Computability
Published by
Springer US
(1996)
ISBN 10: 0306110393
ISBN 13: 9780306110399
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 th. Seller Inventory # 5901094
Buy New
US$ 197.40
Convert currency
Seller Image
Definability and Computability
Seller:
Rating
Book Description Condition: New. Seller Inventory # 658318-n
Buy New
US$ 232.45
Convert currency
Stock Image
Definability and Computability
Published by
Springer
(1996)
ISBN 10: 0306110393
ISBN 13: 9780306110399
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9780306110399_lsuk
Buy New
US$ 241.36
Convert currency
Seller Image
Definability and Computability
Published by
Springer US
(1996)
ISBN 10: 0306110393
ISBN 13: 9780306110399
New
Hardcover
Quantity: 1
Seller:
Rating
Book Description Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9780306110399
Buy New
US$ 244.08
Convert currency
Seller Image
Definability and Computability
Published by
Springer US Apr 1996
(1996)
ISBN 10: 0306110393
ISBN 13: 9780306110399
New
Hardcover
Quantity: 2
Seller:
Rating
Book Description Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 284 pp. Englisch. Seller Inventory # 9780306110399
Buy New
US$ 268.62
Convert currency