The prime ideal theorem and representation of \(F\)-rings (Q1108300): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime elements from prime ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of the Ultrafilter Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime ideals yield almost maximal ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost maximal ideals / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01229983 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057333509 / rank
 
Normal rank

Latest revision as of 08:29, 30 July 2024

scientific article
Language Label Description Also known as
English
The prime ideal theorem and representation of \(F\)-rings
scientific article

    Statements

    The prime ideal theorem and representation of \(F\)-rings (English)
    0 references
    1988
    0 references
    The Boolean Prime Ideal Theorem (PIT) is the statement that every non- trivial Boolean algebra has a prime ideal. The Birkhoff-Pierce Representation Theorem for \(F\)-rings (BPT) is the statement that every \(F\)-ring is a subdirect product of totally ordered rings. \textit{D. Feldman} and \textit{M. Henriksen} [Indag. Math. 50, No. 2, 121--126 (1988; Zbl 0656.06017)] showed recently that PIT and BPT are equivalent. They used some alternative principles equivalent to PIT, for instance the Completeness Theorem for first order logic. Here a different and direct proof is given that, in ZF, PIT and BPT are equivalent.
    0 references
    Boolean Prime Ideal Theorem
    0 references
    Birkhoff-Pierce Representation Theorem for F-rings
    0 references
    subdirect product
    0 references
    totally ordered rings
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references