Coloring infinite graphs and the Boolean prime ideal theorem
From MaRDI portal
Publication:2560403
DOI10.1007/BF02771458zbMath0261.04002OpenAlexW2026052060WikidataQ56225314 ScholiaQ56225314MaRDI QIDQ2560403
Publication date: 1971
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02771458
Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05) Structure theory of Boolean algebras (06E05)
Related Items
Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC ⋮ Forms of choice in ring theory ⋮ Borsuk's partition problem and finite point sets ⋮ Amorphe Potenzen kompakter Räume ⋮ Logical compactness and constraint satisfaction problems
Cites Work
- Some remarks and problems on the colouring of infinite graphs and the theorem of Kuratowski
- The independence of the axiom of choice from the Boolean prime ideal theorem
- Correction to my paper on the colouring of infinite graphs and the theorem of Kuratowski
- Remarks on a paper by J. Mycielski
- Axiom of choice for finite sets
- Unnamed Item
- Unnamed Item