Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/9911228

On versions of clubsuit on cardinals larger than aleph_1

Mirna Džamonja·Saharon Shelah
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to the situation of lambda a singular strong limit with 2^lambda>lambda^+. The first result shows that in ZFC there is a guessing of unbounded subsets of S^{lambda^+}_lambda. The second result is a consistency result (assuming a supercompact cardinal exists) showing that a natural guessing fails. A result of Shelah in math.LO/9808140 shows that if 2^lambda=lambda^+ and lambda is a strong limit singular, then the corresponding guessing holds. Both results are also connected to an earlier result of Dzamonja and Shelah in which they showed that a certain version of clubsuit holds at a successor of singular just in ZFC. The first result here shows that a result of math.LO/9601219 can to a certain extent be extended to the successor of a regular. The negative result here gives limitations to the extent to which one can hope to extend this result.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mirna Džamonja, Saharon Shelah. 1999-11-28. On versions of clubsuit on cardinals larger than aleph_1. https://arxiv.org/abs/math/9911228

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO↗
arXiv2026

Symmetric Iterations with Countable and $<κ$-Support: A Framework for Choiceless ZF Extensions

This replacement corrects the earlier manuscript. Its claimed general countable- and $<κ$-support iteration framework does not establish the advertised preservation or application theorems. The proposed limit filters can be improper; the dependent-choice arguments pass incorrectly from ground-model sequences of hereditarily symmetric names to arbitrary sequences in a generic extension; the class-length union argument does not verify Separation, Replacement, or Power Set; the Partition Principle argument uses an invalid same-generic compatibility inference; and the singular-support fusion argument assumes that a coherent inverse-limit family is a condition even when its support may have size $κ$. Accordingly, the main preservation, construction, class-length, dependent-choice, Partition Principle, and singular-cardinal claims are withdrawn. We retain only several conditional algebraic observations: pullback and completion operations on subgroup filters, closure of ground-model families of hereditarily symmetric names under canonical tupling, the standard ZF theorem for a genuine symmetric system, and ordinary conditional tail-closure facts. The remainder is preserved as a historical record of the superseded approach and is not asserted.

math.LO↗
arXiv2026

Reducing stable forking dependence to finitely many pregeometries

We show that one of the main cases of the stable forking conjecture, stability of the forking relation over a base in a finite-rank supersimple theory, is determined by finitely many pregeometries in each rank. This case of the stable forking conjecture has long had an implicitly well-known pregeometric interpretation: there is a set of matroids $\mathcal{G}_{n}$ such that the forking instability in rank $n$ is equivalent to the pregeometry on some rank-one partial type (over a finite set) embedding a matroid in $\mathcal{G}_{n}$. Our contribution is to show that this set of matroids $\mathcal{G}_{n}$, determining based forking stability in rank $n$, can be chosen to be finite. The main part of our proof was already accomplished in rank $3$ by Peretz, but does not extend as stated to higher ranks (and may or may not directly extend in a weaker sense to higher ranks, by shrinking terms). However, we obtain a sufficient substitute for Peretz's work in ranks $n > 3$: we turn Peretz's original universal result into an existence theorem. The rest of our proof refines an argument from multi-experiment parameter definability, originating from work in applied model theory by Li, Meshkat, Ovchinnikov, Pillay, Pogudin and Scanlon.

math.LO↗