Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem
نویسنده
چکیده
We formulate a restricted version of the Tukey-Teichmüller Theorem that we denote by (rTT). We then prove that (rTT) and (BPI) are equivalent in ZF and that (rTT) applies rather naturally to several equivalent forms of (BPI): Alexander Subbase Theorem, Stone Representation Theorem, Model Existence and Compactness Theorems for propositional and first-order logic. We also give two variations of (rTT) that we denote by (rTT)+ and (rTT)++; each is equivalent to (rTT) in ZF. The variation (rTT)++ applies rather naturally to various Selection Lemmas due to Cowen, Engeler, and Rado.
منابع مشابه
A Compactness Theorem for In nite
A useful compactness theorem for constraint satisfaction problems is proved equivalent to BPI, the Boolean Prime Ideal Theorem. The relation of various restricted versions of the Theorem to each other and to BPI is also explored.
متن کاملGENERALIZED PRINCIPAL IDEAL THEOREM FOR MODULES
The Generalized Principal Ideal Theorem is one of the cornerstones of dimension theory for Noetherian rings. For an R-module M, we identify certain submodules of M that play a role analogous to that of prime ideals in the ring R. Using this definition, we extend the Generalized Principal Ideal Theorem to modules.
متن کاملA Characterization of the Boolean Prime Ideal Theorem in Terms of Forcing Notions
For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or antichains. This allows us to prove some consequences of the Boolean Prime Ideal theorem using arguments in the style of those that use Zorn’s Lemma, or Martin’s Axiom.
متن کاملG-free Colorability and the Boolean Prime Ideal Theorem
We show that the compactness of G-free k-colorability is equivalent to the Boolean prime ideal theorem for any graph G with more than two vertices and any k ≥ 2.
متن کاملGraph Coloring Compactness Theorems Equivalent to BPI
We introduce compactness theorems for generalized colorings and derive several particular compactness theorems from them. It is proved that the theorems and many of their consequences are equivalent in ZF set theory to BPI, the Prime Ideal Theorem for Boolean algebras. keywords: generalized graph colorings, compactness, prime ideal theorem MSC: 05C15; 03E25 .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 44 شماره
صفحات -
تاریخ انتشار 2005