Coloring infinite graphs and the Boolean prime ideal theorem

  title={Coloring infinite graphs and the Boolean prime ideal theorem},
  author={H. L{\"a}uchli},
  journal={Israel Journal of Mathematics},
  • H. Läuchli
  • Published 1971
  • Mathematics
  • Israel Journal of Mathematics
It is shown that the following theorem holds in set theory without AC: There is a functionG which assigns to each Boolean algebraB a graphG(B) such that (1) ifG(B) is 3-colorable then there is a prime ideal inB and (2) every finite subgraph ofG(B) is 3-colorable. The proof uses a combinatorial lemma on finite graphs. 
A Compactness Theorem for Infinite Constraint Satisfaction
  • R. Cowen
  • Mathematics, Computer Science
  • Reports Math. Log.
  • 1998
Generalizing König's infinity lemma
Some Connections Between Set Theory and Computer Science
  • R. Cowen
  • Computer Science
  • Kurt Gödel Colloquium
  • 1993
The Axiom of Choice
Forms of Choice