Some Combinatorial Theorems Equivalent to the Prime Ideal Theorem

DOI10.2307/2038854zbMath0276.02050OpenAlexW4230038640MaRDI QIDQ4401450

Robert H. Cowen

Publication date: 1973

Full work available at URL: https://doi.org/10.2307/2038854

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial set theory (03E05) Other classical set theory (including functions, relations, and set algebra) (03E20) Set theory (03E99)

Related Items (4)

Quasicontinuous domains and the Smyth powerdomain ⋮ On variants of the principle of consistent choices, the minimal cover property and the 2-compactness of generalized Cantor cubes ⋮ Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem ⋮ On the equivalence of Rudin's lemma and the Boolean prime ideal theorem

Cites Work

• A new proof of the compactness theorem for propositional logic
• A short proof of Rado's lemma
• A selection lemma
• Introduction to model theory and to the metamathematics of algebra
• On Theorems of Tychonoff, Alexander, and R. Rado
• Axiomatic Treatment of Rank in Infinite Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Combinatorial Theorems Equivalent to the Prime Ideal Theorem