Computable Structures and the Hyperarithmetical Hierarchy (Hardcover)

Author: Ash, C. J.

Customer Reviews   Write a Review

Be the first to review this item and earn 25 Rakuten Super Points™

Product Overview

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

Specifications

Publisher Elsevier Science Serials
Mfg Part# 9780444500724
SKU 202212434
Format Hardcover
ISBN10 0444500723
Release Date 4/10/2007
Product Attributes
eBooks Kobo
loading
Sold Out
Sorry, you missed the deal!
This product is currently not available.
ADVERTISEMENT
Promotions & Offers (1)
  •  custom promo
    5% Back* Sitewide with Promo Code Rewardme *See page for details
Buy From Other Sellers (0)
kobo
  • Take your library with you wherever you go
  • Use the device you want to use… smartphone, desktop and many of today’s most popular eReaders

WHY KOBO?

We love the Kobo eReading service… and we know you will too. We’ve partnered with them to bring you the most flexible, enjoyable eReading experience in the U.S.

SHOPPING ON KOBO

You’ll be asked to sign in or create a new account with Kobo. Once you do, you’ll immediately get access to millions of titles and be ready to start eReading. Anytime. Anyplace.

continue to kobo
ADVERTISEMENT
ADVERTISEMENT