A selection lemma

DOI10.1016/0097-3165(71)90021-5zbMATH Open0227.04002OpenAlexW2038447833WikidataQ125016549 ScholiaQ125016549MaRDI QIDQ2549321FDOQ2549321

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Theorems of Tychonoff, Alexander, and R. Rado
• Axiomatic Treatment of Rank in Infinite Sets
• Choice functions and Tychonoff’s theorem
• 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)