English
Related papers

Related papers: A note on ccc forcings

200 papers

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 null ideal of the…

Logic · Mathematics 2007-05-23 Maxim R. Burke , Masaru Kada

System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…

Logic in Computer Science · Computer Science 2023-09-19 Alejandro Díaz-Caro , Gilles Dowek

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

We describe a method of building ``nice'' sigma-ideals from Souslin ccc forcing notions. [These notes were written down in 1992, but were not submitted to any journal. In a slightly modified form, they were incorporated to: T. Bartoszynski…

Logic · Mathematics 2007-05-23 Haim Judah , Andrzej Roslanowski

R.D.Mauldin asked if every translation invariant $\sigma$-finite Borel measure on $\RR^d$ is a constant multiple of Lebesgue measure. The aim of this paper is to show that the answer is "yes and no", since surprisingly the answer depends on…

Classical Analysis and ODEs · Mathematics 2011-09-27 Márton Elekes , Tamás Keleti

This paper provides an extensive study of the $\mathscr{I}$-Miller null ideals $M_\mathscr{I}$, $\sigma$-ideals on the Baire space parametrized by ideals $\mathscr{I}$ on countable sets. These $\sigma$-ideals are associated to the idealized…

We show that the set of codes for Ramsey positive analytic sets is $\mathbf{\Sigma}^1_2$-complete. This is a one projective-step higher analogue of the Hurewicz theorem saying that the set of codes for uncountable analytic sets is…

Logic · Mathematics 2010-04-01 Marcin Sabok

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

Logic · Mathematics 2024-08-21 Noah Schweber

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…

Logic · Mathematics 2025-05-28 Haim Horowitz , Saharon Shelah

A $\sigma$-ideal $\mathcal{I}$ on a Polish group $(X,+)$ has Smital Property if for every dense set $D$ and a Borel $\mathcal{I}$-positive set $B$ the algebraic sum $D+B$ is a complement of a set from $\mathcal{I}$. We consider several…

General Topology · Mathematics 2021-12-14 Marcin Michalski , Robert Rałowski , Szymon Żeberski

The aim of this paper is to study the relationship between reduction numbers and Borel-fixed ideals in all characteristics. By definition, Borel-fixed ideals are closed under certain specializations which is similar to the strong stability.…

Commutative Algebra · Mathematics 2007-05-23 Le Tuan Hoa , Ngo Viet Trung

The closed one-sided ideals of a C*-algebra are exactly the closed subspaces supported by the orthogonal complement of a closed projection. Let A be a (not necessarily selfadjoint) subalgebra of a unital C*-algebra B which contains the unit…

Operator Algebras · Mathematics 2007-05-23 Damon M. Hay

Fix a poset $Q$ on $\{x_1,\ldots,x_n\}$. A $Q$-Borel monomial ideal $I \subseteq \mathbb{K}[x_1,\ldots,x_n]$ is a monomial ideal whose monomials are closed under the Borel-like moves induced by $Q$. A monomial ideal $I$ is a principal…

Commutative Algebra · Mathematics 2021-08-17 Eduardo Camps Moreno , Craig Kohne , Eliseo Sarmiento , Adam Van Tuyl

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

Logic · Mathematics 2007-05-23 Michael C. Laskowski , Saharon Shelah

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…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

Let $\mathcal{E}$ be the $\sigma$-ideal generated by the closed measure zero sets of reals. We use an ultrafilter-extendable matrix iteration of ccc posets to force that, for $\mathcal{E}$, their associated cardinal characteristics (i.e.\…

Logic · Mathematics 2022-06-30 Miguel A. Cardona

A $\Sigma$-construction of Solovay is extended to the case of intermediate sets which are not necessarily subsets of the ground model, with a more transparent description of the resulting forcing notion than in the classical paper of…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

In this paper we show that for a given set of pairwise comaximal ideals $\{X_i\}_{i\in I}$ in a ring $R$ with unity and any right $R$-module $M$ with generating set $Y$ and $C(X_i)=\sum\limits_{k\in\mathbb{N}}\underline{\ell}_M(X_i^{k})$,…

Rings and Algebras · Mathematics 2015-08-10 Gary F. Birkenmeier , C. Edward Ryan

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

Logic · Mathematics 2016-09-06 Boban Velickovic , W. Hugh Woodin

Nadkarni's Theorem asserts that for a countable Borel equivalence relation (CBER) exactly one of the following holds: (1) It has an invariant Borel probability measure or (2) it admits a Borel compression, i.e., a Borel injection that maps…

Logic · Mathematics 2023-09-06 Alexander S. Kechris , Michael S. Wolman