Coloring infinite graphs and the Boolean prime ideal theorem

DOI10.1007/BF02771458zbMATH Open0261.04002OpenAlexW2026052060WikidataQ56225314 ScholiaQ56225314MaRDI QIDQ2560403FDOQ2560403

Authors: Hans Läuchli 

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05) Structure theory of Boolean algebras (06E05)

Cites Work

• The independence of the axiom of choice from the Boolean prime ideal theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Axiom of choice for finite sets
• Remarks on a paper by J. Mycielski
• Some remarks and problems on the colouring of infinite graphs and the theorem of Kuratowski
• Correction to my paper on the colouring of infinite graphs and the theorem of Kuratowski

Cited In (5)

• Forms of choice in ring theory
• Amorphe Potenzen kompakter Räume
• Borsuk's partition problem and finite point sets
• Logical compactness and constraint satisfaction problems
• Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC

This page was built for publication: Coloring infinite graphs and the Boolean prime ideal theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560403)