Cargando…
Computable structures and the hyperarithmetical hierarchy /
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York :
Elsevier,
2000.
|
| Edición: | 1st ed. |
| Colección: | Studies in logic and the foundations of mathematics ;
v. 144. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn162131184 | ||
| 003 | OCoLC | ||
| 005 | 20231117014855.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 070802s2000 ne ob 001 0 eng d | ||
| 040 | |a OPELS |b eng |e pn |c OPELS |d OCLCG |d OPELS |d OCLCQ |d N$T |d YDXCP |d MERUC |d E7B |d IDEBK |d TULIB |d OCLCO |d OCLCQ |d OPELS |d OCLCF |d DEBBG |d COO |d OCLCQ |d EBLCP |d OCLCQ |d DEBSZ |d OCLCQ |d ESU |d STF |d D6H |d NLE |d OCLCQ |d LEAUB |d OL$ |d OCLCQ |d S2H |d OCLCO |d OCLCQ |d OCLCO |d COM |d OCLCQ |d OCLCO | ||
| 019 | |a 182620949 |a 441814637 |a 648331183 |a 779919579 | ||
| 020 | |a 9780444500724 | ||
| 020 | |a 0444500723 | ||
| 020 | |a 9780080529523 |q (electronic bk.) | ||
| 020 | |a 0080529526 |q (electronic bk.) | ||
| 035 | |a (OCoLC)162131184 |z (OCoLC)182620949 |z (OCoLC)441814637 |z (OCoLC)648331183 |z (OCoLC)779919579 | ||
| 050 | 4 | |a QA9.59 |b .A84 2000eb | |
| 072 | 7 | |a QA |2 lcco | |
| 072 | 7 | |a MAT |x 016000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.3 |2 22 |
| 100 | 1 | |a Ash, C. J. | |
| 245 | 1 | 0 | |a Computable structures and the hyperarithmetical hierarchy / |c C.J. Ash, J. Knight. |
| 250 | |a 1st ed. | ||
| 260 | |a Amsterdam ; |a New York : |b Elsevier, |c 2000. | ||
| 300 | |a 1 online resource (xv, 346 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Studies in logic and the foundations of mathematics ; |v v. 144 | |
| 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). | ||
| 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. | |
| 504 | |a Includes bibliographical references (pages 323-333) and index. | ||
| 588 | 0 | |a Print version record. | |
| 650 | 0 | |a Computable functions. | |
| 650 | 6 | |a Fonctions calculables. |0 (CaQQLa)201-0078765 | |
| 650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a Computable functions |2 fast |0 (OCoLC)fst00871985 | |
| 650 | 1 | 7 | |a Wiskundige logica. |2 gtt |
| 650 | 7 | |a Fonctions calculables. |2 ram | |
| 650 | 7 | |a R�ecursivit�e, Th�eorie de la. |2 ram | |
| 700 | 1 | |a Knight, J. |q (Julia) | |
| 776 | 0 | 8 | |i Print version: |a Ash, C.J. |t Computable structures and the hyperarithmetical hierarchy. |b 1st ed. |d Amsterdam ; New York : Elsevier, 2000 |z 0444500723 |z 9780444500724 |w (DLC) 00034103 |w (OCoLC)44046875 |
| 830 | 0 | |a Studies in logic and the foundations of mathematics ; |v v. 144. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780444500724 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/publication?issn=0049237X&volume=144 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/bookseries/0049237X/144 |z Texto completo |