Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Definability and Computability - Yuri L. Ershov

angļu valoda
1996-04-30
260,86 € 372,66 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 17-23 darba dienu laikā

30 dienu atgriešanas politika

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, ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Autors Yuri L. Ershov
Izdevējs Springer US
Series Siberian School of Algebra and Logic
Izlaides gads 1996
Vāka tips Cietais vāks
EAN 9780306110399
Rakstiet savu atsauksmi
Jūs vērtējat: Definability and Computability
Jūsu novērtējums:

Goodreads atsauksmes

260,86 € 372,66 €