Abstract
Let denote third order arithmetic. Let Harrington's Principle, , denote the statement that there is a real x such that every x‐admissible ordinal is a cardinal in . In this paper, assuming there exists a remarkable cardinal with a weakly inaccessible cardinal above it, we force a set model of via set forcing without reshaping.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
