Arrow Research search
Back to FLAP

FLAP 2017

Useful Axioms.

Journal Article Number 10 Logic in Computer Science

Abstract

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire’s category theorem. First of all we outline how, using basic partial order theory, it is possible to reformulate the axiom of choice, Baire’s category theorem, and many large cardinal axioms as specific instances of forcing axioms. We then address forcing axioms with a model-theoretic perspective and outline a deep analogy existing between the standard Łoś Theorem for ultraproducts of first order structures and Shoenfield’s absoluteness for Σ12 -properties. Finally we address the question of whether and to what extent forcing axioms can provide “complete” semantics for set theory. We argue that to a large extent this is possible for certain initial fragments of the universe of sets: The pioneering work of Woodin on generic absoluteness show that this is the case for the Chang model L(Ordω ) (where all of mathematics formalizable in second order number theory can be developed) in the presence of large cardinals, and recent works by the author with Asperó and with Audrito show that this can also be the case for the Chang model L(Ordω1 ) (where one can develop most of mathematics formalizable in third order number theory) in the presence of large cardinals and maximal strengthenings of Martin’s maximum or of the proper forcing axiom. A major open question we leave completely open is whether this situation is peculiar to these Chang models or can be lifted up also to L(Ordκ ) for cardinals κ > ω1.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
IfCoLog Journal of Logics and their Applications
Archive span
2014-2026
Indexed papers
633
Paper id
517857511019824260
v2026.09.13