Harrington's principle over higher order arithmetic
Logic
2020-12-22 v1
Abstract
Let , , and denote , , and order arithmetic, respectively. We let Harrington's Principle, {\sf HP}, denote the statement that there is a real such that every --admissible ordinal is a cardinal in . The known proofs of Harrington's theorem " implies exists" are done in two steps: first show that implies {\sf HP}, and then show that {\sf HP} implies exists. The first step is provable in . In this paper we show that is equiconsistent with and that is equiconsistent with there exists a remarkable cardinal. As a corollary, does not imply exists, whereas does. We also study strengthenings of Harrington's Principle over and order arithmetic.
Keywords
Cite
@article{arxiv.1503.04000,
title = {Harrington's principle over higher order arithmetic},
author = {Yong Cheng and Ralf Schindler},
journal= {arXiv preprint arXiv:1503.04000},
year = {2020}
}
Comments
13 pages, to appear in JSL Volume 80,Issue 2 (June 2015)