相关论文: Hechler's theorem for the null ideal

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 describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a Boolean-valued soundness theorem. As an…

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 prove the central limit theorem (CLT) for a sequence of independent zero-mean random variables $\xi_j$, perturbed by predictable multiplicative factors $\lambda_j$ with values in intervals $[\underline\lambda_j,\overline\lambda_j]$. It…

We prove that the reduced cross-sectional algebra of a Fell bundle with the approximation property over an inverse semigroup is exact if and only if the unit fiber of the Fell bundle is exact. This generalizes a recent result of the…

We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC) - a system of higher-order logic modulo theories - and prove its soundness and refutational completeness w.r.t. the standard semantics. As…

Using creature technology, we construct families of Suslin ccc non-sweet forcing notions $\mathbb Q$ such that $ZFC$ is equiconsistent with $ZF+$"every set of reals equals a Borel set modulo the $(\leq \aleph_1)$-closure of the null ideal…

We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $\lambda$-complete $\mu^+$-c.c. forcing notions. We also show some versions are really stronger than…

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…

Given a dense additive subgroup $G$ of $\mathbb R$ containing $\mathbb Z$, we consider its intersection $\mathbb G$ with the interval $[0,1[$ with the induced order and the group structure given by addition modulo $1$. We axiomatize the…

We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

We prove the Central Limit Theorem (CLT), the first order Edgeworth Expansion and a Mixing Local Central Limit Theorem (MLCLT) for Birkhoff sums of a class of unbounded heavily oscillating observables over a family of full-branch piecewise…

In this paper we are concerned with a long-standing conjecture of Huneke and Wiegand. We introduce a new class of ideals and prove thateach ideal from such class satisfies the conclusion of the conjecture in question. We also study the…

This paper continues the investigation of quasilength, of content of local cohomology with respect to generators of the support ideal, and of robust algebras begun in joint work of Hochster and Huneke. We settle several questions raised by…

In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

Let $d_1,...,d_r$ be positive integers and let $I = (F_1,...,F_r)$ be an ideal generated by general forms of degrees $d_1,...,d_r$, respectively, in a polynomial ring $R$ with $n$ variables. When all the degrees are the same we give a…

This paper explores the connection between two central results in the proof theory of classical logic: Gentzen's cut-elimination for the sequent calculus and Herbrands "fundamental theorem". Starting from Miller's expansion-tree-proofs, a…

Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…