scientific article; zbMATH DE number 1356031

zbMATH Open0933.03055MaRDI QIDQ4700239FDOQ4700239

Authors: Teresa Bigorajska, Henryk Kotlarski 

Publication date: 30 January 2000

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

partitionlargenessHardy hierarchy

Mathematics Subject Classification ID

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

Cited In (12)

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

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)