Non ti piace? Non importa! Puoi restituire gli articoli fino a 30 giorni
Non puoi sbagliarti con un buono regalo. Con il buono regalo, il destinatario può scegliere qualsiasi prodotto della nostra offerta.
Fino a 30 giorni per il reso
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).
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?