Related papers: Beyond $\underTilde{\Sigma}^2_1$ absoluteness

We present a self-contained account of Woodin's extender algebra and its use in proving absoluteness results, including a proof of the $\Sigma^2_1$-absoluteness theorem. We also include a proof that the existence of an inner model with…

In [FHK13], the authors considered the question whether model-existence of $L_{\omega_1,\omega}$-sentences is absolute for transitive models of ZFC, in the sense that if $V \subseteq W$ are transitive models of ZFC with the same ordinals,…

We put together Woodin's $\Sigma^2_1$ basis theorem of AD$^+$ and Vop\v{e}nka's theorem to conclude the following: If there is a proper class of Woodin cardinals, then every $(\Sigma^2_1)^{\mbox{uB}}$ statement that is true in $V$ is true…

We investigate the position that foundational theories should be modelled on ordinary computability. In this context, we investigate the metamathematics of $\Sigma$ formulas. We consider theories whose axioms are implications between…

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…

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

This article explores the concept of absoluteness in the context of mathematical analysis, focusing specifically on the Riemann integral on $\mathbb{R}^{n}$. In mathematical logic, "absoluteness" refers to the invariance of the truth value…

We prove theorems of the following form: if $A\subseteq {\mathbb R}^2$ is a big set, then there exists a big set $P\subseteq {\mathbb R}$ and a perfect set $Q\subseteq {\mathbb R}$ such that $P\times Q\subseteq A$. We discuss cases where…

In 1994 Jech gave a model theoretic proof of G\"odel's second incompleteness theorem for Zermelo-Fraenkel set theory in the following form: ZF does not prove that ZF has a model. Kotlarski showed that Jech's proof can be adapted to Peano…

We give a reframing of Godel's first and second incompleteness theorems that applies even to some undefinable theories of arithmetic. The usual Hilbert-Bernays provability conditions and the diagonal lemma are replaced by a more direct…

We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

$\aleph_1$-free groups, abelian groups for which every countable subgroup is free, exhibit a number of interesting algebraic and set-theoretic properties. In this paper, we give a complete proof that the property of being $\aleph_1$-free is…

We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…

A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…

It is proved that if $T$ is a $\Sigma_{n+1}$ Definable theory which is $\Sigma_n$-sound and extends $PA$, then $T$ can not prove the sentence $\Sigma_n-sound(T)$ that expresses the $\Sigma_n$-soundness of $T$. Optimality of this result is…

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Inspired by Zermelo's quasi-categoricity result characterizing the models of second-order Zermelo-Fraenkel set theory $\text{ZFC}_2$, we investigate when those models are fully categorical, characterized by the addition to $\text{ZFC}_2$…