arXiv math/98011511998-01-15math.LO

The distributivity numbers of finite products of P(omega) /fin

Saharon Shelah, Otmar Spinas

发表信息：: Fund. Math. 158 No. 1 (1998) 81--93

英文摘要：

Generalizing [ShSi:494], for every n< omega we construct a ZFC-model where the distributivity number of r.o. (P(omega)/fin)^{n+1}, h(n+1), is smaller than the one of r.o.(P(omega)/fin)^{n}. This answers an old problem of Balcar, Pelant and Simon. We also show that Laver and Miller forcing collapse the continuum to h(n) for every n<omega, hence by the first result, consistently they collapse it below h(n)

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The distributivity numbers of of P(om) /fin and its square

We show that in a model obtained by forcing with a countable support iteration of length omega_2 of Mathias forcing h(2), the distributivity number of r.o.(P(omega)/fin)^2, is omega_1 but h, the one of P(omega)/fin, is omega_2.

1996-06-15math.LO

On the bounding, splitting, and distributivity numbers

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (ω)$ are known to satisfy that $ω_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also introduce a new upper bound for $\mathfrak h$ and show that it can be less than $\mathfrak s$. The key method is to utilize finite support matrix iterations of ccc posets following \cite{BlassShelah}.

2022-02-01math.COmath.LO

Forcing With Copies of Countable Ordinals

Let αbe a countable ordinal and ¶(α) the collection of its subsets isomorphic to α. We show that the separative quotient of the set ¶(α) ordered by the inclusion is isomorphic to a forcing product of iterated reduced products of Boolean algebras of the form P(ω^γ)/I(ω^γ), where γis a limit ordinal or 1 and I(ω^γ) the corresponding ordinal ideal. Moreover, the poset ¶(α) is forcing equivalent to a two-step iteration P(ω)/Fin * π, where πis an ω_1-closed separative pre-order in each extension by P(ω)/Fin and, if the distributivity number is equal toω_1, to P(ω)/Fin. Also we analyze the quotients…

2013-04-29math.LO

Games on base matrices

Using a game characterization of distributivity, we show that base matrices for $\mathcal{P}(ω)/\text{fin}$ of regular height larger than $\mathfrak{h}$ necessarily have maximal branches which are not cofinal.

2022-03-04math.LO

Forcing Square_{omega_1} with finite conditions

We give a forcing construction of the square principle on omega_1 using forcing with conditions whose domain is finite.

2010-10-02math.LO

Forcing countable networks for spaces satisfying R(X^omega)=omega.

We show that all finite powers of a Hausdorff space X do not contain uncountable weakly separated subspaces iff there is a c.c.c poset P such that 1_P forces that ``X is a countable union of 0-dimensional subspaces of countable weight.'' We also show that this theorem is sharp in two different senses: (i) we can't get rid of using generic extensions, (ii) we have to consider all finite powers of $X$.

1995-03-20math.LO

更多相关论文收起更多论文

Coloring finite subsets of uncountable sets

It is consistent for every (1 <= n< omega) that (2^omega = omega_n) and there is a function (F:[omega_n]^{< omega}-> omega) such that every finite set can be written at most (2^n-1) ways as the union of two distinct monocolored sets. If GCH holds, for every such coloring there is a finite set that can be written at least (sum^n_{i=1}{n+i choose n}{n choose i}) ways as the union of two sets with the same color.

1995-05-15math.LO

Intersection properties of open sets, II.

A topological space is called P_2 ( P_3, P_{<omega} ) if and only if it does not contain two (three, finitely many) uncountable open sets with empty intersection. We show that (i) there are 0-dimensional P_{<omega} spaces of size 2^omega, (ii) there are compact P_{<omega} spaces of size omega_1, (iii) the existence of a Psi-like examples for a compact P_{<omega} space of size omega_1 is independent of ZFC, (iv) it is consistent that 2^omega is as large as you wish but every first countable (and so every compact) P_2 space has cardinality<=omega_1.

1996-05-06math.LO

Smooth graphs

A graph G on omega_1 is called <omega-smooth if for each uncountable subset W of omega_1, G is isomorphic to G[W-W'] for some finite W'. We show that in various models of ZFC if a graph G is <omega-smooth then G is necessarily trivial, i.e, either complete or empty. On the other hand, we prove that the existence of a non-trivial, <omega-smooth graph is also consistent with ZFC.

1997-12-01math.LO

Maximal trees

We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with countable levels. Our results answer several questions of Campero, Cancino, Hrusak, and Miranda.

2016-11-24math.LO

Closure Properties of Locally Finite Omega Languages

Locally finite omega languages were introduced by Ressayre in [Journal of Symbolic Logic, Volume 53, No. 4, p.1009-1026]. They generalize omega languages accepted by finite automata or defined by monadic second order sentences. We study here closure properties of the family LOC_omega of locally finite omega languages. In particular we show that the class LOC_omega is neither closed under intersection nor under complementation, giving an answer to a question of Ressayre.

2008-03-12cs.LOmath.LO

有限维的Omega-范畴群与环

Omega-categorical groups and rings of finite dimension

本文证明了有限维Omega-范畴群具有有限-阿贝尔-有限结构，并证明有限维Omega-范畴环是几乎有限-零结构。

2025-11-10math.GRmath.LO

On omega-categorical groups and rings of finite burden

An $ω$-categorical group of finite burden is virtually finite-by-abelian; an $ω$-categorical ring of finite burden is virtually finite-by-null; an $ω$-categorical NTP2 ring is virtually nilpotent.

2018-11-21math.GRmath.LO

Some partition properties for measurable colourings of omega-one^2

We construct a measure on omega-one^2 over the ground model in the forcing extension of a measure algebra, and investigate when measure theoretic properties of some measurable colouring of omega-one^2 imply the existence of an uncountable subset of omega-one whose square is homogeneous. This gives a new proof of the fact that, under a suitable axiomatic assumption, there are no Souslin (omega-one,omega-one) gaps in the Boolean algebra L^0(nu)/Fin when nu is a separable measure.

2005-01-24math.CAmath.LO

Omega-范畴伪有限群

Omega-categorical pseudofinite groups

探讨omega-范畴性与伪有限性在群中的相互作用，提出omega-范畴伪有限群为有限-阿贝尔-有限的猜想，将其归约到类2幂零p-群，并证明若干已知示例不满足伪有限性。

2024-03-26math.GRmath.LO

Tukey classes of ultrafilters on omega

Motivated by a question of Isbell, we show that Jensen's Diamond Principle implies there is a non-P-point ultrafilter U on omega such that U, whether ordered by reverse inclusion or reverse inclusion mod finite, is not Tukey equivalent to the finite sets of reals ordered by inclusion. We also show that, for every regular infinite kappa not greater than 2^{aleph_0}, if MA_{sigma-centered} holds, then some ultrafilter U on omega, ordered by reverse inclusion mod finite, is Tukey equivalent to the sets of reals of size less than kappa, ordered by inclusion. We also prove two negative ZFC results …

2008-07-25math.GNmath.LO

Omega-powers and descriptive set theory

We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is finite is studied and gives a natural example of a set at the level omega of the Wadge hierarchy.

2007-09-30math.GNmath.LO

On Omega Context Free Languages which are Borel Sets of Infinite Rank

This paper is a continuation of the study of topological properties of omega context free languages (omega-CFL). We proved before that the class of omega-CFL exhausts the hierarchy of Borel sets of finite rank, and that there exist some omega-CFL which are analytic but non Borel sets. We prove here that there exist some omega context free languages which are Borel sets of infinite (but not finite) rank, giving additional answer to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:"A Decade of Concurrency", Springer LNCS 803 (1994), 583-621].

2010-05-31cs.LOmath.LO

NIP omega-categorical structures: the rank 1 case

We classify primitive, rank 1, omega-categorical structures having polynomially many types over finite sets. For a fixed number of 4-types, we show that there are only finitely many such structures and that all are built out of finitely many linear orders interacting in a restricted number of ways. As an example of application, we deduce the classification of primitive structures homogeneous in a language consisting of n linear orders as well as all reducts of such structures.

2022-07-30math.COmath.LO

On omega-categorical structures with few finite substructures

We establish new results on the possible growth rates for the sequence (f_n) counting the number of orbits of a given oligomorphic group on unordered sets of size n. Macpherson showed that for primitive actions, the growth is at least exponential (if the sequence is not constant equal to 1). The best lower bound previously known for the base of the exponential was obtained by Merola. We establishing the optimal value of 2 in the case where the structure is unstable. This allows us to improve on Merola's bound and also obtain the optimal value for structures homogeneous in a finite relational l…

2018-10-15math.COmath.LO