Displaying similar documents to “Fragments of strong compactness, families of partitions and ideal extensions”

A partition property of cardinal numbers

N. H. Williams

Similarity:

CONTENTSIntroduction....................................................................................... 5§ 1. Notation and definitions......................................................... 5§ 2. Negative relations.................................................................... 9§ 3. The Ramification Lemma ..................................................... 10§ 4. The main theorem................................................................... 13§ 5. A result for cardinals...

The tree property at the double successor of a measurable cardinal κ with 2 κ large

Sy-David Friedman, Ajdin Halilović (2013)

Fundamenta Mathematicae

Similarity:

Assuming the existence of a λ⁺-hypermeasurable cardinal κ, where λ is the first weakly compact cardinal above κ, we prove that, in some forcing extension, κ is still measurable, κ⁺⁺ has the tree property and 2 κ = κ . If the assumption is strengthened to the existence of a θ -hypermeasurable cardinal (for an arbitrary cardinal θ > λ of cofinality greater than κ) then the proof can be generalized to get 2 κ = θ .

Partition ideals below ω

P. Dodos, J. Lopez-Abad, S. Todorcevic (2012)

Fundamenta Mathematicae

Similarity:

Motivated by an application to the unconditional basic sequence problem appearing in our previous paper, we introduce analogues of the Laver ideal on ℵ₂ living on index sets of the form [ k ] ω and use this to refine the well-known high-dimensional polarized partition relation for ω of Shelah.

On simple partitions of [ κ ] κ

David Asperó (2003)

Fundamenta Mathematicae

Similarity:

For every uncountable regular cardinal κ, every κ-Borel partition of the space of all members of [ κ ] κ whose enumerating function does not have fixed points has a homogeneous club.

Supercompactness and partial level by level equivalence between strong compactness and strongness

Arthur W. Apter (2004)

Fundamenta Mathematicae

Similarity:

We force and construct a model containing supercompact cardinals in which, for any measurable cardinal δ and any ordinal α below the least beth fixed point above δ, if δ + α is regular, δ is δ + α strongly compact iff δ is δ + α + 1 strong, except possibly if δ is a limit of cardinals γ which are δ + α strongly compact. The choice of the least beth fixed point above δ as our bound on α is arbitrary, and other bounds are possible.

On families of Lindelöf and related subspaces of 2 ω

Lúcia Junqueira, Piotr Koszmider (2001)

Fundamenta Mathematicae

Similarity:

We consider the families of all subspaces of size ω₁ of 2 ω (or of a compact zero-dimensional space X of weight ω₁ in general) which are normal, have the Lindelöf property or are closed under limits of convergent ω₁-sequences. Various relations among these families modulo the club filter in [ X ] ω are shown to be consistently possible. One of the main tools is dealing with a subspace of the form X ∩ M for an elementary submodel M of size ω₁. Various results with this flavor are obtained. Another...

L-like Combinatorial Principles and Level by Level Equivalence

Arthur W. Apter (2009)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We force and construct a model in which GCH and level by level equivalence between strong compactness and supercompactness hold, along with certain additional “L-like” combinatorial principles. In particular, this model satisfies the following properties: (1) δ holds for every successor and Mahlo cardinal δ. (2) There is a stationary subset S of the least supercompact cardinal κ₀ such that for every δ ∈ S, δ holds and δ carries a gap 1 morass. (3) A weak version of δ holds for every...

The tree property at both ω + 1 and ω + 2

Laura Fontanella, Sy David Friedman (2015)

Fundamenta Mathematicae

Similarity:

We force from large cardinals a model of ZFC in which ω + 1 and ω + 2 both have the tree property. We also prove that if we strengthen the large cardinal assumptions, then in the final model ω + 2 even satisfies the super tree property.

Open and solved problems concerning polarized partition relations

Shimon Garti, Saharon Shelah (2016)

Fundamenta Mathematicae

Similarity:

We list some open problems concerning the polarized partition relation. We solve a couple of them, by showing that for every limit non-inaccessible ordinal α there exists a forcing notion ℙ such that the strong polarized relation α + 1 α α + 1 α 2 1 , 1 holds in V .

A partition of the Catalan numbers and enumeration of genealogical trees

Rainer Schimming (1996)

Discussiones Mathematicae Graph Theory

Similarity:

A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers C n , k of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the C n , k form a partition of the n-th Catalan numer Cₙ, that means C n , 1 + C n , 2 + . . . + C n , n = C .

Supercompactness and failures of GCH

Sy-David Friedman, Radek Honzik (2012)

Fundamenta Mathematicae

Similarity:

Let κ < λ be regular cardinals. We say that an embedding j: V → M with critical point κ is λ-tall if λ < j(κ) and M is closed under κ-sequences in V. Silver showed that GCH can fail at a measurable cardinal κ, starting with κ being κ⁺⁺-supercompact. Later, Woodin improved this result, starting from the optimal hypothesis of a κ⁺⁺-tall measurable cardinal κ. Now more generally, suppose that κ ≤ λ are regular and one wishes the GCH to fail at λ with κ being λ-supercompact. Silver’s...

Embedding orders into the cardinals with D C κ

Asaf Karagila (2014)

Fundamenta Mathematicae

Similarity:

Jech proved that every partially ordered set can be embedded into the cardinals of some model of ZF. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of Z F + D C < κ for any regular κ. We use this theorem to show that for all κ, the assumption of D C κ does not entail that there are no decreasing chains of cardinals. We also show how to extend the result to and embed into the cardinals a proper class which is definable over the ground model....

Some Parity Statistics in Integer Partitions

Aubrey Blecher, Toufik Mansour, Augustine O. Munagi (2015)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We study integer partitions with respect to the classical word statistics of levels and descents subject to prescribed parity conditions. For instance, a partition with summands λ λ k may be enumerated according to descents λ i > λ i + 1 while tracking the individual parities of λ i and λ i + 1 . There are two types of parity levels, E = E and O = O, and four types of parity-descents, E > E, E > O, O > E and O > O, where E and O represent arbitrary even and odd summands. We obtain functional equations...

Iterating along a Prikry sequence

Spencer Unger (2016)

Fundamenta Mathematicae

Similarity:

We introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from large cardinals that it is consistent that the tree property holds at ℵₙ for n ≥ 2, ω is strong limit and 2 ω = ω + 2 .

Initially κ -compact spaces for large κ

Stavros Christodoulou (1999)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

This work presents some cardinal inequalities in which appears the closed pseudo-character, ψ c , of a space. Using one of them — ψ c ( X ) 2 d ( X ) for T 2 spaces — we improve, from T 3 to T 2 spaces, the well-known result that initially κ -compact T 3 spaces are λ -bounded for all cardinals λ such that 2 λ κ . And then, using an idea of A. Dow, we prove that initially κ -compact T 2 spaces are in fact compact for κ = 2 F ( X ) , 2 s ( X ) , 2 t ( X ) , 2 χ ( X ) , 2 ψ c ( X ) or κ = max { τ + , τ < τ } , where τ > t ( p , X ) for all p X .

The number of L κ -equivalent nonisomorphic models for κ weakly compact

Saharon Shelah, Pauli Vaisanen (2002)

Fundamenta Mathematicae

Similarity:

For a cardinal κ and a model M of cardinality κ let No(M) denote the number of nonisomorphic models of cardinality κ which are L , κ -equivalent to M. We prove that for κ a weakly compact cardinal, the question of the possible values of No(M) for models M of cardinality κ is equivalent to the question of the possible numbers of equivalence classes of equivalence relations which are Σ¹₁-definable over V κ . By [SV] it is possible to have a generic extension where the possible numbers of equivalence...

Uncountable cardinals have the same monadic ∀₁¹ positive theory over large sets

Athanassios Tzouvaras (2004)

Fundamenta Mathematicae

Similarity:

We show that uncountable cardinals are indistinguishable by sentences of the monadic second-order language of order of the form (∀X)ϕ(X) and (∃X)ϕ(X), for ϕ positive in X and containing no set-quantifiers, when the set variables range over large (= cofinal) subsets of the cardinals. This strengthens the result of Doner-Mostowski-Tarski [3] that (κ,∈), (λ,∈) are elementarily equivalent when κ, λ are uncountable. It follows that we can consistently postulate that the structures ( 2 κ , [ 2 κ ] > κ , < ) , ( 2 λ , [ 2 λ ] > λ , < ) are...

Interpolation of κ -compactness and PCF

István Juhász, Zoltán Szentmiklóssy (2009)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We call a topological space κ -compact if every subset of size κ has a complete accumulation point in it. Let Φ ( μ , κ , λ ) denote the following statement: μ < κ < λ = cf ( λ ) and there is { S ξ : ξ < λ } [ κ ] μ such that | { ξ : | S ξ A | = μ } | < λ whenever A [ κ ] < κ . We show that if Φ ( μ , κ , λ ) holds and the space X is both μ -compact and λ -compact then X is κ -compact as well. Moreover, from PCF theory we deduce Φ ( cf ( κ ) , κ , κ + ) for every singular cardinal κ . As a corollary we get that a linearly Lindelöf and ω -compact space is uncountably compact, that is κ -compact for all uncountable cardinals...