Mohlo by sa vám tiež páčiť

Viac informácií o knihe Definability and Computability

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 547 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Mathematical foundations

• Celý názov: Definability and Computability
• Autor: Yuri L. Ershov
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 264
• EAN: 9780306110399
• ISBN: 0306110393
• ID: 05246929
• Nakladateľ: Springer, Berlin
• Hmotnosť: 576 g
• Rozmery: 235 × 155 × 19 mm
• Rok vydania: 1996

Obľúbené z iného súdka

---

---

---