Boolean Prime Ideal Theorem
The Boolean Prime Ideal Theorem is a foundational principle in order theory and mathematical logic, asserting that every Boolean algebra contains a prime ideal, serving as a weaker form of the Axiom of Choice that is equivalent to the Ultrafilter Lemma.
15
Publications
1.8K
Citations
17
Authors
15
Institutions
Publications per year
2017–2026
1
Variants
Prime Ideal Theorem
Parents
15
J. D. Halpern, H. Läuchli · Transactions of the American Mathematical Society · 1966 · 106 citations · Full text
Natural Sciences, Mathematics, Logic +11
1–5 of 15
17
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 17
15
Eastern Michigan University
Ypsilanti, United States
2 h-index
2 publications
28 citations

University of Amsterdam
Amsterdam, The Netherlands
1 h-index
1 publications
21 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
2 publications
20 citations
University of Bern
Bern, Switzerland
1 h-index
1 publications
12 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
21 citations
Institute of Applied Physics
Chisinau, Moldova
1 h-index
1 publications
12 citations
Laboratoire de Mathématiques Blaise Pascal
Aubière, France
1 h-index
1 publications
23 citations

University of the Aegean
Mytilene, Greece
1 h-index
1 publications
18 citations
1–8 of 15
TRAN · 3 publications · 1.6K citations
3
h-index
3 publications · 49 citations
3
h-index
2 publications · 106 citations
2
h-index
1 publications · 17 citations
1
h-index
1 publications · 18 citations
1
h-index
1–5