• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Definability and Computability

Definability and Computability

Hardcover

Series: Siberian School of Algebra and Logic

Fiction

ISBN10: 0306110393
ISBN13: 9780306110399
Publisher: Springer Nature
Published: Apr 30 1996
Pages: 264
Weight: 1.19
Height: 0.86 Width: 6.92 Depth: 9.10
Language: English
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.

Also in

Fiction