A selection lemma

DOI10.1016/0097-3165(71)90021-5MaRDI QIDQ2549321zbMATH OpenOpenAlexWikidataFDO

Authors Richard Rado

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)

Cites work

• scientific article; zbMATH DE number 3286895 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• Axiomatic Treatment of Rank in Infinite Sets
• Choice functions and Tychonoff’s theorem
• On Theorems of Tychonoff, Alexander, and R. Rado
• Short Proof of a Theorem of Rado on Graphs

Cited in

(7)

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

This page was built for publication: A selection lemma

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