Related papers: Extender Based Radin Forcing
The Axiom of Full Reflection at a measurable cardinal has been conjectured to be equiconsitent with the existence of a coherent sequence of measures with a repeat point. However we prove that the Axiom of Full Reflection at a measurable…
For the incompressible Euler equations the pressure formally scales as a quadratic function of velocity. We provide several optimal regularity estimates on the pressure by using regularity of velocity in various Sobolev, Besov and Hardy…
The technique of $\star$-translation is important in arguments calibrating the strengths of determinacy theories against large cardinals, for example in [9] and [1] in the paper's bibliography. It has also been used in analysing the…
While maximal independent families can be constructed from ZFC via Zorn's lemma, the presence of a maximal $\sigma$-independent family already gives an inner model with a measurable cardinal, and Kunen has shown that from a measurable…
We define a modified dimensional-regularization technique that overcomes several difficulties of the ordinary technique, and is specially designed to work efficiently in chiral and parity violating quantum field theories, in arbitrary…
The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form of simultaneous reflection follows from the Set Mapping…
In this article we apply the machinery developed in Guo-Iyer[1] together with a new compactness estimate and an object called the degree in order to prove validity of steady Prandtl layer expansions with external forcing.
We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…
Remarkable cardinals were introduced by Schindler, who showed that the existence of a remarkable cardinal is equiconsistent with the assertion that the theory of $L(\mathbb R)$ is absolute for proper forcing. Here, we study the…
The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery…
We investigate the behavior of cardinal characteristics of the reals under extensions that do not add new ${<}\kappa$-sequences (for some regular $\kappa$). As an application, we show that consistently the following cardinal characteristics…
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…
Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…
We study the Casimir effect in the presence of an extra dimension compactified on a circle of radius R ($M^4\times S^1$ spacetime). Our starting point is the Kaluza Klein decomposition of the 5D Maxwell action into a massless sector…
We study the notion of tightly stationary sets which was introduced by Foreman and Magidor in \cite{ForMag-MS}. We obtain two consistency results which show that it is possible for a sequence of regular cardinals $( \kappa_n )_{n < \omega}$…
In the encoding of many real-world problems to propositional satisfiability, the cardinality constraint is a recurrent constraint that needs to be managed effectively. Several efficient encodings have been proposed while missing that such a…
I explore two separate topics: the concept of jointness for set-theoretic guessing principles, and the notion of grounded forcing axioms. A family of guessing sequences is said to be joint if all of its members can guess any given family of…
Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…
Many generalizations of continued fractions, where the reciprocal function has been replaced by a more general function, have been studied, and it is often asked whether such generalized expansions can have nice properties. For instance, we…
By Easton's theorem one can force the exponential function on regular cardinals to take rather arbitrary cardinal values provided monotonicity and Koenig's lemma are respected. In models without choice we employ a "surjective" version of…