Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Definability and Computability - Yuri L. Ershov

inglise keel
1996-04-30
223,60 € 372,66 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 17-23 tööpäeva jooksul

30-päevane tagastamisõigus

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, ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Yuri L. Ershov
Kirjastaja Springer US
Series Siberian School of Algebra and Logic
Väljalaskeaasta 1996
Kaanetüüp Kõvakaaneline
EAN 9780306110399
Kirjuta oma arvustus
Te vaatate: Definability and Computability
Teie hinnang:

Goodreads'i arvustused

223,60 € 372,66 €