Axiomatic Treatment of Rank in Infinite Sets
From MaRDI portal
Publication:5789532
Cited in
(44)- Independent transversals for countable set systems
- A Topological-algebraic Approach to the Compactness Theorem of Classical Logic
- Some Combinatorial Theorems Equivalent to the Prime Ideal Theorem
- Systems of representatives
- On Theorems of Tychonoff, Alexander, and R. Rado
- Whitney's theorem for infinite graphs
- Some inequalities for partial orders
- Infinite Matroids
- Tensor algebras over discrete spaces
- Some results on transversals of families of subsets
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
- Submodular functions and independence structures
- Π01-classes and Rado's selection principle
- Canonical edge-colourings of locally finite graphs
- Characterizations of finitary and cofinitary binary matroids
- Finitely many implies infinitely many
- Variations of Rado's lemma
- Some consequences of Rado's selection lemma
- The combinatorics of N. G. de Bruijn
- Comments on bases in dependence structures
- A theorem of the transversal theory for matroids of finite character
- On the structures induced by bipartite graphs and infinite matroids
- Variants of RADO'S Selection Lemma and their Applications
- Short Proof of a Theorem of Rado on Graphs
- Regularity and Positional Games
- Proofs of the compactness theorem
- A proof of Dilworth's decomposition theorem for partially ordered sets
- Reflections on graph theory
- A selection lemma
- A note on uncountable chordal graphs
- scientific article; zbMATH DE number 3375554 (Why is no real title available?)
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
- On a variant of Rado's selection lemma and its equivalence with the Boolean prime ideal theorem
- Lifting proofs from countable to uncountable mathematics
- RANK PROPERTIES OF ENDOMORPHISMS OF INFINITE PARTIALLY ORDERED SETS
- On the minimal cover property in \(\mathbf{ZF}\)
- Applications of Menger's graph theorem
- A proof of the linkage theorem
- Unfriendly partitions of a graph
- Topological representation of double Boolean algebras
- Well ordering groups with no monotone arithmetic progressions
- Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem
- Grassmann-Plücker relations and matroids with coefficients
- Properties of finite character of independence spaces
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)
