Cardinal Mercier's A Manual of Modern Scholastic Philosophy is a standard work, prepared at the Higher Institute of Philosophy, Louvain, mainly for the use of clerical students in Catholic seminaries. Though undoubtedly elementary, it contains a clear, simple, and methodological exposition of the principles and problems of every department of philosophy, and its appeal is not to any particular class, but broadly human and universal. Volume I includes a general introduction to philosophy and sections on cosmology, psychology, criteriology, and metaphysics (...) or ontology. Volume II contains sections on natural theology, logic, ethics, and outlines of the history of philosophy. (shrink)

In the Zermelo–Fraenkel set theory (ZF), |$|\textrm {fin}(A)|<2^{|A|}\leq |\textrm {Part}(A)|$| for any infinite set |$A$|⁠, where |$\textrm {fin}(A)$| is the set of finite subsets of |$A$|⁠, |$2^{|A|}$| is the cardinality of the power set of |$A$| and |$\textrm {Part}(A)$| is the set of partitions of |$A$|⁠. In this paper, we show in ZF that |$|\textrm {fin}(A)|<|\textrm {Part}_{\textrm {fin}}(A)|$| for any set |$A$| with |$|A|\geq 5$|⁠, where |$\textrm {Part}_{\textrm {fin}}(A)$| is the set of partitions of |$A$| whose members are finite. (...) We also show that, without the Axiom of Choice, any relationship between |$|\textrm {Part}_{\textrm {fin}}(A)|$| and |$2^{|A|}$| for an arbitrary infinite set |$A$| cannot be concluded. (shrink)

We write and for the cardinalities of the set of finite sequences and the set of finite subsets, respectively, of a set which is of cardinality. With the axiom of choice (), for every infinite cardinal but, without, any relationship between and for an arbitrary infinite cardinal cannot be proved. In this paper, we give conditions that make and comparable for an infinite cardinal. Among our results, we show that, if we assume the axiom of choice for sets (...) of finite sets, then for every Dedekind‐infinite cardinal and the condition that is Dedekind‐infinite cannot be weakened to weakly Dedekind‐infinite. (shrink)

We generalize results of [3] and [1] to hyperprojective sets of reals, viz. to more than finitely many strong cardinals being involved. We show, for example, that if every set of reals in Lω is weakly homogeneously Souslin, then there is an inner model with an inaccessible limit of strong cardinals.

Assuming AD + DC, we characterize the self-dual boldface pointclasses which are strictly larger than the pointclasses contained in them: these are exactly the clopen sets, the collections of all sets of Wadge rank [Formula: see text], and those of Wadge rank [Formula: see text] when ξ is limit.

We define a potentialist system of ‐structures, i.e., a collection of possible worlds in the language of connected by a binary accessibility relation, achieving a potentialist account of the full background set‐theoretic universe V. The definition involves Berkeley cardinals, the strongest known large cardinal axioms, inconsistent with the Axiom of Choice. In fact, as background theory we assume just. It turns out that the propositional modal assertions which are valid at every world of our system are exactly those in the (...) modal theory. Moreover, we characterize the worlds satisfying the potentialist maximality principle, and thus the modal theory, both for assertions in the language of and for assertions in the full potentialist language. (shrink)

If a˜cardinal κ1, regular in the ground model M, is collapsed in the extension N to a˜cardinal κ0 and its new cofinality, ρ, is less than κ0, then, under some additional assumptions, each cardinal λ>κ1 less than cc/[κ1]<κ1) is collapsed to κ0 as well. If in addition N=M[f], where f : ρ→κ1 is an unbounded mapping, then N is a˜λ=κ0-minimal extension. This and similar results are applied to generalized forcing notions of Bukovský and Namba.

The independence phenomenon in set theory, while pervasive, can be partially addressed through the use of large cardinal axioms. One idea sometimes alluded to is that maximality considerations speak in favour of large cardinal axioms consistent with ZFC, since it appears to be `possible' to continue the hierarchy far enough to generate the relevant transfinite number. In this paper, we argue against this idea based on a priority of subset formation under the iterative conception. In particular, we argue that there (...) are several conceptions of maximality that justify the consistency but falsity of large cardinal axioms. We argue that the arguments we provide are illuminating for the debate concerning the justification of new axioms in iteratively-founded set theory. (shrink)

Let T be the family of open subsets of a topological space . We prove that if T has a base of cardinality μ, λμ<2λ, λ strong limit of cofinality 0, then T has cardinality μ or 2λ. This is our main conclusion . In Theorem 2 we prove it under some set-theoretic assumption, which is clear when λ = μ; then we eliminate the assumption by a theorem on pcf from [Sh 460] motivated originally by this. Next (...) we prove that the simplest examples are the basic ones; they occur in every example . The main result for the case λ = 0 was proved in [Sh 454]. (shrink)

We are interested in the possible sets of cardinalities of branches of Kurepa trees in models of ZFC \ CH. In this paper we present a sufficient condition to be consistently the set of cardinalities of branches of Kurepa trees.

A DO model (here also referred to a Paris model) is a model of set theory all of whose ordinals are first order definable in . Jeffrey Paris (1973) initiated the study of DO models and showed that (1) every consistent extension T of ZF has a DO model, and (2) for complete extensions T, T has a unique DO model up to isomorphism iff T proves V=OD. Here we provide a comprehensive treatment of Paris models. Our results include the (...) following:1. If T is a consistent completion of ZF+V≠OD, then T has continuum-many countable nonisomorphic Paris models.2. Every countable model of ZFC has a Paris generic extension.3. If there is an uncountable well-founded model of ZFC, then for every infinite cardinal κ there is a Paris model of ZF of cardinality κ which has a nontrivial automorphism.4. For a model ZF, is a prime model ⇒ is a Paris model and satisfies AC⇒ is a minimal model. Moreover, Neither implication reverses assuming Con(ZF). (shrink)

We discuss several axiomatizations of set theory in first order predicate calculus with epsilon and a constant symbol W, starting with the simple system K(W) which has a strong equivalence with ZF without Foundation. The other systems correspond to various extensions of ZF by certain large cardinal hypotheses. These axiomatizations are unusually simple and uncluttered, and are highly suggestive of underlying philosophical principles that generate higher set theory.

We give an analysis over a variation of causal sets where the light cone of an event is represented by finitely branching trees with respect to any given arbitrary dynamics. We argue through basic topological properties of Cantor space that under certain assumptions about the universe, spacetime structure and causation, given any event x, the number of all possible future worldlines of x within the many-worlds interpretation is uncountable. However, if all worldlines extending the event x are ‘eventually deterministic’, (...) then the cardinality of the set of future worldlines with respect to x is exactly ℵ0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\aleph _0$$\end{document}, i.e., countably infinite. We also observe that if there are countably many future worldlines with respect to x, then at least one of them must be necessarily ‘decidable’ in the sense that there is an algorithm which determines whether or not any given event belongs to that worldline. We then show that if there are only finitely many worldlines in the future of an event x, then they are all decidable. We finally point out the fact that there can be only countably many terminating worldlines. (shrink)

A family \ is called Rosenthal if for every Boolean algebra \, bounded sequence \ of measures on \, antichain \ in \, and \, there exists \ such that \<\varepsilon \) for every \. Well-known and important Rosenthal’s lemma states that \ is a Rosenthal family. In this paper we provide a necessary condition in terms of antichains in \}\) for a family to be Rosenthal which leads us to a conclusion that no Rosenthal family has cardinality strictly (...) less than \\), the covering of category. We also study ultrafilters on \ which are Rosenthal families—we show that the class of Rosenthal ultrafilters contains all selective ultrafilters. (shrink)

Les trois dialogues composés par le cardinal Nicolas de Cues pendant l'été 1450 ne résument pas toute la pensée de cet auteur, mais ils éclairent d'un jour relativement nouveau sa réflexion sur le lien entre sagesse et savoir. Proche en cela des Anciens, Nicolas de Cues pense leur unité dans la lumière de l'Un - de la Déité, écrit-il parfois - réfléchie par la puissance de l'esprit humain. Cet esprit est compris comme imago dei, non pas image de Dieu, car (...) tout ce qui est image de Dieu, mais plutôt copie de Dieu, reprise de la toute-puissance divine dans les limites que lui impose, toutefois, le fait d'être finie. La vérité étant en elle-même inaccessible ici-bas - inattingible, écrit Nicolas de Cues - reste le développement de cette vérité ou de l'Un, c'est à dire ce monde que l'esprit a pour tâche de mesurer, de reprendre, de recréer. Savoir pour inventer un monde à venir, avec humilité et ouverture à l'Etranger : cela s'accorde précisément avec ce que certains historiens nomment l'Humanisme. (shrink)

David Hilbert famously remarked, “No one will drive us from the paradise that Cantor has created.” This volume offers a guided tour of modern mathematics’ Garden of Eden, beginning with perspectives on the finite universe and classes and Aristotelian logic. Author Mary Tiles further examines permutations, combinations, and infinite cardinalities; numbering the continuum; Cantor’s transfinite paradise; axiomatic set theory; logical objects and logical types; independence results and the universe of sets; and the constructs and reality of mathematical structure. Philosophers (...) and mathematicians will find an abundance of intriguing topics in this text, which is appropriate for undergraduate- and graduate-level courses. 1989 ed. 32 figures. (shrink)

The main theorem of this article is that every countable model of set theory 〈M, ∈M〉, including every well-founded model, is isomorphic to a submodel of its own constructible universe 〈LM, ∈M〉 by means of an embedding j : M → LM. It follows from the proof that the countable models of set theory are linearly pre-ordered by embeddability: if 〈M, ∈M〉 and 〈N, ∈N〉 are countable models of set theory, then either M is isomorphic to a submodel of N (...) or conversely. Indeed, these models are pre-well-ordered by embeddability in order-type exactly ω1+ 1. Specifically, the countable well-founded models are ordered under embeddability exactly in accordance with the heights of their ordinals; every shorter model embeds into every taller model; every model of set theory M is universal for all countable well-founded binary relations of rank at most OrdM; and every ill-founded model of set theory is universal for all countable acyclic binary relations. Finally, strengthening a classical theorem of Ressayre, the proof method shows that if M is any nonstandard model of PA, then every countable model of set theory — in particular, every model of ZFC plus large cardinals — is isomorphic to a submodel of the hereditarily finite sets 〈 HFM, ∈M〉 of M. Indeed, 〈 HFM, ∈M〉 is universal for all countable acyclic binary relations. (shrink)

A metric space (X, d) is monotone if there is a linear order < on X and a constant c such that d(x, y) ≤ c d(x, z) for all x < y < z in X. We investigate cardinal invariants of the σ-ideal Mon generated by monotone subsets of the plane. Since there is a strong connection between monotone sets in the plane and porous subsets of the line, plane and the Cantor set, cardinal invariants of these ideals (...) are also investigated. In particular, we show that non(Mon) ≥ ������ σ-linked , but non(Mon) < ������ σ-centered is consistent. Also cov(Mon) < c and cof(������) < cov(Mon) are consistent. (shrink)

REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even the failure (...) of PT) implies the existence of non-reflecting stationary sets. E.g., if REF then for manyλ ⌝ PT(λ, ℵ1). In Sect. 2 it is shown that Easton-support iteration of suitable Levy collapses yield a universe with REF if for every singular λ which is a limit of supercompacts the bad stationary set concentrates on the “right” cofinalities. In Sect. 3 the use of oracle c.c. (and oracle proper—see [Sh-b, Chap. IV] and [Sh 100, Sect. 4]) is adapted to replacing the diamond by the Laver diamond. Using this, a universe as needed in Sect. 2 is forced, where one starts, and ends, with a universe with a proper class of supercompacts. In Sect. 4 bad sets are handled in ZFC. For a regular λ {δ<+ : cfδ<λ} is good. It is proved in ZFC that ifλ=cfλ>ℵ1 then {α<+ : cfα<λ} is the union of λ sets on which there are squares. (shrink)

Assuming large cardinals we produce a forcing extension of V which preserves cardinals, does not add reals, and makes the set of points of countable V cofinality in κ+ nonstationary. Continuing to force further, we obtain an extension in which the set of points of countable V cofinality in ν is nonstationary for every regular ν ≥ κ+. Finally we show that our large cardinal assumption is optimal.

Quasi-set theory is a ZFU-like axiomatic set theory, which deals with two kinds of ur-elements: M-atoms, objects like the atoms of ZFU, and m-atoms, items for which the usual identity relation is not defined. One of the motivations to advance such a theory is to deal properly with collections of items like particles in non-relativistic quantum mechanics when these are understood as being non-individuals in the sense that they may be indistinguishable although identity does not apply to them. According to (...) some authors, this is the best way to understand quantum objects. The fact that identity is not defined for m-atoms raises a technical difficulty: it seems impossible to follow the usual procedures to define the cardinal of collections involving these items. In this paper we propose a definition of finite cardinals in quasi-set theory which works for collections involving m-atoms. (shrink)

In this paper, we use algebra-valued models to study cardinal numbers in a class of non-classical set theories. The algebra-valued models of these non-classical set theories validate the Axiom of Choice, if the ground model validates it. Though the models are non-classical, the foundations of cardinal numbers in these models are similar to those in classical set theory. For example, we show that mathematical induction, Cantor’s theorem, and the Schröder–Bernstein theorem hold in these models. We also study a few basic (...) properties of cardinal arithmetic. In addition, the generalized continuum hypothesis is proved to be independent of these non-classical set theories. (shrink)

A model M = (M, E,...) of Zermelo-Fraenkel set theory ZF is said to be θ-like, where E interprets ∈ and θ is an uncountable cardinal, if |M| = θ but $|\{b \in M: bEa\}| for each a ∈ M. An immediate corollary of the classical theorem of Keisler and Morley on elementary end extensions of models of set theory is that every consistent extension of ZF has an ℵ 1 -like model. Coupled with Chang's two cardinal theorem this implies (...) that if θ is a regular cardinal θ such that $2^{ then every consistent extension of ZF also has a θ + -like model. In particular, in the presence of the continuum hypothesis every consistent extension of ZF has an ℵ 2 -like model. Here we prove: THEOREM A. If θ has the tree property then the following are equivalent for any completion T of ZFC: (i) T has a θ-like model. (ii) $\Phi \subseteq T$ , where Φ is the recursive set of axioms {∃ κ(κ is n-Mahlo and "V κ is a Σ n -elementary submodel of the universe"): n ∈ ω}. (iii) T has a λ-like model for every uncountable cardinal λ. THEOREM B. The following are equiconsistent over ZFC: (i) "There exists an ω-Mahlo cardinal". (ii) "For every finite language L, all ℵ 2 -like models of ZFC(L) satisfy the scheme Φ(L). (shrink)

Here, we analyse some recent applications of set theory to topology and argue that set theory is not only the closed domain where mathematics is usually founded, but also a flexible framework where imperfect intuitions can be precisely formalized and technically elaborated before they possibly migrate toward other branches. This apparently new role is mostly reminiscent of the one played by other external fields like theoretical physics, and we think that it could contribute to revitalize the interest in set theory (...) in the future. (shrink)

A model is said to be Leibnizian if it has no pair of indiscernibles. Mycielski has shown that there is a first order axiom LM (the Leibniz-Mycielski axiom) such that for any completion T of Zermelo-Fraenkel set theory ZF, T has a Leibnizian model if and only if T proves LM. Here we prove: THEOREM A. Every complete theory T extending ZF + LM has $2^{\aleph_{0}}$ nonisomorphic countable Leibnizian models. THEOREM B. If $\kappa$ is aprescribed definable infinite cardinal of a (...) complete theory T extending ZF + V = OD. then there are $2^{\aleph_{1}}$ nonisomorphic Leibnizian models $\mathfrak{M}$ of T of power $\aleph_{1}$ such that $(\kappa^{+})^\mathfrak{M}$ is $\aleph_{1}-like$ . THEOREM C. Every complete theory T extending ZF + V = OD has $2^{\aleph_{1}}$ nonisomorphic \aleph_{1}-like$ Leibnizian models. (shrink)

Alain Badiou's Being and Event continues to impact philosophical investigations into the question of Being. By exploring the central role set theory plays in this influential work, Burhanuddin Baki presents the first extended study of Badiou's use of mathematics in Being and Event. Adopting a clear, straightforward approach, Baki gathers together and explains the technical details of the relevant high-level mathematics in Being and Event. He examines Badiou's philosophical framework in close detail, showing exactly how it is 'conditioned' by the (...) technical mathematics. Clarifying the relevant details of Badiou's mathematics, Baki looks at the four core topics Badiou employs from set theory: the formal axiomatic system of ZFC; cardinal and ordinal numbers; Kurt G. (shrink)

Cardinal Mercier’s Manual of Modern Scholastic Philosophy is a standard work, prepared at the Higher Institute of Philosophy, Louvain, mainly for the use of clerical students in Catholic Seminaries. Though undoubtedly elementary, it contains a clear, simple, and methodological exposition of the principles and problems of every department of philosophy, and its appeal is not to any particular class, but broadly human and universal. Volume I includes a general introduction to philosophy and sections on cosmology, psychology, criteriology, and metaphysics or (...) ontology. (shrink)

What one can say about the past, present and future of set theory depends on what one expects or at least hopes set theory will accomplish. In order to gauge the early expectations, I begin with a quote from the inaugural lecture in 1903 of my mathematical grandfather, the internationally known Finnish mathematician Ernst Lindelöf. The subject of his lecture was – guess what – Cantor’s set theory. In his conclusion, Lindelöf says of Cantor’s results: For mathematics they have lent (...) new tools and opened up new fields of research, they have thrown entirely new light on the foundations of analysis and brought clarity and order where there was only disorder and contradictions. Thus they have greatly contributed to the harmony that is the essence of mathematics, a harmony a grasp of which is the reward of mathematical research. (Quoted in Olli Lehto, Tieteen aatelia, Otava, Helsinki, 2008, p. 263) We can all agree with the compliments Lindelöf pays to set theory as an impressive specimen of mathematical research, including the theory of infinite cardinals and ordinals. But as far as the foundational role of set theory is concerned, in the perspective of the subsequent century his words read as an example of supreme historical irony. Far from bringing harmony into the foundations of mathematics, problems arising from set theory led to a schism between different schools of thought. Few mathematicians think of set theory as a tool for reaching new results outside set theory.. On the contrary, an interesting rich tradition called reverse mathematics takes significant mathematical results and asks what set-theoretical assumptions are needed to prove them. Set-theoretical paradoxes have greatly increased mathematicians’ concerns about contradictions instead of assuaging them. Many foundationalists would blandly deny that we have even now, more than a hundred years later, reached “clarity and order” about the foundations of analysis. What Lindelöf took to be the results of set theory thus were in reality so many hopes that set theory was expected to fulfill.. (shrink)

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.