| LDR | | 00000nmm u2200205 4500 |
| 001 | | 000000330453 |
| 005 | | 20241031174711 |
| 008 | | 181129s2018 ||| | | | eng d |
| 020 | |
▼a 9780438343535 |
| 035 | |
▼a (MiAaPQ)AAI10845201 |
| 035 | |
▼a (MiAaPQ)cornellgrad:10991 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 248032 |
| 049 | 1 |
▼f DP |
| 082 | 0 |
▼a 160 |
| 100 | 1 |
▼a Barnes, James Samuel.
▼0 (orcid)0000-0003-3978-487X |
| 245 | 10 |
▼a Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis. |
| 260 | |
▼a [S.l.] :
▼b Cornell University.,
▼c 2018 |
| 260 | 1 |
▼a Ann Arbor :
▼b ProQuest Dissertations & Theses,
▼c 2018 |
| 300 | |
▼a 153 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 80-01(E), Section: A. |
| 500 | |
▼a Adviser: Richard A. Shore. |
| 502 | 1 |
▼a Thesis (Ph.D.)--Cornell University, 2018. |
| 520 | |
▼a In this thesis we explore two different topics: the complexity of the theory of the hyperdegrees, and the reverse mathematics of a result in graph theory. |
| 520 | |
▼a For the first, we show the Sigma2 theory of the hyperdegrees as an upper-semilattice is decidable, as is the Sigma2 theory of the hyperdegrees below Kleene's O as an upper-semilattice with greatest element. These results are related to questions |
| 520 | |
▼a The second part is joint work with Richard Shore and Jun Le Goh. We investigate a theorem of graph theory and find that one formalization is a theorem of hyperarithmetic analysis: the second such example found, as it were, in the wild. This work |
| 590 | |
▼a School code: 0058. |
| 650 | 4 |
▼a Logic. |
| 650 | 4 |
▼a Mathematics. |
| 690 | |
▼a 0395 |
| 690 | |
▼a 0405 |
| 710 | 20 |
▼a Cornell University.
▼b Mathematics. |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 80-01A(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0058 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15000047
▼n KERIS |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a 관리자
▼b 관리자 |