Prime elements from prime ideals
In the summer of 1984 A. R. Blass proved that the Almost Maximal Ideal Theorem which had been introduced by the reviewer [Fundam. Math. 123, 197-209 (1984; Zbl 0552.06004)] - and which he had previously believed to be a choice principle intermediate between the Prime Ideal Theorem and the Axiom of Choice - was in fact logically equivalent to the Prime Ideal Theorem. Blass' proof was a slightly involved one making use of the compactness theorem for first-order logic; on receiving news of it, both B. Banaschewski and the reviewer independently discovered simpler proofs. Here is Banaschewski's proof, which goes by way of a Prime Element Theorem for distributive complete lattices with compact units.
- The prime ideal theorem and representation of F-rings
- On the least multiplicative nucleus of a ring
- Semidistributivity, prime ideals and the subbase lemma
- Ideal completion and Stone representation of ideal-distributive ordered sets
- Primes, irreducibles and extremal lattices
- On Krull's separation lemma
- The strength of prime separation, sobriety, and compactness theorems
- Maximal ideals in countable rings, constructively
- A proof of the independence of the axiom of choice from the Boolean prime ideal theorem.
- scientific article; zbMATH DE number 4162951 (Why is no real title available?)
- Finiteness conditions and distributive laws for Boolean algebras
- Prime ideals yield almost maximal ideals
- scientific article; zbMATH DE number 1450186 (Why is no real title available?)
- Compact Hausdorff approach frames
- More on the strength of Engeler's lemma.
This page was built for publication: Prime elements from prime ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065041)
