This paper is concerned with the way different axiom systems for set theory can be justified by appeal to such intuitions as limitation of size, predicativity, stratification, etc. While none of the different conceptions historically resulting from the impetus to provide a solution to the paradoxes turns out to rest on an intuition providing an unshakeable foundation,'each supplies a picture of the set-theoretic universe that is both useful and internally well motivated. The same is true of more recently proposed axiom (...) systems for non-well-founded universes, and an attempt is made to motivate such axiom systems on the basis of an old and respected ‘algebraic’ intuition. (shrink)

Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, with (...) Level Theory, as developed in Part 1. (shrink)

This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.

For the modern set theorist the empty set Ø, the singleton {a}, and the ordered pair 〈x, y〉 are at the beginning of the systematic, axiomatic development of set theory, both as a field of mathematics and as a unifying framework for ongoing mathematics. These notions are the simplest building locks in the abstract, generative conception of sets advanced by the initial axiomatization of Ernst Zermelo [1908a] and are quickly assimilated long before the complexities of Power Set, Replacement, and Choice (...) are broached in the formal elaboration of the ‘set of’f {} operation. So it is surprising that, while these notions are unproblematic today, they were once sources of considerable concern and confusion among leading pioneers of mathematical logic like Frege, Russell, Dedekind, and Peano. In the development of modern mathematical logic out of the turbulence of 19th century logic, the emergence of the empty set, the singleton, and the ordered pair as clear and elementary set-theoretic concepts serves as amotif that reflects and illuminates larger and more significant developments in mathematical logic: the shift from the intensional to the extensional viewpoint, the development of type distinctions, the logical vs. the iterative conception of set, and the emergence of various concepts and principles as distinctively set-theoretic rather than purely logical. Here there is a loose analogy with Tarski's recursive definition of truth for formal languages: The mathematical interest lies mainly in the procedure of recursion and the attendant formal semantics in model theory, whereas the philosophical interest lies mainly in the basis of the recursion, truth and meaning at the level of basic predication. Circling back to the beginning, we shall see how central the empty set, the singleton, and the ordered pair were, after all. (shrink)

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

In “Semantics of Fictional Terms,” Garcia-Carpintero critically surveys the most recent literature on the topic of fictional names. One of his targets is realism about fictional discourse. Realists about fictional discourse believe that: (a) it contains true sentences that have fictional names as their subjects; (b) sentences containing names can be true only if those names have referents; (c) fictional names have fictional characters – abstract objects – as their referents. The fundamental problem that arises for realists is that not (...) all true sentences containing fictional names are plausibly about abstract objects. This leads to the need to introduce disjunctive conceptions of property attribution that Garcia-Carpintero claims are implausible, and that realism should therefore be rejected. He also maintains, however, that (a) is correct. I agree. Furthermore, I am also committed to anti-realism about fictional discourse – that fictional names have no referents. Garcia-Carpintero claims that my view is simply a notational variant of realism. I argue that this is false – that my view could not possibly be a notational variant of any extant realist theory. (shrink)

This paper reviews the claims of several main-stream candidates to be the foundations of mathematics, including set theory. The review concludes that at this level of mathematical knowledge it would be very unreasonable to settle with any one of these foundations and that the only reasonable choice is a pluralist one.

In this paper, we offer a contribution to the discussion of one of the most important objections against a relativist position in the absolute generality debate. The inexpressibility objection accuses the generality-relativist of not being able to coherently express her own position. First, we examine Glanzberg’s attempt to reply to this objection and we show that it fails. Second, we study the prospects of generalizing the relativist position. In particular, we analyze Fine’s and Linnebo’s modal approaches and we argue that, (...) even though they are able to coherently express one of the core ideas of relativism while avoiding the inexpressibility objection, there is an important sense in which they are no longer relativist positions. Third, while strengthening the idea that the inexpressibility objection does succeed, we argue that this is no guarantee of the falsity of relativism. Relativism may be inexpressible but true. However, we stress that even if the inexpressibility objection does not supply a definitive, knock-down objection against relativism, if we want to discuss relativism in a rational way, the objection offers a compelling reason not to embrace generality-relativism. (shrink)

This monograph proposes a new way of implementing interaction in logic. It also provides an elementary introduction to Constructive Type Theory. The authors equally emphasize basic ideas and finer technical details. In addition, many worked out exercises and examples will help readers to better understand the concepts under discussion. One of the chief ideas animating this study is that the dialogical understanding of definitional equality and its execution provide both a simple and a direct way of implementing the CTT approach (...) within a game-theoretical conception of meaning. In addition, the importance of the play level over the strategy level is stressed, binding together the matter of execution with that of equality and the finitary perspective on games constituting meaning. According to this perspective the emergence of concepts are not only games of giving and asking for reasons, they are also games that include moves establishing how it is that the reasons brought forward accomplish their explicative task. Thus, immanent reasoning games are dialogical games of Why and How. (shrink)

There is no prospect of discovering measurable cardinals by radio astronomy, but this does not mean that higher set theory is entirely irrelevant to applied mathematics broadly construed. By way of example, the bearing of some celebrated descriptive-set-theoretic consequences of large cardinals on measurable-selection theory, a body of results originating with a key lemma in von Neumann’s work on the mathematical foundations of quantum theory, and further developed in connection with problems of mathematical economics, will be considered from a philosophical (...) point of view. (shrink)

The authors provide an object-theoretic analysis of two paradoxes in the theory of possible worlds and propositions stemming from Russell and Kaplan. After laying out the paradoxes, the authors provide a brief overview of object theory and point out how syntactic restrictions that prevent object-theoretic versions of the classical paradoxes are justified philosophically. The authors then trace the origins of the Russell paradox to a problematic application of set theory in the definition of worlds. Next the authors show that an (...) object-theoretic analysis of the Kaplan paradox reveals that there is no genuine paradox at all, as the central premise of the paradox is simply a logical falsehood and hence can be rejected on the strongest possible grounds—not only in object theory but for the very framework of propositional modal logic in which Kaplan frames his argument. The authors close by fending off a possible objection that object theory avoids the Russell paradox only by refusing to incorporate set theory and, hence, that the object-theoretic solution is only a consequence of the theory’s weakness. (shrink)

Most philosophers take Benacerraf’s argument in ‘What numbers could not be’ to rebut successfully the reductionist view that numbers are sets. This philosophical consensus jars with mathematical practice, in which reductionism continues to thrive. In this note, we develop a new challenge to Benacerraf’s argument by contesting a central premise which is almost unanimously accepted in the literature. Namely, we argue that — contra orthodoxy — there are metaphysically relevant reasons to prefer von Neumann ordinals over other set-theoretic reductions of (...) arithmetic. In doing so, we provide set-theoretical facts which, we believe, are crucial for informed assessment of reductionism. (shrink)

What counts as an intuitively plausible set theoretic content (notion, axiom or theorem) has been a matter of much debate in contemporary philosophy of mathematics. In this paper I develop a critical appraisal of the issue. I analyze first R. B. Jensen's positions on the epistemic status of the axiom of constructibility. I then formulate and discuss a view of intuitiveness in set theory that assumes it to hinge basically on mathematical success. At the same time, I present accounts of (...) set theoretic axioms and theorems formulated in non-strictly mathematical terms, e.g., by appealing to the iterative concept of set and/or to overall methodological principles, like unify and maximize, and investigate the relation of the latter to success in mathematics. (shrink)

We review different conceptions of the set-theoretic multiverse and evaluate their features and strengths. In Sect. 1, we set the stage by briefly discussing the opposition between the ‘universe view’ and the ‘multiverse view’. Furthermore, we propose to classify multiverse conceptions in terms of their adherence to some form of mathematical realism. In Sect. 2, we use this classification to review four major conceptions. Finally, in Sect. 3, we focus on the distinction between actualism and potentialism with regard to the (...) universe of sets, then we discuss the Zermelian view, featuring a ‘vertical’ multiverse, and give special attention to this multiverse conception in light of the hyperuniverse programme introduced in Arrigoni and Friedman (2013). We argue that the distinctive feature of the multiverse conception chosen for the hyperuniverse programme is its utility for finding new candidates for axioms of set theory. (shrink)

This article addresses the question of fundamental entities in set theory. It takes up J. Hamkins’ claim that models of set theory are such fundamental entities and investigates it using the methodology of P. Maddy’s naturalism, Second Philosophy. In accordance with this methodology, I investigate the historical case study of the use of models in the introduction of forcing, compare this case to contemporary practice and give a systematic account of how set-theoretic practice can be said to introduce models as (...) new entities. In conclusion, I argue for a view that takes both sets and models to be fundamental entities in set theory. (shrink)

The use of multiple means of determination to “triangulate” on the existence and character of a common phenomenon, object, or result has had a long tradition in science but has seldom been a matter of primary focus. As with many traditions, it is traceable to Aristotle, who valued having multiple explanations of a phenomenon, and it may also be involved in his distinction between special objects of sense and common sensibles. It is implicit though not emphasized in the distinction between (...) primary and secondary qualities from Galileo onward. It is arguably one of several conceptions involved in Whewell’s method of the “consilience of inductions” (Laudan 1971) and is to be found in several places in Peirce. (From M. Brewer and B. Collins, eds., (1981); Scientific Inquiry in the Social Sciences (a festschrift for Donald T. Campbell), San Francisco: Jossey-Bass, pp. 123–162.). (shrink)

On October 4, 1937, Zermelo composed a small note entitled “Der Relativismus in der Mengenlehre und der sogenannte Skolemsche Satz”(“Relativism in Set Theory and the So-Called Theorem of Skolem”) in which he gives a refutation of “Skolem's paradox”, i.e., the fact that Zermelo-Fraenkel set theory—guaranteeing the existence of uncountably many sets—has a countable model. Compared with what he wished to disprove, the argument fails. However, at a second glance, it strongly documents his view of mathematics as based on a world (...) of objects that could only be grasped adequately by infinitary means. So the refutation might serve as a final clue to his epistemological credo.Whereas the Skolem paradox was to raise a lot of concern in the twenties and the early thirties, it seemed to have been settled by the time Zermelo wrote his paper, namely in favour of Skolem's approach, thus also accepting the noncategoricity and incompleteness of the first-order axiom systems. So the paper might be considered a late-comer in a community of logicians and set theorists who mainly followed finitary conceptions, in particular emphasizing the role of first-order logic (cf. [8]). However, Zermelo never shared this viewpoint: In his first letter to Gödel of September 21, 1931, (cf. [1]) he had written that the Skolem paradox rested on the erroneous assumption that every mathematically definable notion should be expressible by a finite combination of signs, whereas a reasonable metamathematics would only be possible after this “finitistic prejudice” would have been overcome, “a task I have made my particular duty”. (shrink)

In this article, I develop a novel version of the multiverse theory of sets called hierarchical pluralism by introducing the notion of “degrees of intentionality” of theories. The presented view is articulated for the purpose of reconciling epistemological realism and the multiverse theory of sets so as to preserve a considerable amount of epistemic objectivity when working with the multiverse theory. I give some arguments in favor of a hierarchical picture of the multiverse in which theories or models are thought (...) to be ordered with respect to their plausibility as a manifestation of endorsing the idea that some set theories are more plausible than others. The proposed multiverse account settles the pluralist’s dilemma, the dichotomy that there is a trade-off between the richness of mathematical ontology and the objectivity of mathematical truth. The view also extends and serves as an alternative position to Balaguer’s intention-based Platonism, from which he claims that a certain version of mathematical pluralism follows. (shrink)

This paper seeks to question the position of ZF as the dominant system of set theory, and in particular to examine whether there is any philosophical justification for the axiom of foundation. After some historical observations regarding Poincare and Russell, and the notions of circularity and hierarchy, the iterative conception of set is argued to be a semi-constructvist hybrid without philosophical coherence. ZF cannot be justified as necessary to avoid paradoxes, as axiomatizing a coherent notion of set, nor on pragmatic (...) grounds, and should be replaced by a system allowing non-well-founded sets. (shrink)

The Hyperuniverse Programme, introduced in Arrigoni and Friedman (2013), fosters the search for new set-theoretic axioms. In this paper, we present the procedure envisaged by the programme to find new axioms and the conceptual framework behind it. The procedure comes in several steps. Intrinsically motivated axioms are those statements which are suggested by the standard concept of set, i.e. the `maximal iterative concept', and the programme identi fies higher-order statements motivated by the maximal iterative concept. The satisfaction of these statements (...) (H-axioms) in countable transitive models, the collection of which constitutes the `hyperuniverse' (H), has remarkable 1st-order consequences, some of which we review in section 5. (shrink)

On Zermelo's view, any mathematical theory presupposes a non-empty domain, the elements of which enjoy equal status; furthermore, mathematical axioms must be chosen from among those propositions that reflect the equal status of domain elements. As for which propositions manage to do this, Zermelo's answer is, those that are ?symmetric?, meaning ?invariant under domain permutations?. We argue that symmetry constitutes Zermelo's conceptual analysis of ?general proposition?. Further, although others are commonly associated with the extension of Klein's Erlanger Programme to logic, (...) Zermelo's name has a place in that story. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

This monograph proposes a new way of studying the different forms of correlational inference, known in the Islamic jurisprudence as qiyās. According to the authors’ view, qiyās represents an innovative and sophisticated form of dialectical reasoning that not only provides new epistemological insights into legal argumentation in general but also furnishes a fine-grained pattern for parallel reasoning which can be deployed in a wide range of problem-solving contexts and does not seem to reduce to the standard forms of analogical reasoning (...) studied in contemporary philosophy of science and argumentation theory. After an overview of the emergence of qiyās and of the work of al-Shīrāzī penned by Soufi Youcef, the authors discuss al-Shīrāzī’s classification of correlational inferences of the occasioning factor. The second part of the volume deliberates on the system of correlational inferences by indication and resemblance. The third part develops the main theoretical background of the authors’ work, namely, the dialogical approach to Martin-Löf's Constructive Type Theory. The authors present this in a general form and independently of adaptations deployed in parts I and II. Part III also includes an appendix on the relevant notions of Constructive Type Theory, which has been extracted from an overview written by Ansten Klev. The book concludes with some brief remarks on contemporary approaches to analogy in Common and Civil Law and also to parallel reasoning in general. (shrink)

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term (...) itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

Might it be that world itself, independently of what we know about it or how we represent it, is metaphysically indeterminate? This article tackles in turn a series of questions: In what sorts of cases might we posit metaphysical indeterminacy? What is it for a given case of indefiniteness to be 'metaphysical'? How does the phenomenon relate to 'ontic vagueness', the existence of 'vague objects', 'de re indeterminacy' and the like? How might the logic work? Are there reasons for postulating (...) this distinctive sort of indefiniteness? Conversely, are there reasons for denying that there is indefiniteness of this sort? (shrink)

In the recent literature we find various arguments against the possibility of absolutely general quantification. Far from being merely a technical question in the philosophy of logic, the impossibility of absolutely general quantification (if established) would have severe consequence for ontology, for it would imply the non-existence of the world as traditionally conceived. This paper will investigate these implications for ontology and consider some possible ways of addressing them.

We show that the categoricity of second-order Peano axioms can be proved from the comprehension axioms. We also show that the categoricity of second-order Zermelo–Fraenkel axioms, given the order type of the ordinals, can be proved from the comprehension axioms. Thus these well-known categoricity results do not need the so-called “full” second-order logic, the Henkin second-order logic is enough. We also address the question of “consistency” of these axiom systems in the second-order sense, that is, the question of existence of (...) models for these systems. In both cases we give a consistency proof, but naturally we have to assume more than the mere comprehension axioms. (shrink)

On October 4, 1937, Zermelo composed a small note entitled “Der Relativismus in der Mengenlehre und der sogenannte Skolemsche Satz” in which he gives a refutation of “Skolem's paradox”, i.e., the fact that Zermelo-Fraenkel set theory—guaranteeing the existence of uncountably many sets—has a countable model. Compared with what he wished to disprove, the argument fails. However, at a second glance, it strongly documents his view of mathematics as based on a world of objects that could only be grasped adequately by (...) infinitary means. So the refutation might serve as a final clue to his epistemological credo.Whereas the Skolem paradox was to raise a lot of concern in the twenties and the early thirties, it seemed to have been settled by the time Zermelo wrote his paper, namely in favour of Skolem's approach, thus also accepting the noncategoricity and incompleteness of the first-order axiom systems. So the paper might be considered a late-comer in a community of logicians and set theorists who mainly followed finitary conceptions, in particular emphasizing the role of first-order logic. However, Zermelo never shared this viewpoint: In his first letter to Gödel of September 21, 1931, he had written that the Skolem paradox rested on the erroneous assumption that every mathematically definable notion should be expressible by a finite combination of signs, whereas a reasonable metamathematics would only be possible after this “finitistic prejudice” would have been overcome, “a task I have made my particular duty”. (shrink)

On October 4, 1937, Zermelo composed a small note entitled “Der Relativismus in der Mengenlehre und der sogenannte Skolemsche Satz”(“Relativism in Set Theory and the So-Called Theorem of Skolem”) in which he gives a refutation of “Skolem's paradox”, i.e., the fact that Zermelo-Fraenkel set theory—guaranteeing the existence of uncountably many sets—has a countable model. Compared with what he wished to disprove, the argument fails. However, at a second glance, it strongly documents his view of mathematics as based on a world (...) of objects that could only be grasped adequately by infinitary means. So the refutation might serve as a final clue to his epistemological credo.Whereas the Skolem paradox was to raise a lot of concern in the twenties and the early thirties, it seemed to have been settled by the time Zermelo wrote his paper, namely in favour of Skolem's approach, thus also accepting the noncategoricity and incompleteness of the first-order axiom systems. So the paper might be considered a late-comer in a community of logicians and set theorists who mainly followed finitary conceptions, in particular emphasizing the role of first-order logic (cf. [8]). However, Zermelo never shared this viewpoint: In his first letter to Gödel of September 21, 1931, (cf. [1]) he had written that the Skolem paradox rested on the erroneous assumption that every mathematically definable notion should be expressible by a finite combination of signs, whereas a reasonable metamathematics would only be possible after this “finitistic prejudice” would have been overcome, “a task I have made my particular duty”. (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)

The paper is concerned with the bad company problem as an instance of a more general difficulty in the philosophy of mathematics. The paper focuses on the prospects of stability as a necessary condition on acceptability. However, the conclusion of the paper is largely negative. As a solution to the bad company problem, stability would undermine the prospects of a neo-Fregean foundation for set theory, and, as a solution to the more general difficulty, it would impose an unreasonable constraint on (...) mathematical practice. (shrink)

In this paper we discuss a particular example of the passage from the informal, but rigorous description of a concept to the axiomatic formulation of principles holding for the concept; in particular, we look at the principles of continuity and lawlike choice in the theory of lawless sequences. Our discussion also leads to a better understanding of the rôle of the so-called density axiom for lawless sequences.

Set theory faces two difficulties: formal definitions of sets/subsets are incapable of assessing biophysical issues; formal axiomatic systems are complete/inconsistent or incomplete/consistent. To overtake these problems reminiscent of the old-fashioned principle of individuation, we provide formal treatment/validation/operationalization of a methodological weapon termed “outer approach” (OA). The observer’s attention shifts from the system under evaluation to its surroundings, so that objects are investigated from outside. Subsets become just “holes” devoid of information inside larger sets. Sets are no longer passive containers, rather (...) active structures enabling their content’s examination. Consequences/applications of OA include: a) operationalization of paraconsistent logics, anticipated by unexpected forerunners, in terms of advanced truth theories of natural language; b) assessment of embryonic craniocaudal migration in terms of Turing’s spots; c) evaluation of hominids’ social behaviors in terms of evolutionary modifications of facial expression’s musculature; d) treatment of cortical action potentials in terms of collective movements of extracellular currents, leaving apart what happens inside the neurons; e) a critique of Shannon’s information in terms of the Arabic thinkers’ active/potential intellects. Also, OA provides an outer view of a) humanistic issues such as the enigmatic Celestino of Verona’s letter, Dante Alighieri’s “Hell” and the puzzling Voynich manuscript; b) historical issues such as Aldo Moro’s death. Summarizing, we suggest that the safest methodology to quantify phenomena is to remove them from our observation and tackle an outer view, since mathematical/logical issues such as selective information deletion and set complement rescue incompleteness/inconsistency of biophysical systems. (shrink)

The paper argues against an intuitive reading of the Stone-von Neumann theorem as a categoricity result, thereby pointing out that this theorem does not entail any model-theoretical difference between the theories that validate it and those that don't.

In papers published between 1930 and 1935. Zermelo outlines a foundational program, with infinitary logic at its heart, that is intended to (1) secure axiomatic set theory as a foundation for arithmetic and analysis and (2) show that all mathematical propositions are decidable. Zermelo's theory of systems of infinitely long propositions may be termed "Cantorian" in that a logical distinction between open and closed domains plays a signal role. Well-foundedness and strong inaccessibility are used to systematically integrate highly transfinite concepts (...) of demonstrability and existence. Zermelo incompleteness is then the analogue of the Problem of Proper Classes, and the resolution of these two anomalies is similarly analogous. (shrink)

Symmetric propositions over domain $\mathfrak{D}$ and signature $\Sigma = \langle R^{n_1}_1, \ldots, R^{n_p}_p \rangle$ are characterized following Zermelo, and a correlation of such propositions with logical type- $\langle \vec{n} \rangle$ quantifiers over $\mathfrak{D}$ is described. Boolean algebras of symmetric propositions over $\mathfrak{D}$ and Σ are shown to be isomorphic to algebras of logical type- $\langle \vec{n} \rangle$ quantifiers over $\mathfrak{D}$. This last result may provide empirical support for Tarski’s claim that logical terms over fixed domain are all and only those (...) invariant under domain permutations. (shrink)

Wilfred Sieg. Relative Consistency and Accesible Domains.

In this paper we continue the study of inner models of the type studied inInner models for set theory—Part I.The present paper is concerned exclusively with a particular kind of model, the ‘super-complete models’ defined in section 2.4 of I. The condition of 2.4 and the completeness condition 1.42 imply that such a model is uniquely determined when its universal class Vmis given. Writing condition and the completeness conditions 1.41, 1.42 in terms of Vm, we may state the definition in (...) the form:3.1. Dfn.A classVmis said to determine a super-complete model if the model whose basic notions are defined by,satisfies axiomsA, B, C.N. B. This definition is not necessarily metamathematical in nature. If desired, it could be written out quite formally as the definition of a notion ‘SCM’ thus:whereψ is the propositional function expressing in terms ofUthe fact that the model determined byUaccording to 3.1 satisfies the relativization of axioms A, B, C. E.g. corresponding to axiom A1m, i.e.,,ψ contains the equivalent term. All the relativized axioms can be similarly expressed in this way by first writing out the relativized form and then replacing ‘ϕ bywhich is in turn replaced by, and similarly replacing ‘ϕ’ by ‘ϕ’ by ‘), andThusψ is obtained in primitive notation. (shrink)

1. Philosophical background: iteration, ineffability, reflection. There are at least two heuristic motivations for the axioms of standard set theory, by which we mean, as usual, first-order Zermelo–Fraenkel set theory with the axiom of choice (ZFC): the iterative conception and limitation of size (see Boolos, 1989). Each strand provides a rather hospitable environment for the hypothesis that the set-theoretic universe is ineffable, which is our target in this paper, although the motivation is different in each case.

A number of authors have recently weighed in on the issue of whether it is coherent to have bound variables that range over absolutely everything. Prima facie, it is difficult, and perhaps impossible, to coherently state the “relativist” position without violating it. For example, the relativist might say, or try to say, that for any quantifier used in a proposition of English, there is something outside of its range. What is the range of this quantifier? Or suppose we ask the (...) relativist if there are some things that cannot appear in the range of any bound variable. The likely response would be along these lines: “No. For each object o, it possible to include o in the range of quantifiers, but one cannot quantify over everything at once.” This sentence contains unrestricted quantifiers, or so it seems, pending some clever move from a relativist. On the other hand, in the context of set theory, the reasoning behind the Burali-Forti paradox strongly suggests that there are well-orderings strictly longer than the collection of all ordinals. And set theorists regularly do transfinite recursions and transfinite reductions along such well-orderings. The relativist simply points out that one can always define new ordinals, and thus expand the range of one’s bound variables. The purpose of this paper is to explore the iterative framework, proposed in Zermelo’s 1930 paper, “Über Grenzzahlen und Mengenbereiche” (“On boundary numbers and domains of sets”), in order to shed light on these issues, and see what is involved in resolving them. (shrink)