»
Computable Structures and the Hyperarithmetical Hierarchy
 
 

Computable Structures and the Hyperarithmetical Hierarchy, 1st Edition

 
Computable Structures and the Hyperarithmetical Hierarchy, 1st Edition,C.J. Ash,J. Knight,ISBN9780444500724
 
 
 

  &      

Elsevier Science

9780444500724

9780080529523

366

Print Book + eBook

USD 186.00
USD 310.00

Buy both together and save 40%

Print Book

Hardcover

In Stock

Estimated Delivery Time
USD 140.00

eBook
eBook Overview

VST format:

DRM Free included formats: EPub, Mobi, PDF

USD 170.00
Add to Cart
 
 

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

C.J. Ash

J. Knight

Affiliations and Expertise

University of Notre Dame, Department of Mathematics, Notre Dame, IN, USA

Computable Structures and the Hyperarithmetical Hierarchy, 1st Edition

Preface. Computability. The arithmetical hierarchy. Languages and structures. Ordinals. The hyperarithmetical hierarchy. Infinitary formulas. Computable infinitary formulas. The Barwise-Kreisel Compactness Theorem. Existence of computable structures. Completeness and forcing. The Ash-Nerode Theorem. Computable categoricity and stability. n-systems. &agr;-systems. Back-and forth relations. Theorems of Barker and Davey. Pairs of computable structures. Models of arithmetic. Special classes of structures.
 
 

Shop with Confidence

Free Shipping around the world
▪ Broad range of products
▪ 30 days return policy
FAQ

Contact Us