Some Combinatorial Theorems Equivalent to the Prime Ideal Theorem
Author:
- R. H. CowenRCR. H. Cowen
Open Access
- 1 November 1973
- journal article
- Published by JSTOR in Proceedings of the American Mathematical Society
- Vol. 41 (1) , 268-273
Abstract
Some useful combinatorial selection lemmas are shown to be directly equivalent to the prime ideal theorem for boolean algebras.Keywords
This publication has 8 references indexed in Scilit:
- A selection lemmaJournal of Combinatorial Theory, Series A, 1971
- A new proof of the compactness theorem for propositional logic.Notre Dame Journal of Formal Logic, 1970
- On Theorems of Tychonoff, Alexander, and R. RadoProceedings of the American Mathematical Society, 1967
- Introduction to Model Theory and to the Metamathematics of Algebra. By A. Robinson. Pp. 284. 60s. 1963. (North Holland Publishing Co.)The Mathematical Gazette, 1964
- General Topology. By John L. Kekley pp. xiv, 298. 60s. 1£ (Macmillan)The Mathematical Gazette, 1957
- Effectiveness of the representation theory for Boolean algebrasFundamenta Mathematicae, 1955
- A Colour Problem for Infinite Graphs and a Problem in the Theory of RelationsIndagationes Mathematicae, 1951
- Axiomatic Treatment of Rank in Infinite SetsCanadian Journal of Mathematics, 1949