相关论文: Universal forcing notions and ideals

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…

In this paper, we obtain some factorization results on formal power series over principle ideal domains with sharp bounds on number of irreducible factors. These factorization results correspondingly lead to irreducibility criteria for…

Motivated by LHC results, we modify the usual criterion for naturalness by ignoring the uncomputable power divergences. The Standard Model satisfies the modified criterion ('finite naturalness') for the measured values of its parameters.…

We are interested in generalizing part of the theory of ultrafilters on omega to larger cardinals. Here we set the scene for further investigations introducing properties of ultrafilters in strong sense dual to being normal.

We prove that a large class of presaturated ideals at inaccessible cardinals can be de-saturated while preserving their presaturation, answering both a question of Foreman and of Cox and Eskew. We do so by iterating a generalized version of…

We define typical forcings encompassing many informal forcing arguments in bounded arithmetic and give general conditions for such forcings to produce models of the universal variant of relativized $T^1_2$. We apply this result to study the…

We investigate the problem of when $\leq\lambda$--support iterations of $<\lambda$--complete notions of forcing preserve $\lambda^+$. We isolate a property -- {\em properness over diamonds} -- that implies $\lambda^+$ is preserved and show…

For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with…

We consider $(<\lambda)$-support iterations of a version of $(<\lambda)$-strategically complete $\lambda^+$-c.c. definable forcing notions along partial orders. We show that such iterations can be corrected to yield an analog of a result by…

We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…

For a free ultrafilter U on omega we study several cardinal characteristics which describe part of the combinatorial structure of U. We provide various consistency results; e.g. we show how to force simultaneously many characters and many…

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

We develop a forcing framework based on the idea of amalgamating language fragments into a theory with a canonical term model. We then demonstrate the usefulness of this framework by applying it to variants of the extended Namba problem, as…

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…