|
|
|
|
| LEADER |
02623nmm a2200421 u 4500 |
| 001 |
EB000290695 |
| 003 |
EBX01000000000000000087013 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
110501 ||| eng |
| 020 |
|
|
|a 0444500723
|
| 020 |
|
|
|a 9780080529523
|
| 020 |
|
|
|a 9780444500724
|
| 050 |
|
4 |
|a QA9.59
|
| 100 |
1 |
|
|a Ash, C. J.
|
| 245 |
0 |
0 |
|a Computable structures and the hyperarithmetical hierarchy
|c C.J. Ash, J. Knight
|
| 250 |
|
|
|a 1st ed
|
| 260 |
|
|
|a Amsterdam
|b Elsevier
|c 2000, 2000
|
| 300 |
|
|
|a xv, 346 pages
|
| 505 |
0 |
|
|a Includes bibliographical references (pages 323-333) and index
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computable functions / http://id.loc.gov/authorities/subjects/sh85029469
|
| 653 |
|
|
|a Computable functions / fast / (OCoLC)fst00871985
|
| 653 |
|
|
|a Wiskundige logica / gtt
|
| 653 |
|
|
|a MATHEMATICS / Logic / bisacsh
|
| 653 |
|
|
|a Fonctions calculables / ram
|
| 653 |
|
|
|a Récursivité, Théorie de la / ram
|
| 653 |
|
|
|a Fonctions calculables
|
| 653 |
|
|
|a MATHEMATICS / Infinity / bisacsh
|
| 700 |
1 |
|
|a Knight, J.
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b ZDB-1-ELC
|a Elsevier eBook collection Mathematics
|
| 490 |
0 |
|
|a Studies in logic and the foundations of mathematics
|
| 776 |
|
|
|z 9780080529523
|
| 776 |
|
|
|z 0080529526
|
| 856 |
4 |
0 |
|u https://www.sciencedirect.com/science/bookseries/0049237X/144
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.3
|
| 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)
|