Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem
From MaRDI portal
Publication:1778064
DOI10.1007/s00153-004-0264-9zbMath1105.03042OpenAlexW2041987105MaRDI QIDQ1778064
Publication date: 26 May 2005
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-004-0264-9
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalents of the axiom of choice. 2nd ed
- Minimally generated Boolean algebras
- A short proof of Rado's lemma
- Eine Konstruktion von Modellerweiterungen
- The Power of the Ultrafilter Theorem
- Prime ideals yield almost maximal ideals
- Variants of RADO'S Selection Lemma and their Applications
- Some Combinatorial Theorems Equivalent to the Prime Ideal Theorem
- Some applications of the notions of forcing and generic sets
- On Theorems of Tychonoff, Alexander, and R. Rado
- The Theory of Representation for Boolean Algebras
- Ordered Sets, Complexes and the Problem of Compactification
- Axiomatic Treatment of Rank in Infinite Sets
- Representations of Boolean algebras
- The axiom of choice
This page was built for publication: Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem
