Related papers: Forcing, genericity and CBERS
We examine a recent argument that ``identical'' quantum particles with an anti-symmetric state (fermions) are weakly discernible objects, just like irreflexively related ordinary objects in situations with perfect symmetry (Black's spheres,…
We study the computational complexity of a robust version of the problem of testing two univariate C-finite functions for eventual inequality at large times. Specifically, working in the bit-model of real computation, we consider the…
Combining canonization results of Pr\"omel-Voigt, Mathias, and Soare, we provide a new, natural example of an $F_\sigma$ equivalence relation that is not hypersmooth.
We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it…
Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the…
The aim of this paper is to introduce several notions of homogenization in various classes of weighted means, which include quasiarithmetic and semideviation means. In general, the homogenization is an operator which attaches a homogeneous…
We study an extensive connection between factor forcings of Borel subsets of Polish spaces modulo a sigma-ideal, and factor forcings of subsets of countable sets modulo an ideal.
We prove some strong results on approximation of strongly semistable bundles with vanishing numerical Chern classes by filtrations, whose quotients are line bundles of similar slope. This generalizes some earlier results of…
We introduce a new class of preconditioners to enable flexible GMRES to find a least-squares solution, and potentially the pseudoinverse solution, of large-scale sparse, asymmetric, singular, and potentially inconsistent systems. We develop…
We provide solutions to several problems of Foreman about ideals, several of which are closely related to Mitchell's notion of \emph{strongly proper} forcing. We prove: 1) Presaturation of a normal ideal implies projective antichain…
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; 2) there are…
In this paper, we deal with the notions of naturality from category theory and definablity from model theory and their interactions. In this regard, we present three results. First, we show, under some mild conditions, that naturality…
Over a finite-dimensonal algbera $A$, simple $A$-modules that have projective dimension one have special properties. For example, Geigle-Lenzing studied them in connection to homological epimorphisms of rings, and they have also appeared in…
In this paper we introduce filtration pairs for isolated invariant sets of continuous maps. We prove the existence of filtration pairs and show that, up to shift equivalence, the induced map on the corresponding pointed space is an…
An increasing awareness of biased patterns in natural language processing resources, like BERT, has motivated many metrics to quantify `bias' and `fairness'. But comparing the results of different metrics and the works that evaluate with…
I discuss the inadequacy of the "projected density" prescription to be used in density dependent forces/functionals when calculations beyond mean field are pursued. The case of calculations aimed at the symmetry restoration of mean fields…
Fairness, through its many forms and definitions, has become an important issue facing the machine learning community. In this work, we consider how to incorporate group fairness constraints in kernel regression methods, applicable to…
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…