Computable structures and the hyperarithmetical hierarchy [E-Book] / C.J. Ash, J. Knight
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 alge...
Saved in:
Full text |
|
Personal Name(s): | Ash, Chris J., author |
Knight, Julia F., author | |
Edition: |
1st ed. |
Imprint: |
Amsterdam ; New York :
Elsevier,
2000
|
Physical Description: |
1 online resource (xv, 346 p.) |
Note: |
englisch |
ISBN: |
9780444500724 0080529526 9780080529523 0444500723 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Studies in logic and the foundations of mathematics ;
v. 144 |
Subject (LOC): |
LEADER | 01746cam a2200313Ia 4500 | ||
---|---|---|---|
001 | ocn162131184 | ||
003 | OCLC WorldCat | ||
008 | 070802s2000 ne ob 001 0 eng d | ||
020 | |a 9780444500724 | ||
020 | |a 0444500723 | ||
020 | |a 9780080529523 | ||
020 | |a 0080529526 | ||
035 | |a (Sirsi) a321909 | ||
041 | |a eng | ||
082 | 0 | 4 | |a 511.3 |2 22 |
100 | |a Ash, Chris J., |e Verfasser | ||
245 | 1 | 0 | |a Computable structures and the hyperarithmetical hierarchy |h [E-Book] / |c C.J. Ash, J. Knight |
250 | |a 1st ed. | ||
260 | |a Amsterdam ; |a New York : |b Elsevier, |c 2000 |e (ScienceDirect) | ||
300 | |a 1 online resource (xv, 346 p.) | ||
490 | |a Studies in logic and the foundations of mathematics ; |v v. 144 | ||
500 | |a englisch | ||
520 | |a 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). | ||
650 | 0 | |a Computable functions. | |
700 | |a Knight, Julia F., |e Verfasser | ||
856 | 4 | 0 | |3 ScienceDirect |u http://www.sciencedirect.com/science/book/9780444500724 |z Volltext |
915 | |a zzwFZJ3 | ||
596 | |a 1 | ||
949 | |a XX(321909.1) |w AUTO |c 1 |i 321909-1001 |l ELECTRONIC |m ZB |r N |s Y |t E-BOOK |u 17/1/2013 |x UNKNOWN |z UNKNOWN |1 ONLINE |