- We will send in 10–14 business days.
/images/books/3468635/9780444500724.jpg)
- Author: C J Ash
- Publisher: Elsevier Science
- ISBN-10: 0444500723
- ISBN-13: 9780444500724
- Format: 16.3 x 23.3 x 2 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Computable Structures and the Hyperarithmetical Hierarchy (e-book) (used book) | bookbook.eu
Reviews
Description
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).
EXTRA 10 % discount with code: EXTRA
The promotion ends in 18d.03:31:58
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: C J Ash
- Publisher: Elsevier Science
- ISBN-10: 0444500723
- ISBN-13: 9780444500724
- Format: 16.3 x 23.3 x 2 cm, hardcover
- Language: English English
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).
Reviews