Cargando…
A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.In A Hierarchy of...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton, NJ :
Princeton University Press,
[2020]
|
| Colección: | Annals of Mathematics Studies ;
382 |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | DEGRUYTERUP_9780691200217 | ||
| 003 | DE-B1597 | ||
| 005 | 20220131112047.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr || |||||||| | ||
| 008 | 220131t20202020nju fo d z eng d | ||
| 010 | |a 2019052456 | ||
| 020 | |a 9780691200217 | ||
| 024 | 7 | |a 10.1515/9780691200217 |2 doi | |
| 035 | |a (DE-B1597)544905 | ||
| 035 | |a (OCoLC)1196361575 | ||
| 040 | |a DE-B1597 |b eng |c DE-B1597 |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a nju |c US-NJ | ||
| 050 | 0 | 0 | |a QA9.63 |b .D69 2020 |
| 050 | 4 | |a QA9.63 |b .D69 2021 | |
| 072 | 7 | |a MAT018000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.3 |2 23 |
| 100 | 1 | |a Downey, Rod, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 2 | |a A Hierarchy of Turing Degrees : |b A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / |c Noam Greenberg, Rod Downey. |
| 264 | 1 | |a Princeton, NJ : |b Princeton University Press, |c [2020] | |
| 264 | 4 | |c ©2020 | |
| 300 | |a 1 online resource (240 p.) : |b 3 b/w illus. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 0 | |a Annals of Mathematics Studies ; |v 382 | |
| 505 | 0 | 0 | |t Frontmatter -- |t Contents -- |t Acknowledgments -- |t Chapter One. Introduction -- |t Chapter Two. ɑ-c.a. functions -- |t Chapter Three. The hierarchy of totally ɑ-c.a. degrees -- |t Chapter Four. Maximal totally ɑ-c.a. degrees -- |t Chapter Five. Presentations of left-c.e. reals -- |t Chapter Six. m-topped degrees -- |t Chapter Seven. Embeddings of the 1-3-1 lattice -- |t Chapter Eight. Prompt permissions -- |t Bibliography |
| 506 | 0 | |a restricted access |u http://purl.org/coar/access_right/c_16ec |f online access with authorization |2 star | |
| 520 | |a Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field. | ||
| 538 | |a Mode of access: Internet via World Wide Web. | ||
| 546 | |a In English. | ||
| 588 | 0 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022) | |
| 650 | 0 | |a Computable functions. | |
| 650 | 0 | |a Recursively enumerable sets. | |
| 650 | 0 | |a Unsolvability (Mathematical logic) | |
| 650 | 0 | |a Unsolvability (Mathematical logic). | |
| 650 | 7 | |a MATHEMATICS / Logic. |2 bisacsh | |
| 653 | |a Recursion theory. | ||
| 653 | |a c.e. degrees. | ||
| 653 | |a c.e. reals. | ||
| 653 | |a computable model theory. | ||
| 653 | |a lattice embeddings. | ||
| 653 | |a m-topped degrees. | ||
| 653 | |a mind changes in computability theory. | ||
| 653 | |a modern computability theory. | ||
| 653 | |a pi-zero-one classes. | ||
| 653 | |a prompt permissions. | ||
| 653 | |a relative recursive randomness. | ||
| 653 | |a transfinite hierarchy of Turing degrees. | ||
| 700 | 1 | |a Greenberg, Noam, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t EBOOK PACKAGE COMPLETE 2020 English |z 9783110704716 |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t EBOOK PACKAGE COMPLETE 2020 |z 9783110704518 |o ZDB-23-DGG |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t EBOOK PACKAGE Mathematics 2020 English |z 9783110704846 |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t EBOOK PACKAGE Mathematics 2020 |z 9783110704662 |o ZDB-23-DMA |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t Princeton Annals of Mathematics eBook-Package 1940-2020 |z 9783110494914 |o ZDB-23-PMB |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t Princeton University Press Complete eBook-Package 2020 |z 9783110690088 |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1515/9780691200217 |z Texto completo |
| 856 | 4 | 0 | |u https://degruyter.uam.elogim.com/isbn/9780691200217 |z Texto completo |
| 912 | |a 978-3-11-069008-8 Princeton University Press Complete eBook-Package 2020 |b 2020 | ||
| 912 | |a 978-3-11-070471-6 EBOOK PACKAGE COMPLETE 2020 English |b 2020 | ||
| 912 | |a 978-3-11-070484-6 EBOOK PACKAGE Mathematics 2020 English |b 2020 | ||
| 912 | |a EBA_CL_MTPY | ||
| 912 | |a EBA_EBKALL | ||
| 912 | |a EBA_ECL_MTPY | ||
| 912 | |a EBA_EEBKALL | ||
| 912 | |a EBA_ESTMALL | ||
| 912 | |a EBA_PPALL | ||
| 912 | |a EBA_STMALL | ||
| 912 | |a GBV-deGruyter-alles | ||
| 912 | |a PDA12STME | ||
| 912 | |a PDA13ENGE | ||
| 912 | |a PDA18STMEE | ||
| 912 | |a PDA5EBK | ||
| 912 | |a ZDB-23-DGG |b 2020 | ||
| 912 | |a ZDB-23-DMA |b 2020 | ||
| 912 | |a ZDB-23-PMB |c 1940 |d 2020 | ||