Related papers: A note on iterating strongly $(<\lambda)$-closed s…
We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…
An exponential modified gravity with additional logarithmic corrections is considered with the presence of an axion-like scalar field in the role of dark matter. Axion fields are thought to become important at late-times when the axion-like…
The Necessary Maximality Principle for c.c.c. forcing asserts that any statement about a real in a c.c.c. extension that could become true in a further c.c.c. extension and remain true in all subsequent c.c.c. extensions, is already true in…
The goals of this paper are threefold. First, we show that a counterpart of the Newman bound related to the Chui conjecture is valid in the case where the gradient of Coulomb potential is generated by arbitrary positive charges placed at…
We show, assuming a mild set-theoretic hypothesis, that if an abstract elementary class (AEC) has a superstable-like forking notion for models of cardinality $\lambda$ and a superstable-like forking notion for models of cardinality…
A new set of boundary conditions for string propagators is proposed in this paper. The boundary conditions are parametrized by a complex number $\lambda$. Under these new boundary conditions, the left-moving and right-moving modes are…
The purpose of this article is to give a presentation of the method of forcing aimed at someone with a minimal knowledge of set theory and logic. The emphasis will be on how the method can be used to prove theorems in ZFC.
Formal transformations somehow resembling the usual derivative are surprisingly common in computer science, with two notable examples being derivatives of regular expressions and derivatives of types. A newcomer to this list is the…
We prove an asymptotically tight lower bound on $|A+\lambda A|$ for $A\subset \mathbb{C}$ and algebraic integer $\lambda$. The proof combines strong version of Freiman's theorem, structural theorem on dense subsets of a hypercubic lattice…
Since the very beginning of the theory of linear logic it is known how to represent the $\lambda$-calculus as linear logic proof nets. The two systems however have different granularities, in particular proof nets have an explicit notion of…
Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…
We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…
There has been significant progress recently in our understanding of the stationary measures of the exclusion process on $Z$. The corresponding situation in higher dimensions remains largely a mystery. In this paper we give necessary and…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
An iterative optimization approach that simultaneously minimizes the energy and optimizes the Lagrange multipliers enforcing desired constraints is presented. The method is tested on previously established benchmark systems and it is proved…
It is known that an object translating parallel to a soft wall in a viscous fluid produces hydro- dynamic stresses that deform the wall, which, in turn, results in a lift force on the object. Recent experiments with cylinders sliding under…
Our main result is a recognition principle for iterated suspensions as coalgebras over the little disks operads. Given a topological operad, we construct a comonad in pointed topological spaces endowed with the wedge product. We then prove…
Lattice power-counting is extended to QCD with staggered fermions. As preparation, the difficulties encountered by Reisz's original formulation of the lattice power-counting theorem are illustrated. One of the assumptions that is used in…
We develop the theory of meta-iteration trees, that is, iteration trees whose base "model" is itself an ordinary iteration tree. We prove a comparison theorem for meta-iteration strategies parallel to the one for ordinary iteration…
We search for viable f(R) theories of gravity, making use of the equivalence between such theories and scalar-tensor gravity. We find that models can be made consistent with solar system constraints either by giving the scalar a high mass…