A pervasive thought in contemporary philosophy of mathematics is that in order to justify reflection principles, one must hold universism: the view that there is a single universe of pure sets. I challenge this kind of reasoning by contrasting universism with a Zermelian form of multiversism. I argue that if extant justifications of reflection principles using notions of richness are acceptable for the universist, then the Zermelian can use similar justifications. However, I note that for some forms of richness argument, (...) the status of reflection principles as axioms is left open for the Zermelian. (shrink)

Transfinite recursion is an essential component of set theory. In this paper, we seek intrinsically justified reasons for believing in recursion and the notions of higher computation that surround it. In doing this, we consider several kinds of recursion principles and prove results concerning their relation to one another. We then consider philosophical motivations for these formal principles coming from the idea that computational notions lie at the core of our conception of set. This is significant because, while the iterative (...) conception of set has been widely recognized as insufficient to establish replacement and recursion, its supplementation by considerations pertaining to algorithms suggests a new and philosophically well-motivated reason to believe in such principles. (shrink)

Bob Hale’s distinguished record of research places him among the most important and influential contemporary analytic metaphysicians. In his deep, wide ranging, yet highly readable book Necessary Beings, Hale draws upon, but substantially integrates and extends, a good deal his past research to produce a sustained and richly textured essay on — as promised in the subtitle — ontology, modality, and the relations between them. I’ve set myself two tasks in this review: first, to provide a reasonably thorough (if not (...) exactly comprehensive) overview of the structure and content of Hale’s book and, second, to a limited extent, to engage Hale’s book philosophically. I approach these tasks more or less sequentially: Parts I and 2 of the review are primarily expository; in Part 3 I adopt a somewhat more critical stance and raise several issues concerning one of the central elements of Hale’s account, his essentialist theory of modality. (shrink)

Some reasons to regard the cumulative hierarchy of sets as potential rather than actual are discussed. Motivated by this, a modal set theory is developed which encapsulates this potentialist conception. The resulting theory is equi-interpretable with Zermelo Fraenkel set theory but sheds new light on the set-theoretic paradoxes and the foundations of set theory.

The paper characterizes the second order arithmetic theorems of a set theory that features a recursively Mahlo universe; thereby complementing prior proof-theoretic investigations on this notion. It is shown that the property of being recursively Mahlo corresponds to a certain kind of β-model reflection in second order arithmetic. Further, this leads to a characterization of the reals recursively computable in the superjump functional.

G. Jäger gave in Arch. Math. Logik Grundlagenforsch. 24 , 49-62, a recursive notation system on a basis of a hierarchy Iαß of α-inaccessible regular ordinals using collapsing functions following W. Buchholz in Ann. Pure Appl. Logic 32 , 195-207. Jäger's system stops, when ordinals α with Iα0 = α enter. This border is now overcome by introducing additional a hierarchy Jαß of weakly inaccessible Mahlo numbers, which is defined similarly to the Jäger hierarchy. An ordinal μ is called Mahlo, (...) if every normal-function f : μ → μ has regular fixpoints. Collapsing is defined for both Mahlo and simply regular ordinals such that for every Mahlo ordinal μ out of the J-hierarchy Ψμα is a regular σ such that Iσ0 = σ. For these regular σ again collapsing functions Ψσ are defined. To get a proper systematical order into the collapsing procedure, a pair of ordinals is associated to σ and α, and the definition of Ψσα is given by recursion on a suitable well-ordering of these pairs. Thus a fairly large system of ordinal notations can be established. It seems rather straightforward, how to extend this setting further. (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.

In his monograph On Numbers and Games, J. H. Conway introduced a real-closed field containing the reals and the ordinals as well as a great many less familiar numbers including $-\omega, \,\omega/2, \,1/\omega, \sqrt{\omega}$ and $\omega-\pi$ to name only a few. Indeed, this particular real-closed field, which Conway calls No, is so remarkably inclusive that, subject to the proviso that numbers—construed here as members of ordered fields—be individually definable in terms of sets of NBG, it may be said to contain (...) “All Numbers Great and Small.” In this respect, No bears much the same relation to ordered fields that the system ℝ of real numbers bears to Archimedean ordered fields. In Part I of the present paper, we suggest that whereas $\mathbb{R}$should merely be regarded as constituting an arithmetic continuum, No may be regarded as a sort of absolute arithmetic continuum, and in Part II we draw attention to the unifying framework No provides not only for the reals and the ordinals but also for an array of non-Archimedean ordered number systems that have arisen in connection with the theories of non-Archimedean ordered algebraic and geometric systems, the theory of the rate of growth of real functions and nonstandard analysis. In addition to its inclusive structure as an ordered field, the system No of surreal numbers has a rich algebraico-tree-theoretic structure—a simplicity hierarchical structure—that emerges from the recursive clauses in terms of which it is defined. In the development of No outlined in the present paper, in which the surreals emerge vis-à-vis a generalization of the von Neumann ordinal construction, the simplicity hierarchical features of No are brought to the fore and play central roles in the aforementioned unification of systems of numbers great and small and in some of the more revealing characterizations of No as an absolute continuum. (shrink)

A god is a cosmic designer-creator. Atheism says the number of gods is 0. But it is hard to defeat the minimal thesis that some possible universe is actualized by some possible god. Monotheists say the number of gods is 1. Yet no degree of perfection can be coherently assigned to any unique god. Lewis says the number of gods is at least the second beth number. Yet polytheists cannot defend an arbitrary plural number of gods. An alternative is that, (...) for every ordinal, there is a god whose perfection is proportional to it. The n -th god actualizes the best universe(s) in the n -th level of an axiological hierarchy of possible universes. Despite its unorthodoxy, ordinal polytheism has many metaphysically attractive features and merits more serious study. (shrink)

This paper explores how the Generalized Continuum Hypothesis (GCH) arose from Cantor's Continuum Hypothesis in the work of Peirce, Jourdain, Hausdorff, Tarski, and how GCH was used up to Gödel's relative consistency result.

This document consists primarily of an excerpt (chapter 5) from the author’s book From Brain to Cosmos. That excerpt presents an analysis of personal identity through time, using the concept of subjective fact that the author developed earlier in the book. (Readers unfamiliar with that concept are strongly advised to read chapters 2 and 3 of From Brain to Cosmos first. See the last page of this document for details on how to obtain those chapters.).

This collection serves as an introduction to the concept of subjective fact, which plays a central role in some of the author's philosophical writings. The collection contains two book chapters and a paper. The first chapter (Chapter 2 of From Brain to Cosmos) begins with an informal characterization of the concept of subjective fact. Then it fleshes out this concept with examples, gives a more precise characterization, and addresses some potential weaknesses of the concept. This chapter shows how subjective fact (...) is related to key ideas in the philosophy of mind, such as intentionality. The second chapter (Chapter 3) is a detailed study of the concept of “instance of seeming” that was introduced in Chapter 2. Chapter 3 ends with some remarks on the modal logic of subjective facts. The paper, also by the book’s author, answers some potential questions about the ideas in the two included chapters. (shrink)

This document consists primarily of an excerpt (chapter 4) from the author’s book From Brain to Cosmos. That excerpt presents a study of a specific problem about knowledge: the logical justification of one’s knowledge of the immediate past. (This document depends heavily upon the concept of subjective fact that the author developed in chapters 2 and 3 of From Brain to Cosmos. Readers unfamiliar with that concept are strongly advised to read those chapters first. See the last page of this (...) document for details on how to obtain those chapters.). (shrink)

Mathematics is obviously important in the sciences. And so it is likely to be equally important in any effort that aims to understand God in a scientifically significant way or that aims to clarify the relations between science and theology. The degree to which God has any perfection is absolutely infinite. We use contemporary mathematics to precisely define that absolute infinity. For any perfection, we use transfinite recursion to define an endlessly ascending series of degrees of that perfection. That series (...) rises to an absolutely infinite degree of that perfection. God has that absolutely infinite degree. We focus on the perfections of knowledge, power, and benevolence. Our model of divine infinity thus builds a bridge between mathematics and theology. (shrink)

This paper begins an axiomatic development of naive set theoryin a paraconsistent logic. Results divide into two sorts. There is classical recapture, where the main theorems of ordinal and Peano arithmetic are proved, showing that naive set theory can provide a foundation for standard mathematics. Then there are major extensions, including proofs of the famous paradoxes and the axiom of choice (in the form of the well-ordering principle). At the end I indicate how later developments of cardinal numbers will lead (...) to Cantor’s theorem, the existence of large cardinals, and a counterexample to the continuum hypothesis. (shrink)

Pantheism claims: (1) there exists an all-inclusive unity; and (2) that unity is divine. I review three current and scientifically viable ontologies to see how pantheism can be developed in each. They are: (1) materialism; (2) Platonism; and (3) class-theoretic Pythagoreanism. I show how each ontology has an all-inclusive unity. I check the degree to which that unity is: eternal, infinite, complex, necessary, plentiful, self-representative, holy. I show how each ontology solves the problem of evil (its theodicy) and provides for (...) salvation (its soteriology). I conclude that Platonism and Pythagoreanism have the most divine all-inclusive unities. They support sophisticated contemporary pantheisms. (Published Online February 17 2004). (shrink)

In [12], Ernst Zermelo described a succession of models for the axioms of set theory as initial segments of a cumulative hierarchy of levelsUαVα. The recursive definition of theVα's is:Thus, a little reflection on the axioms of Zermelo-Fraenkel set theory shows thatVω, the first transfinite level of the hierarchy, is a model of all the axioms ofZFwith the exception of the axiom of infinity. And, in general, one finds that ifκis a strongly inaccessible ordinal, thenVκis a model of all of (...) the axioms ofZF. Doubtless, when cast as a first-order theory,ZFdoes not characterize the structures 〈Vκ,∈∩〉 forκa strongly inaccessible ordinal, by the Löwenheim-Skolem theorem. Still, one of the main achievements of [12] consisted in establishing that a characterization of these models can be attained when one ventures into second-order logic. For let second-orderZFbe, as usual, the theory that results fromZFwhen the axiom schema of replacement is replaced by its second-order universal closure. Then, it is a remarkable result due to Zermelo that second-orderZFcan only be satisfied in models of the form 〈Vκ,∈∩〉 forκa strongly inaccessible ordinal. (shrink)

I use modal logic and transfinite set-theory to define metaphysical foundations for a general theory of computation. A possible universe is a certain kind of situation; a situation is a set of facts. An algorithm is a certain kind of inductively defined property. A machine is a series of situations that instantiates an algorithm in a certain way. There are finite as well as transfinite algorithms and machines of any degree of complexity (e.g., Turing and super-Turing machines and more). There (...) are physically and metaphysically possible machines. There is an iterative hierarchy of logically possible machines in the iterative hierarchy of sets. Some algorithms are such that machines that instantiate them are minds. So there is an iterative hierarchy of finitely and transfinitely complex minds. (shrink)

In this paper, we sketch the development of two important themes of modern set theory, both of which can be regarded as growing out of work of Kurt Gödel. We begin with a review of some basic concepts and conventions of set theory.§0. The ordinal numbers were Georg Cantor's deepest contribution to mathematics. After the natural numbers 0, 1, …, n, … comes the first infinite ordinal number ω, followed by ω + 1, ω + 2, …, ω + ω, (...) … and so forth. ω is the first limit ordinal as it is neither 0 nor a successor ordinal. We follow the von Neumann convention, according to which each ordinal number α is identified with the set {ν ∣ ν α} of its predecessors. The ∈ relation on ordinals thus coincides with <. We have 0 = ∅ and α + 1 = α ∪ {α}. According to the usual set-theoretic conventions, ω is identified with the first infinite cardinal ℵ0, similarly for the first uncountable ordinal number ω1 and the first uncountable cardinal number ℵ1, etc. We thus arrive at the following picture:The von Neumann hierarchy divides the class V of all sets into a hierarchy of sets Vα indexed by the ordinal numbers. The recursive definition reads: ;Vλ = ∪v<λVv for limit ordinals λ. We can represent this hierarchy by the following picture. (shrink)

Three principal varieties of mathematical structuralism are compared: set-theoretic structuralism (‘STS’) using model theory, Shapiro's ante rem structuralism invoking sui generis universals (‘SGS’), and the author's modal-structuralism (‘MS’) invoking logical possibility. Several problems affecting STS are discussed concerning, e.g., multiplicity of universes. SGS overcomes these; but it faces further problems of its own, concerning, e.g., the very intelligibility of purely structural objects and relations. MS, in contrast, overcomes or avoids both sets of problems. Finally, it is argued that the modality (...) of MS or a close cousin appears at crucial junctures in both STS and SGS, so that the above outcome is not obviously tendentious. (shrink)

Modal structuralism promises an interpretation of set theory that avoids commitment to abstracta. This article investigates its underlying assumptions. In the first part, I start by highlighting some shortcomings of the standard axiomatisation of modal structuralism, and propose a new axiomatisation I call MSST (for Modal Structural Set Theory). The main theorem is that MSST interprets exactly Zermelo set theory plus the claim that every set is in some inaccessible rank of the cumulative hierarchy. In the second part of the (...) article, I look at the prospects for supplementing MSST with a modal structural reflection principle, as suggested in Hellman (2015). I show that Hellman’s principle is inconsistent (Theorem 5.32), and argue that modal structural reflection principles in general are either incompatible with modal structuralism or extremely weak. (shrink)

It is a commonplace of set theory to say that there is no set of all well-orderings nor a set of all sets. We are implored to accept this due to the threat of paradox and the ensuing descent into unintelligibility. In the absence of promising alternatives, we tend to take up a conservative stance and tow the line: there is no universe. In this paper, I am going to challenge this claim by taking seriously the idea that we can (...) talk about the collection of all the sets and many more collections beyond that. A method of articulating this idea is offered through an indefinitely extending hierarchy of set theories. It is argued that this approach provides a natural extension to ordinary set theory and leaves ordinary mathematical practice untouched. (shrink)

We develop the machinery for performing forcing over an arbitrary (possibly non-wellfounded) model of set theory. For consistency results, this machinery is unnecessary since such results can always be legitimately obtained by assuming that the ground model is (countable) transitive. However, for establishing properties of a given (possibly non-wellfounded) model, the fully developed machinery of forcing as a means to produce new related models can be useful. We develop forcing through iterated forcing, paralleling the standard steps of presentation found in (...) [19] and [14]. (shrink)

Adding higher types to set theory differs from adding inaccessible cardinals, in that higher type arguments apply to all sets rather than just ordinary ones. Levy's reflection axiom is justified, by considering the principle that we can pretend that the universe is a set, together with methods of Gaifman [8]. We reprove some results of Gaifman, and some facts about Levy's reflection axiom, including the fact that adding higher types yields no new theorems about sets. Some remarks on standard models (...) are made. An obvious strengthening of Levy's axiom to higher types is considered, which implies the existence of indescribable cardinals. Other remarks about larger cardinals are made; some questions of Gloede [9] are settled. Finally we argue that the evidence for V = L is strong, and that CH is certainly true. MSC: 03E30, 03E55. (shrink)

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by Loc(ZFC), says that every set belongs to a transitive model of ZFC. LZFC consists of Loc(ZFC) plus some elementary axioms forming Basic Set Theory (BST). Some theoretical reasons for this shift of view are given. All ${\Pi_2}$ consequences of ZFC are provable in LZFC. LZFC strongly extends Kripke-Platek (KP) set theory minus Δ0-Collection and minus ${\in}$ -induction scheme. ZFC+ “there is an (...) inaccessible cardinal” proves the consistency of LZFC. In LZFC we focus on models rather than cardinals, a transitive model being considered as the analogue of an inaccessible cardinal. Pushing this analogy further we define α-Mahlo models and ${\Pi_1^1}$ -indescribable models, the latter being the analogues of weakly compact cardinals. Also localization axioms of the form ${Loc({\rm ZFC}+\phi)}$ are considered and their global consequences are examined. Finally we introduce the concept of standard compact cardinal (in ZFC) and some standard compactness results are proved. (shrink)

This paper gives a recursive generalization of a strong notation system of ordinals, which was devellopped by Jäger [3]. The generalized systemT(V′) is based on a hierarchy of Veblen-functions for inaccessible ordinals. The definition ofT(V′) assumes the existence of a weak Mahlo-ordinal. The wellordering ofT(V′) is provable in a formal system of second order arithmetic with the axiom schema ofΠ 2 1 -comprehension in a similar way, as it is proved in [6] for the weaker notation systemT(V′).

We prove that if V = L then there is a $\Pi _{1}^{1}$ maximal orthogonal (i.e., mutually singular) set of measures on Cantor space. This provides a natural counterpoint to the well-known theorem of Preiss and Rataj [16] that no analytic set of measures can be maximal orthogonal.

In this paper we introduce a notation system for the infinitary derivations occurring in the ordinal analysis of KP + Π₃-Reflection due to Michael Rathjen. This allows a finitary ordinal analysis of KP + Π₃-Reflection. The method used is an extension of techniques developed by Wilfried Buchholz, namely operator controlled notation systems for RS∞-derivations. Similarly to Buchholz we obtain a characterisation of the provably recursive functions of KP + Π₃-Reflection as <-recursive functions where < is the ordering on Rathjen's ordinal (...) notation system J(K). Further we show a conservation result for $\Pi _{2}^{0}$-sentences. (shrink)

We define a subhierarchy of the infinitely deep languagesN described by Jaakko Hintikka and Veikko Rantala. We shall show that some model theoretic results well-known in the model theory of the ordinary infinitary languages can be generalized for these new languages. Among these are the downward Löwenheim-Skolem and o's theorems as well as some compactness properties.