Related papers: Almost Strong Properness
There are many evaluation strategies for term rewrite systems, but automatically proving termination or analyzing complexity is usually easiest for innermost rewriting. Several syntactic criteria exist when innermost termination implies…
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…
In this paper, we introduce a strong property $(A)$ and we study the transfer of property $(A)$ and strong property $(A)$ in trivial ring extensions and amalgamated duplication of a ring along an ideal. We also exhibit a class of rings…
We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have simple universal strongly generic conditions on a stationary set of…
The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…
We consider a property stronger than the Sacks property, called the shrink wrapping property, which holds between the ground model and each Sacks forcing extension. Unlike the Sacks property, the shrink wrapping property does not hold…
It is known that the family of power means tends to maximum pointwise if we pass argument to infinity. We will give some necessary and sufficient condition for the family of quasi-arithmetic means generated by a functions satisfying certain…
Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…
We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…
The foundations of forcing theory are reworked to streamline the presentation and to show how the most basic results are applicable in very general contexts.
We extend the mathematical theory of rigidity of frameworks (graphs embedded in $d$-dimensional space) to consider nonlocal rigidity and flexibility properties. We provide conditions on a framework under which (I) as the framework flexes…
We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both on real-life preference-aggregation data and on synthetic…
We introduce the notion of approximate smoothness in a normed linear space. We characterize this property and show the connections between smoothness and approximate smoothness for some spaces. As an application, we consider in particular…
I prove forcing preservation theorems for products of definable partial orders preserving the cofinality of the meager or null ideal. Rectangular Ramsey theorems for related ideals follow from the proofs.
Equivariant neural networks have shown great success in reinforcement learning, improving sample efficiency and generalization when there is symmetry in the task. However, in many problems, only approximate symmetry is present, which makes…
We show that several classical Ramseyan statements, and a forcing statement, are each equivalent to having Rothberger's property in all finite powers.
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all three kinds of information. We therefore propose a framework,…
In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…
We present a method for iterating semiproper forcing which uses side conditions and is inspired by the technique recently introduced by Neeman.
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.