Related papers: Separating Subversion Forcing Axioms
In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…
The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…
Let $f$ be a transcendental entire function. The escaping set $I(f)$ consists of those points that tend to infinity under iteration of $f$. We show that $I(f)$ is not $\sigma$-compact, resolving a question of Rippon from 2009.
The statement of Lemma 3.1 in the published paper is not correct. Lemma 3.1 is needed for the proof of Theorem 3.2. Theorem 3.2 as originally stated is true but its "proof" is not correct. Here we change the statements and proofs of Lemma…
In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…
Fact verification aims to verify a claim using evidence from a trustworthy knowledge base. To address this challenge, algorithms must produce features for every claim that are both semantically meaningful, and compact enough to find a…
We introduce a two-parameter family of discrepancy measures, termed \emph{$(G,f)$-divergences}, obtained by applying a non-decreasing function $G$ to an $f$-divergence $D_f$. Building on Csisz\'ar's formulation of mutual $f$-information, we…
We study maximal independent families (m.i.f.) in the projective hierarchy. We show that (a) the existence of a $\boldsymbol{\Sigma}^1_2$ m.i.f. is equivalent to the existence of a $\boldsymbol{\Pi}^1_1$ m.i.f., (b) in the Cohen model,…
In this paper, we demonstrate that if, for every $\kappa$-complete fine filter $F$ over $\mathcal{P}_{\kappa}\lambda$, the associated Namba forcing $\mathrm{Nm}(\kappa,\lambda,F)$ is semiproper, then $\square(\mu,{<}\aleph_1)$ fails for all…
We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
If $f$ is a symmetric complex-valued function on the $m$-fold Cartesian product of the set of non-negative reals and $A$ is a positive semi-definite $m\times m$ matrix with eigenvalues $\lambda_j$, we set…
We prove that for every tower $\mathcal T$ there are $\aleph_1$-dense $A$ and $B$ so that any ``reasonable" forcing notion $\mathbb{P}$ -- an adjective that includes all known ones -- for making $A$ and $B$ isomorphic will add a…
We study a strengthening of Bounded Martin's Maximum which asserts that if a \Sigma_1 fact holds of \omega_2^V in a stationary set preserving extension then it holds in V for a stationary set of ordinals less than \omega_2. We show that…
We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…
This paper tackles the problem of formulating and proving the completeness of focused-like proof systems in an automated fashion. Focusing is a discipline on proofs which structures them into phases in order to reduce proof search…
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…
Let mu be singular of uncountable cofinality. If mu>2^{cf(mu)}, we prove that in P=([mu]^mu,supseteq) as a forcing notion we have a natural complete embedding of Levy(aleph_0, mu^+) (so P collapses mu^+ to aleph_0) and even Levy(aleph_0,…
This paper presents two types of results related to hyperarithmetic analysis. First, we introduce new variants of the dependent choice axiom, namely $\mathrm{unique}~\Pi^1_0(\mathrm{resp.}~\Sigma^1_1)\text{-}\mathsf{DC}_0$ and…
The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…