Siberian School of Algebra and Logic

4.5

Reviews from our users

You Can Ask your questions from this book's AI after Login
Each download or ask from book AI costs 2 points. To earn more free points, please visit the Points Guide Page and complete some valuable actions.


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.

Free Direct Download

You Can Download this book after Login

Accessing books through legal platforms and public libraries not only supports the rights of authors and publishers but also contributes to the sustainability of reading culture. Before downloading, please take a moment to consider these options.

Find this book on other platforms:

WorldCat helps you find books in libraries worldwide.
See ratings, reviews, and discussions on Goodreads.
Find and buy rare or used books on AbeBooks.

1058

بازدید

4.5

امتیاز

0

نظر

98%

رضایت

Reviews:


4.5

Based on 0 users review

Questions & Answers

Ask questions about this book or help others by answering


Please login to ask a question

No questions yet. Be the first to ask!