We prove an Omitting Types Theorem for certain algebraizable extensions of first order logic without equality studied in [SAI 00] and [SAY 04]. This is done by proving a representation theorem preserving given countable sets of infinite meets for certain reducts of ?- dimensional polyadic algebras, the so-called G polyadic algebras (Theorem 5). Here G is a special subsemigroup of (?, ? o) that specifies the signature of the algebras in question. We state and prove an independence result connecting our (...) representation theorem to Martin's axiom (Theorem 6). Also we show that the countable atomic G polyadic algebras are completely representable (Corollary 16) contrasting results on cylindric algebras. Several related results are surveyed. (shrink)

In this article I intend to show that certain aspects of the axiomatical structure of mathematical theories can be, by a phenomenologically motivated approach, reduced to two distinct types of idealization, the first-level idealization associated with the concrete intuition of the objects of mathematical theories as discrete, finite sign-configurations and the second-level idealization associated with the intuition of infinite mathematical objects as extensions over constituted temporality. This is the main standpoint from which I review Cantor’s conception of infinite cardinalities and (...) also the metatheoretical content of some later well-known theorems of mathematical foundations. These are, the Skolem-Löwenheim Theorem which, except for its importance as such, it is also chosen for an interpretation of the associated metatheoretical paradox (Skolem Paradox), and Gödel’s (first) incompleteness result which, notwithstanding its obvious influence in the mathematical foundations, is still open to philosophical inquiry. On the phenomenological level, first-level and second-level idealizations, as above, are associated respectively with intentional acts carried out in actual present and with certain modes of a temporal constitution process. (shrink)

We show that the statement “separable, countably compact, regular spaces are Baire” is deducible from a strictly weaker form than AC, namely, CAC . We also find some characterizations of the axiom of dependent choices.

In this article, we shall show the generalized notions of distributivity of Boolean algebras have essential relations with several axioms and properties of set theory, say the Axiom of Choice, the Axiom of Dependence Choice, the Prime Ideal Theorems, Martin's axioms, Lebesgue measurability and so on.

We work in set theory ZF without axiom of choice. Though the Hahn-Banach theorem cannot be proved in ZF, we prove that every Gateaux-differentiable uniformly convex Banach space E satisfies the following continuous Hahn-Banach property: if p is a continuous sublinear functional on E, if F is a subspace of E, and if f: F → ℝ is a linear functional such that f ≤ p|F then there exists a linear functional g : E → ℝ such that g extends (...) f and g ≤ p. We also prove that the continuous Hahn-Banach property on a topological vector space E is equivalent to the classical geometrical forms of the Hahn-Banach theorem on E. We then prove that the axiom of Dependent choices DC is equivalent to Ekeland's variational principle, and that it implies the continuous Hahn-Banach property on Gateaux-differentiable Banach spaces. Finally, we prove that, though separable normed spaces satisfy the continuous Hahn-Banach property, they do not satisfy the whole Hahn-Banach property in ZF+DC. (shrink)