| Management number | 231815719 | Release Date | 2026/06/18 | List Price | US$60.35 | Model Number | 231815719 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
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). Read more
| ASIN | B00ECIJMRS |
|---|---|
| XRay | Not Enabled |
| ISBN13 | 978-0080529523 |
| Edition | 1st |
| Language | English |
| File size | 12.9 MB |
| Page Flip | Enabled |
| Publisher | Elsevier Science |
| Word Wise | Not Enabled |
| Print length | 363 pages |
| Accessibility | Learn more |
| Screen Reader | Supported |
| Publication date | June 16, 2000 |
| Enhanced typesetting | Enabled |
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form