• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computable Structures and the Hyperarithmetical Hierarchy: Volume 144

Computable Structures and the Hyperarithmetical Hierarchy: Volume 144

Hardcover

Series: Studies in Logic and the Foundations of Mathematics, Book 144

FictionGeneral Mathematics

ISBN10: 0444500723
ISBN13: 9780444500724
Publisher: Elsevier Science
Published: Jun 16 2000
Pages: 366
Weight: 1.52
Height: 0.77 Width: 6.42 Depth: 9.16
Language: 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).

Also in

Fiction