HARRINGTON’S PRINCIPLE IN HIGHER ORDER ARITHMETIC

DOI10.1017/JSL.2014.31zbMath1373.03093arXiv1503.04000OpenAlexW3105032509MaRDI QIDQ5501766

Yong Cheng, Ralf-Dieter Schindler

Publication date: 14 August 2015

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04000

zbMATH Keywords

class forcingreshapingsubcomplete forcingiterated club shootingremarkable cardinalalmost disjoint forcing\(\mathsf{HP}(\varphi)\)\(0^{\sharp}\)\(Z_{2}\)\(Z_{3}\)\(Z_{4}\)Harrington's principle \(\mathsf{HP}\)revised countable support (RCS) iterations

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Axiomatics of classical set theory and its fragments (03E30) Other set-theoretic hypotheses and axioms (03E65)

Related Items (5)

Forcing a set model of Z3 + Harrington's Principle ⋮ The strong reflecting property and Harrington's Principle ⋮ Generic Vopěnka's principle, remarkable cardinals, and the weak proper forcing axiom ⋮ Virtual large cardinals ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS

Cites Work

• Set theory. An introduction to independence proofs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: HARRINGTON’S PRINCIPLE IN HIGHER ORDER ARITHMETIC