Axiomatic Treatment of Rank in Infinite Sets
From MaRDI portal
Publication:5789532
DOI10.4153/CJM-1949-031-1zbMATH Open0033.25302WikidataQ60680284 ScholiaQ60680284MaRDI QIDQ5789532FDOQ5789532
Authors: Richard Rado 
Publication date: 1949
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Cited In (44)
- Variations of Rado's lemma
- A theorem of the transversal theory for matroids of finite character
- On the structures induced by bipartite graphs and infinite matroids
- Properties of finite character of independence spaces
- Proofs of the compactness theorem
- Some results on transversals of families of subsets
- Reflections on graph theory
- Grassmann-Plücker relations and matroids with coefficients
- On the minimal cover property in \(\mathbf{ZF}\)
- Some inequalities for partial orders
- Short Proof of a Theorem of Rado on Graphs
- Π01-classes and Rado's selection principle
- The combinatorics of N. G. de Bruijn
- Finitely many implies infinitely many
- Infinite Matroids
- Variants of RADO'S Selection Lemma and their Applications
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
- RANK PROPERTIES OF ENDOMORPHISMS OF INFINITE PARTIALLY ORDERED SETS
- Comments on bases in dependence structures
- Unfriendly partitions of a graph
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
- Systems of representatives
- Submodular functions and independence structures
- On a variant of Rado's selection lemma and its equivalence with the Boolean prime ideal theorem
- Lifting proofs from countable to uncountable mathematics
- On Theorems of Tychonoff, Alexander, and R. Rado
- A proof of Dilworth's decomposition theorem for partially ordered sets
- Well ordering groups with no monotone arithmetic progressions
- Applications of Menger's graph theorem
- A proof of the linkage theorem
- Topological representation of double Boolean algebras
- Whitney's theorem for infinite graphs
- Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem
- Tensor algebras over discrete spaces
- Characterizations of finitary and cofinitary binary matroids
- Regularity and Positional Games
- A selection lemma
- Independent transversals for countable set systems
- Some Combinatorial Theorems Equivalent to the Prime Ideal Theorem
- A note on uncountable chordal graphs
- Title not available (Why is that?)
- Canonical edge-colourings of locally finite graphs
- A Topological-algebraic Approach to the Compactness Theorem of Classical Logic
- Some consequences of Rado's selection lemma
This page was built for publication: Axiomatic Treatment of Rank in Infinite Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5789532)
