Infinite exponent partition relations and well-ordered choice

DOI10.2307/2272066zbMath0274.04004OpenAlexW2114195278MaRDI QIDQ5181372

Joel I. Seiferas, Eugene M. Kleinberg

Publication date: 1973

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272066

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Large cardinals (03E55) Other combinatorial set theory (03E05) Set theory (03E99)

Related Items (10)

Infinite subscripts from infinite exponents ⋮ Spector forcing ⋮ Weak partition relations and measurability ⋮ Techniques for separating space complexity classes ⋮ Relating refined space complexity classes ⋮ The polynomial-time hierarchy ⋮ Some consequences of an infinite-exponent partition relation ⋮ Complete sets and the polynomial-time hierarchy ⋮ \(\gamma\)-Ramsey and \(\gamma\)-ineffable cardinals ⋮ A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes

This page was built for publication: Infinite exponent partition relations and well-ordered choice