scientific article; zbMATH DE number 1356031

MaRDI QIDQ4700239zbMATH OpenFDO

Authors Teresa Bigorajska, Henryk Kotlarski

Publication date 30 January 2000

Full work available at URL https://eudml.org/doc/212379

zbMATH Keywords

Hardy hierarchylargenesspartition

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Recursive ordinals and ordinal notations (03F15) Partitions of sets (05A18)

Recommendations

• Partitioning 𝛼–large sets: Some lower bounds
• On a question of Andreas Weiermann
• Some combinatorics involving ξ-large sets
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
• More on lower bounds for partitioning \(\alpha\)-large sets

Cited in

(12)

• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• A note on Hindman-type theorems for uncountable cardinals
• A partition theorem of \(\omega^{\omega^{\alpha}}\)
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
• More on lower bounds for partitioning \(\alpha\)-large sets
• On partitions of Ellentuck-large sets
• Partitioning 𝛼–large sets: Some lower bounds
• On a question of Andreas Weiermann
• Partitions into thin sets and forgotten theorems of Kunugi and Luzin–Novikov
• Some combinatorics involving ξ-large sets
• Partition regular structures contained in large sets are abundant
• The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700239)