Definability and Computability

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.

Sommario

Sigmadefinability and the Gödel Incompleteness Theorem. Computability on Admissible Sets. Selected Topics. Appendix. Index.

Dettagli sul prodotto

• Autori: Yuri L Ershov, Yuri L. Ershov
• Editore: Springer, Berlin
• Lingue: Inglese
• Formato: Copertina rigida
• Pubblicazione: 26.06.2009
• EAN: 9780306110399
• ISBN: 978-0-306-11039-9
• Pagine: 264
• Peso: 576 g
• Illustrazioni: XIV, 264 p.
• Serie: Siberian School of Algebra and Logic; Siberian School of Algebra and Logic
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica > Tematiche generali, enciclopedie