Related papers: Generic Absoluteness Revisited
We consider several variants of Baumgartner's axiom for $\aleph_1$-dense sets defined on the Baire and Cantor spaces in terms of Lipschitz functions with respect to the usual metric. A variation of Baumgartner's original argument shows that…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
Many of the most common reverse Easton iterations found in the large cardinal context, such as the Laver preparation, admit a gap at some small delta in the sense that they factor as P*Q, where P has size less than delta and Q is forced to…
By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…
We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by $Loc({\rm ZFC})$, says that every set belongs to a transitive model of ZFC. LZFC consists of $Loc({\rm ZFC})$ plus…
We review recent results on the Cauchy-Kowalevsky structure of theories with higher derivatives in vacuum. We prove genericity of regularity of solutions under the assumption of analyticity. Our approach is framed in the general context of…
In this paper, we obtain the consistency, relative to large cardinals, of the existence of dense ideals on every successor of a regular cardinal simultaneously. Using a consequent transfer principle, we show that in this model there is a…
When $L$ is a complete lattice, the collection $\Mon_L$ of all monotone functions $L^p \to L^n$, $n,p \geq 0$, forms a Lawvere theory. We enrich this Lawvere theory with the binary supremum operation $\vee$, an operation of (left)…
Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…
We introduce the resurrection axioms, a new class of forcing axioms, and the uplifting cardinals, a new large cardinal notion, and prove that various instances of the resurrection axioms are equiconsistent over ZFC with the existence of an…
We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…
We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…
This paper generalizes Shelah's generic pair conjecture (now theorem) for the measurable cardinal case from first order theories to finite diagrams. We use homogeneous models in the place of saturated models.
A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…
We investigate generally covariant theories which admit a Fierz-Pauli mass term for metric perturbations around an arbitrary curved background. For this we restore the general covariance of the Fierz-Pauli mass term by introducing four…
In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models. An posible generalization of the Lob's theorem is considered.Main results is: (1) let $k$ be an inaccessible…
The ground axiom is the assertion that the set-theoretic universe is not obtainable by forcing over any inner model. Although this appears at first to be a second-order assertion, it is actually first-order expressible in the language of…
We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…
Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…
It is known that the large cardinal strength of the Axiom of Determinacy when enhanced with the hypothesis that all sets of reals are universally Baire is much stronger than the Axiom of Determinacy itself. Sargsyan conjectured it to be as…