A selection lemma

DOI10.1016/0097-3165(71)90021-5zbMath0227.04002OpenAlexW2038447833WikidataQ125016549 ScholiaQ125016549MaRDI QIDQ2549321

No author found.

Publication date: 1971

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(71)90021-5

Mathematics Subject Classification ID

Axiom of choice and related propositions (03E25)

Related Items (7)

Π₀¹-classes and Rado's selection principle ⋮ Canonical edge-colourings of locally finite graphs ⋮ A minimax theorem for infinite graphs with ideal points ⋮ A set intersection problem ⋮ The cardinal module and some theorems on families of sets ⋮ A short proof of Rado's lemma ⋮ Some Combinatorial Theorems Equivalent to the Prime Ideal Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Short Proof of a Theorem of Rado on Graphs
• On Theorems of Tychonoff, Alexander, and R. Rado
• Axiomatic Treatment of Rank in Infinite Sets
• Choice functions and Tychonoff’s theorem

This page was built for publication: A selection lemma