Cargando…
A hierarchy of Turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability /
"This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now h...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton :
Princeton University Press,
2020.
|
| Colección: | Annals of mathematics studies ;
no. 206, 385. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | JSTOR_on1151198376 | ||
| 003 | OCoLC | ||
| 005 | 20231005004200.0 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 200307s2020 njua ob 000 0 eng | ||
| 010 | |a 2023700482 | ||
| 040 | |a DLC |b eng |e rda |e pn |c DLC |d N$T |d JSTOR |d OCLCF |d UBY |d CUV |d BNG |d YDX |d OH1 |d IEEEE |d SFB |d EBLCP | ||
| 019 | |a 1159141858 | ||
| 020 | |a 9780691200217 |q ebook | ||
| 020 | |a 0691200211 | ||
| 020 | |z 9780691199658 |q (hardback) | ||
| 020 | |z 9780691199665 |q (paperback) | ||
| 020 | |z 0691199655 |q (hardcover) | ||
| 020 | |z 0691199663 |q (paperback) | ||
| 029 | 1 | |a AU@ |b 000067499835 | |
| 035 | |a (OCoLC)1151198376 |z (OCoLC)1159141858 | ||
| 037 | |a 22573/ctvssq932 |b JSTOR | ||
| 037 | |a 9452519 |b IEEE | ||
| 050 | 0 | 0 | |a QA9.63 |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 072 | 7 | |a COM |x 014000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 003000 |2 bisacsh | |
| 082 | 0 | 0 | |a 511.3 |2 23 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Downey, R. G. |q (Rod G.), |e author. | |
| 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 / |c Rod Downey, Noam Greenberg. |
| 264 | 1 | |a Princeton : |b Princeton University Press, |c 2020. | |
| 300 | |a 1 online resource (viii, 222 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 Annals of Mathematics Studies ; |v v. 385 | |
| 490 | 1 | |a Annals of mathematics studies ; |v number 206 | |
| 504 | |a Includes bibliographical references (pages [215]-222). | ||
| 505 | 0 | |a [Alpha]-c.a. functions -- The hierarchy of totally [alpha]-c.a. degrees -- Maximal totally [alpha]-c.a. degrees -- Presentations of left-c.e. reals -- m-topped degrees -- Embeddings of the 1-3-1 lattice -- Prompt permissions. | |
| 520 | |a "This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now have a variety of applications in topology, group theory, and other subfields. This monograph establishes new directions in the field, blending classic results with modern research areas such as algorithmic randomness. The significance of the book lies not only in the depth of the results contained therein, but also in the fact that the notions the authors introduce allow them to unify results from several subfields of computability theory"-- |c Provided by publisher. | ||
| 588 | |a Description based on print version record and CIP data provided by publisher; resource not viewed. | ||
| 590 | |a JSTOR |b Books at JSTOR Evidence Based Acquisitions | ||
| 590 | |a JSTOR |b Books at JSTOR Demand Driven Acquisitions (DDA) | ||
| 590 | |a JSTOR |b Books at JSTOR All Purchased | ||
| 650 | 0 | |a Unsolvability (Mathematical logic) | |
| 650 | 0 | |a Computable functions. | |
| 650 | 0 | |a Recursively enumerable sets. | |
| 650 | 6 | |a Non-résolubilité (Logique mathématique) | |
| 650 | 6 | |a Fonctions calculables. | |
| 650 | 6 | |a Ensembles récursivement énumérables. | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a Computable functions |2 fast | |
| 650 | 7 | |a Recursively enumerable sets |2 fast | |
| 650 | 7 | |a Unsolvability (Mathematical logic) |2 fast | |
| 700 | 1 | |a Greenberg, Noam, |d 1974- |e author. | |
| 776 | 0 | 8 | |i Print version: |t A hierarchy of Turing degrees |d Princeton : Princeton University Press, 2020. |z 9780691199658 |w (DLC) 2019052456 |
| 830 | 0 | |a Annals of mathematics studies ; |v no. 206, 385. | |
| 856 | 4 | 0 | |u https://jstor.uam.elogim.com/stable/10.2307/j.ctvss3wsw |z Texto completo |
| 938 | |a YBP Library Services |b YANK |n 16584674 | ||
| 938 | |a EBSCOhost |b EBSC |n 2324246 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL6173881 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH37347562 | ||
| 994 | |a 92 |b IZTAP | ||