Large Finite Sets

DOI10.1002/MALQ.19850313502MaRDI QIDQ3727991zbMATH OpenOpenAlexFDO

Authors Herman Ruge Jervell

Publication date 1985

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19850313502

zbMATH Keywords

homogeneous treeordinal notationpartitionRamsey theoryrecursion over trees

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Combinatorial aspects of partitions of integers (05A17)

Recommendations

• Some combinatorics involving ξ-large sets
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
• Abstract approach to Ramsey theory and Ramsey theorems for finite trees
• The strength of Ramsey's theorem for coloring relatively large sets
• An analysis of Ramsey's theorem

Cited in

(11)

• Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\)
• Semiregular large sets
• Large sets avoiding patterns
• scientific article; zbMATH DE number 3871700 (Why is no real title available?)
• Large Intersections of Large Sets
• Big Sets
• Some combinatorics involving ξ-large sets
• 1994 Annual Meeting of the Association for Symbolic Logic
• Abstract approach to Ramsey theory and Ramsey theorems for finite trees
• Large sets without Fourier restriction theorems
• Large sets avoiding Infinite arithmetic / geometric progressions

This page was built for publication: Large Finite Sets

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