Computable structures and the hyperarithmetical hierarchy
 |
|
Описание:
This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).Похожие книги
 | Retribution Автор: Dean Urdahl Год: 2009 |
 | Государственный Русский музей. Альманах, №59, 2003. Boris Kustodiev Автор: Владимир Круглов Год: 2003 |
 | Civil War II (Volume 1) Автор: Mr. Hunter Ayers Год: 2010 |
 | People and Tourism in Fragile Environments Автор: Martin F. Price Год: 1996 |
 | GIS and Remote Sensing Integrated Environmental Impact Assessment in Irrigation Development Автор: Ahmed Amdihun Год: 2010 |
 | Collaborative Communications Автор: Jerry D. VanVactor, DHA Год: 2010 |