中文
相关论文

相关论文: Ideal Independence, Free Sequences, and the Ultraf…

200 篇论文

We study the interplay between properties of measures on a Boolean algebra A and forcing names for ultrafilters on A. We show that several well known measure theoretic properties of Boolean algebras (such as supporting a strictly positive…

逻辑 · 数学 2021-05-13 Piotr Borodulin-Nadzieja , Katarzyna Cegiełka

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

逻辑 · 数学 2014-02-10 Matteo Viale , Giorgio Audrito , Silvia Steila

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

逻辑 · 数学 2016-09-06 Garvin Melles

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

逻辑 · 数学 2025-03-07 Francesco Parente , Matteo Viale

For suitable groups G we will show that one can add a Boolean algebra B by forcing in such a way that Aut(B) is almost isomorphic to G. In particular, we will give a positive answer to the following question due to J.Roitman: Is…

逻辑 · 数学 2007-05-23 Tapani Hyttinen , Saharon Shelah

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

逻辑 · 数学 2023-06-22 Natasha Dobrinen , Daniel Hathaway

We construct pairs of algebras with mixed independence relations by using truncations of reduced free products of algebras. For example, we construct free-Boolean pairs of algebras and free-monotone pairs of algebras. We also introduce…

算子代数 · 数学 2017-11-27 Weihua Liu

In \cite{BH20} an elegant choice-free construction of a canonical extension of a boolean algebra $B$ was given as the boolean algebra of regular open subsets of the Alexandroff topology on the poset of proper filters of $B$. We make this…

环与代数 · 数学 2021-05-20 G. Bezhanishvili , L. Carai , P. Morandi

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

逻辑 · 数学 2015-03-17 Juan Carlos Martinez , Lajos Soukup

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

交换代数 · 数学 2017-07-28 Danny A. J. Gomez-Ramirez , Holger Brenner

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

逻辑 · 数学 2017-09-26 Milos Kurilic

We address several questions of Donald Monk related to irredundance and spread of Boolean algebras, gaining both some ZFC knowledge and consistency results. We show in ZFC that irr(B_0 times B_1)= max(irr(B_0),irr(B_1)). We prove…

逻辑 · 数学 2013-01-03 Andrzej Roslanowski , Saharon Shelah

We address a number of problems on Boolean Algebras. For example, we construct, in ZFC, for any BA B, and cardinal kappa BAs B_1,B_2 extending B such that the depth of the free product of B_1,B_2 over B is strictly larger than the depths of…

逻辑 · 数学 2016-09-06 Saharon Shelah

We give a definition of some classes of boolean algebras generalizing free boolean algebras; they satisfy a universal property that certain functions extend to homomorphisms. We give a combinatorial property of generating sets of these…

逻辑 · 数学 2008-11-18 Corey Thomas Bruns

We analyse the Boolean-valued random forcing $B_{M,\Omega}$ in bounded arithmetics developed in Krajicek (Forcing with random variables and proof complexity, vol. 382, Cambridge University Press, 2011) from the perspective of the forcing in…

逻辑 · 数学 2026-03-12 Radek Honzik

The original theme of the paper is the existence proof of ``there is < eta_alpha : alpha < lambda > which is a (lambda,J)-sequence for < I_i:i<delta >, a sequence of ideals. This can be thought of as in a generalization to Luzin sets and…

逻辑 · 数学 2016-09-07 Saharon Shelah

Strong algebraic proof systems such as IPS (Ideal Proof System; Grochow-Pitassi [GP18]) offer a general model for deriving polynomials in an ideal and refuting unsatisfiable propositional formulas, subsuming most standard propositional…

计算复杂性 · 计算机科学 2024-12-31 Tuomas Hakoniemi , Nutan Limaye , Iddo Tzameret

In this article, we conduct a detailed study of \emph{finitely additive measures} (fams) in the context of Boolean algebras, focusing on three specific topics: freeness and approximation, existence and extension criteria, and integration…

We give a definition of some classes of boolean algebras generalizing free boolean algebras; they satisfy a universal property that certain functions extend to homomorphisms. We give a combinatorial property of generating sets of these…

逻辑 · 数学 2011-10-04 Corey Thomas Bruns

We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…

逻辑 · 数学 2023-07-06 M. Malliaris , S. Shelah
‹ 上一页 1 2 3 10 下一页 ›