Kids Library Home

Welcome to the Kids' Library!

Search for books, movies, music, magazines, and more.

     
Available items only
E-Book/E-Doc
Author Ash, C. J.

Title Computable structures and the hyperarithmetical hierarchy / C.J. Ash, J. Knight.

Imprint Amsterdam ; New York : Elsevier, 2000.

Copies

Location Call No. OPAC Message Status
 Axe Elsevier ScienceDirect Ebook  Electronic Book    ---  Available
Edition 1st ed.
Description 1 online resource (xv, 346 pages)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Series Studies in logic and the foundations of mathematics ; v. 144
Studies in logic and the foundations of mathematics ; v. 144.
Summary 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).
Contents 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. <IT>n</IT>-systems. A-systems. Back-and forth relations. Theorems of Barker and Davey. Pairs of computable structures. Models of arithmetic. Special classes of structures.
Bibliography Includes bibliographical references (pages 323-333) and index.
Note Print version record.
Subject Computable functions.
Fonctions calculables.
MATHEMATICS -- Infinity.
MATHEMATICS -- Logic.
Computable functions
Wiskundige logica.
Fonctions calculables.
Récursivité, Théorie de la.
Added Author Knight, J. (Julia)
Other Form: Print version: Ash, C.J. Computable structures and the hyperarithmetical hierarchy. 1st ed. Amsterdam ; New York : Elsevier, 2000 0444500723 9780444500724 (DLC) 00034103 (OCoLC)44046875
ISBN 9780444500724
0444500723
9780080529523 (electronic bk.)
0080529526 (electronic bk.)
Standard No. AU@ 000048130997
CHNEW 001005950
DEBBG BV036962274
DEBBG BV039830142
DEBBG BV042317288
DEBSZ 276857690
DEBSZ 482353589
NZ1 12433121
NZ1 15192848
AU@ 000075308723

 
    
Available items only