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