상세정보
Export to Refworks부가기능
Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis. |
| 개인저자 | Barnes, James Samuel. |
| 단체저자명 | Cornell University. Mathematics. |
| 발행사항 | [S.l.]: Cornell University., 2018. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
| 형태사항 | 153 p. |
| 기본자료 저록 | Dissertation Abstracts International 80-01A(E). Dissertation Abstract International |
| ISBN | 9780438343535 |
| 학위논문주기 | Thesis (Ph.D.)--Cornell University, 2018. |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 80-01(E), Section: A.
Adviser: Richard A. Shore. |
| 요약 | 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. |
| 요약 | 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 |
| 요약 | 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 |
| 일반주제명 | Logic. Mathematics. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
