The equivalence of Boolean prime ideal theorem and a theorem of functional analysis

G. Gardiner

doi:10.4064/fm-84-2-81-86

ScienceGate Book Chapters

JOURNAL ARTICLE

The equivalence of Boolean prime ideal theorem and a theorem of functional analysis

G. Gardiner

Year: 1974 Journal: Fundamenta Mathematicae Vol: 84 (2)Pages: 81-86 Publisher: Polish Academy of Sciences

DOI: 10.4064/fm-84-2-81-86

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Equivalence (formal languages) Stone's representation theorem for Boolean algebras Boolean prime ideal theorem Discrete mathematics Ideal (ethics) Prime (order theory) Associated prime Pure mathematics Algebra over a field Combinatorics Two-element Boolean algebra

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.03

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Rings, Modules, and Algebras

Physical Sciences → Mathematics → Algebra and Number Theory

Computability, Logic, AI Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

The equivalence of Boolean prime ideal theorem and a theorem of functional analysis

Metrics

Topics

Related Documents

Prime ideal theorem for double Boolean algebras

On the equivalence of Rudin's Lemma and the Boolean prime ideal theorem

Coloring infinite graphs and the Boolean prime ideal theorem

Kelley's specialization of Tychonoff's Theorem is equivalent to the Boolean Prime Ideal Theorem

Łoś’ theorem and the Boolean prime ideal theorem imply the axiom of choice