SearcharxivSearch

arXiv · 1610.02832

Useful axioms

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 {\L}o\'s Theorem for ultraproducts of first order structures and Shoenfield's absoluteness for $\Sigma^1_2$-properties. Finally we address the question of whether and to what extent forcing axioms can provide a "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(\text{Ord}^\omega)$ in the presence of large cardinals, and recent works by the author show that this can also be the case for the Chang model $L(\text{Ord}^{\omega_1})$ in the presence of large cardinals and maximal strengthenings of Martin's maximum or of the proper forcing axiom. The major open question we leave open is whether this situation is peculiar to these Chang models or can be lifted up also to $L(\text{Ord}^\kappa)$ for cardinals $\kappa>\omega_1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Matteo Viale. 2016-10-10. Useful axioms. https://arxiv.org/abs/1610.02832

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO