For a large natural class of forcing notions, we prove general equivalence theorems between forcing absoluteness statements, regularity properties, and transcendence properties over and the core model . We use our results to answer open questions from set theory of the reals.

In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our Boolean-valued second-order logic, the second-order variables range over all Boolean-valued subsets and relations on the domain. We show that under large cardinal assumptions Boolean-valued second-order logic is more robust than full second-order logic. Its (...) validity is absolute under forcing, and its Hanf and Löwenheim numbers are smaller than those of full second-order logic. (shrink)

We study various classes of maximality principles, \\), introduced by Hamkins :527–550, 2003), where \ defines a class of forcing posets and \ is an infinite cardinal. We explore the consistency strength and the relationship of \\) with various forcing axioms when \. In particular, we give a characterization of bounded forcing axioms for a class of forcings \ in terms of maximality principles MP\\) for \ formulas. A significant part of the paper is devoted to studying the principle MP\\) (...) where \ and \ defines the class of stationary set preserving forcings. We show that MP\\) has high consistency strength; on the other hand, if \ defines the class of proper forcings or semi-proper forcings, then by Hamkins, MP\\) is consistent relative to \. (shrink)

We show under that every set of reals is I‐regular for any σ‐ideal I on the Baire space such that is proper. This answers the question of Khomskii [7, Question 2.6.5]. We also show that the same conclusion holds under if we additionally assume that the set of Borel codes for I‐positive sets is. If we do not assume, the notion of properness becomes obscure as pointed out by Asperó and Karagila [1]. Using the notion of strong properness similar to (...) the one introduced by Bagaria and Bosch [2], we show under without using that every set of reals is I‐regular for any σ‐ideal I on the Baire space such that is strongly proper assuming every set of reals is ∞‐Borel and there is no ω1‐sequence of distinct reals. In particular, the same conclusion holds in a Solovay model. (shrink)

We show that ${{\bf \Sigma}^1_3}$ -absoluteness for Sacks forcing is equivalent to the non-existence of a ${{\bf \Delta}^1_2}$ Bernstein set. We also show that Sacks forcing is the weakest forcing notion among all of the preorders that add a new real with respect to ${{\bf \Sigma}^1_3}$ forcing absoluteness.

The theory of infinite games with slightly imperfect information has been developed for games with finitely and countably many moves. In this paper, we shift the discussion to games with uncountably many possible moves, introducing the axiom of real Blackwell determinacy \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{Bl-AD}_\mathbb{R}}$$\end{document} (as an analogue of the axiom of real determinacy \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{AD}_\mathbb{R}}$$\end{document}). We prove that the consistency strength of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} (...) \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{Bl-AD}_\mathbb{R}}$$\end{document} is strictly greater than that of AD. (shrink)