Axioms of Set Theory

¿Qué ha pasado con el problema del cardinal del continuo después de Gödel (1938) y Cohen (1964)? Intentos de responder esta pregunta pueden encontrarse en los artículos de José Alfredo Amor (1946-2011), "El Problema del continuo después de Cohen (1964-2004)", de Carlos Di Prisco , "Are we closer to a solution of the continuum problem", y de Joan Bagaria, "Natural axioms of set and the continuum problem" , que se pueden encontrar en la biblioteca digital de mi blog de Lógica (...) Matemática y Fundamentos de la Matemática (ver). También en la entrada "The Continuum Hypothesis" de la web de Enciclopedia de Filosofía de la Universidad de Stanford existe información importante y actualizada al respecto. En esta breve nota se comenta sobre el tema de una manera divulgativa. (shrink)

ABSTRACT We shall defend three philosophical theses about the extent of intrinsic justification based on various technical results. We shall present a set of theorems which indicate intriguing structural similarities between a family of “weak” reflection principles roughly at the level of those considered by Tait and Koellner and a family of “strong” reflection principles roughly at the level of those of Welch and Roberts, which we claim to lend support to the view that the stronger reflection principles are intrinsically (...) justified as well as the weaker ones. We consider connections with earlier work of Marshall. (shrink)

This paper presents and defends an argument that the continuum hypothesis is false, based on considerations about objective chance and an old theorem due to Banach and Kuratowski. More specifically, I argue that the probabilistic inductive methods standardly used in science presuppose that every proposition about the outcome of a chancy process has a certain chance between 0 and 1. I also argue in favour of the standard view that chances are countably additive. Since it is possible to randomly pick (...) out a point on a continuum, for instance using a roulette wheel or by flipping a countable infinity of fair coins, it follows, given the axioms of ZFC, that there are many different cardinalities between countable infinity and the cardinality of the continuum. (shrink)

We present an extension of constructive Zermelo{Fraenkel set theory [2]. Constructive sets are endowed with an applicative structure, which allows us to express several set theoretic constructs uniformly and explicitly. From the proof theoretic point of view, the addition is shown to be conservative. In particular, we single out a theory of constructive sets with operations which has the same strength as Peano arithmetic.

In set theory without the Axiom of Choice, we investigate the set-theoretic strength of the principle NDS which states that there is no function f on the set ω of natural numbers such that for everyn ∈ ω, f ≺ f, where for sets x and y, x ≺ y means that there is a one-to-one map g : x → y, but no one-to-one map h : y → x. It is a long standing open problem whether NDS implies (...) AC. In this paper, among other results, we show that NDS is a strong axiom by establishing that ACLO ↛ NDS in ZFA set theory. The latter result provides a strongly negative answer to the question of whether “every Dedekind-finite set is finite” implies NDS addressed in G. H. Moore “Zermelo’s Axiom of Choice. Its Origins, Development, and Influence” and in P. Howard–J. E. Rubin “Consequences of the Axiom of Choice”. We also prove that ACWO ↛ NDS in ZF and that “for all infinite cardinals m, m + m = m” ↛ NDS in ZFA. (shrink)

This article presents an overview of the basic philosophical motivations for, and some recent work in, modal set theory.

1994.Επιστημολογία της Λογικής. Συγγραφέας Επαμεινώνδας Ξενόπουλος Μοναδική μελέτη και προσέγγιση της θεωρίας της γνώσης, για την παγκόσμια βιβλιογραφία, της διαλεκτικής πορείας της σκέψης από την λογική πλευρά της και της μελλοντικής μορφής που θα πάρουν οι διαλεκτικές δομές της, στην αδιαίρετη ενότητα γνωσιοθεωρίας, λογικής και διαλεκτικής, με την «μέθοδο του διαλεκτικού υλισμού». Έργο βαρύ με θέμα εξαιρετικά δύσκολο διακατέχεται από πρωτοτυπία και ζωντάνια που γοητεύει τον κάθε ανήσυχο στοχαστή από τις πρώτες γραμμές.

The Necessary Maximality Principle for c. c. c. forcing with real parameters is equiconsistent with the existence of a weakly compact cardinal. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim).

The results of this paper concern the effective cardinal structure of the subsets of [ω1]<ω1, the set of all countable subsets of ω1. The main results include dichotomy theorems and theorems which show that the effective cardinal structure is complicated.

Relative to the existence of a supercompact cardinal with a measurable cardinal above it, we show that it is consistent for ℵ1 to be regular and for ℵmath image to be measurable and to carry precisely τ normal measures, where τ ≥ ℵmath image is any regular cardinal. This extends the work of [2], in which the analogous result was obtained for ℵω +1 using the same hypotheses.

Applying Weglorz' mode s of set theory without the axiom of choice, we investigate Arrow-type social we fare functions for infinite societies with restricted coalition algebras. We show that there is a reasonable, nondictatorial social welfare function satisfying “finite discrimination”, if and only if in Weglorz' mode there is a free ultrafilter on a set representing the individuals.

It is known that – assuming the axiom of choice – for subsets A of ℝ the following hold: A is compact iff it is sequentially compact, A is complete iff it is closed in ℝ, ℝ is a sequential space. We will show that these assertions are not provable in the absence of the axiom of choice, and that they are equivalent to each.

We will prove that some so-called union theorems are equivalent in ZF0 to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ-hereditary sets yields equivalents to statements about the transitive closure of κ-narrow relations. The instance κ = ω1 yields an equivalent to Howard-Rubin's Form 172 of every hereditarily countable set x is countable). In particular, the countable union theorem and, a fortiori, the axiom of countable choice imply Form 172.

Given a set X, equation image denotes the statement: “equation image has a choice set” and equation image denotes the family of all closed subsets of the topological space equation image whose definition depends on a finite subset of X. We study the interrelations between the statements equation image equation image equation image equation image and “equation imagehas a choice set”. We show: equation image iff equation image iff equation image has a choice set iff equation image. equation image iff (...) for every set X, equation image has a choice set. equation image does not imply “equation image has a choice set equation image implies equation image but equation image does not imply equation image.We also show that “For every setX, “equation imagehas a choice set” iff “for every setX, equation imagehas a choice set” iff “for every productequation imageof finite discrete spaces,equation image has a choice set”. (shrink)

RÉSUMÉ: Cet article discute diverses confusions, actuelles ou potentielles, liées à la bivalence et au tiers exclu. Il s'agit, en particulier, 1) d'examiner divers cas illustrant les rapports entre la bivalence et le tiers exclu ; 2) de discuter la thèse selon laquelle le tiers exclu et le schéma-T de Tarskipour la vérité entraînent la bivalence; 3) de proposer quelques remarques sur les rapports entre la bivalence, le tiers exclu et lapreuve par l'absurde; 4) de scruter un argument répandu selon (...) lequel le tiers exclu vaut pour les termes «précis»; et 5) de commenter l'histoire de la terminologie. L'objectif ici est d'attirer l'attention des philosophes sur une distinction importante qui ne reçoit pas souvent le traitement minutieux qu'elle mérite. (shrink)