Computable Structures and the Hyperarithmetical Hierarchy

  1. Home
  2. Bookstore
  3. Computable Structures and the Hyperarithmetical Hierarchy

Computable Structures and the Hyperarithmetical Hierarchy

By Ash, C.J.; Knight, J.

Rent or Buy eTextbook

Expires on Apr 17th, 2022
$170

Publisher List Price: $174.99
Savings: $4.99

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).

Subject: Mathematics & Statistics -> Post-Calculus -> Logic

Computable Structures and the Hyperarithmetical Hierarchy
Publisher: Elsevier S & T 06/2000
Imprint: Elsevier Science
Language: English
Length: 366 pages

ISBN 10: 0444500723
ISBN 13: 9780444500724
Print ISBN: 9780444500724

Live Chats