Switch to: References

Add citations

You must login to add citations.
  1. Pure Logic and Higher-order Metaphysics.Christopher Menzel - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press.
    W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, due in (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Applied Mathematics without Numbers.Jack Himelright - 2023 - Philosophia Mathematica 31 (2):147-175.
    In this paper, I develop a "safety result" for applied mathematics. I show that whenever a theory in natural science entails some non-mathematical conclusion via an application of mathematics, there is a counterpart theory that carries no commitment to mathematical objects, entails the same conclusion, and the claims of which are true if the claims of the original theory are "correct": roughly, true given the assumption that mathematical objects exist. The framework used for proving the safety result has some advantages (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Reflection Principles and Second-Order Choice Principles with Urelements.Bokai Yao - 2022 - Annals of Pure and Applied Logic 173 (4):103073.
    We study reflection principles in Kelley-Morse set theory with urelements (KMU). We first show that First-Order Reflection Principle is not provable in KMU with Global Choice. We then show that KMU + Limitation of Size + Second-Order Reflection Principle is mutually interpretable with KM + Second-Order Reflection Principle. Furthermore, these two theories are also shown to be bi-interpretable with parameters. Finally, assuming the existence of a κ+-supercompact cardinal κ in KMU, we construct a model of KMU + Second-Order Reflection Principle (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Modal set theory.Christopher Menzel - 2018 - In Otávio Bueno & Scott A. Shalkowski (eds.), The Routledge Handbook of Modality. New York: Routledge.
    This article presents an overview of the basic philosophical motivations for, and some recent work in, modal set theory.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Purely Recombinatorial Puzzle.Fritz Peter - 2017 - Noûs 51 (3):547-564.
    A new puzzle of modal recombination is presented which relies purely on resources of first-order modal logic. It shows that naive recombinatorial reasoning, which has previously been shown to be inconsistent with various assumptions concerning propositions, sets and classes, leads to inconsistency by itself. The context sensitivity of modal expressions is suggested as the source of the puzzle, and it is argued that it gives us reason to reconsider the assumption that the notion of metaphysical necessity is in good standing.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Maximality Principles in Set Theory.Luca Incurvati - 2017 - Philosophia Mathematica 25 (2):159-193.
    In set theory, a maximality principle is a principle that asserts some maximality property of the universe of sets or some part thereof. Set theorists have formulated a variety of maximality principles in order to settle statements left undecided by current standard set theory. In addition, philosophers of mathematics have explored maximality principles whilst attempting to prove categoricity theorems for set theory or providing criteria for selecting foundational theories. This article reviews recent work concerned with the formulation, investigation and justification (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • When Do Some Things Form a Set?Simon Hewitt - 2015 - Philosophia Mathematica 23 (3):311-337.
    This paper raises the question under what circumstances a plurality forms a set, parallel to the Special Composition Question for mereology. The range of answers that have been proposed in the literature are surveyed and criticised. I argue that there is good reason to reject both the view that pluralities never form sets and the view that pluralities always form sets. Instead, we need to affirm restricted set formation. Casting doubt on the availability of any informative principle which will settle (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Necessitism and Unrestricted Quantification.Violeta Conde - 2023 - Teorema: International Journal of Philosophy 42 (2):7 - 24.
    As Williamson puts it, ‘necessitism’ is the metaphysical view that claims that “necessarily everything is necessarily something”. As that claim involves modal unrestricted quantification, the necessitist must accept it as a part of an intelligible discourse. Here, I present one of the main objections that have been presented against the intelligibility of unrestricted quantification: the objection based on the so-called All-in-One Principle. I then propose possible strategies that the necessitist could adopt to shield themselves from the objection.
    Download  
     
    Export citation  
     
    Bookmark  
  • Level theory, part 1: Axiomatizing the bare idea of a cumulative hierarchy of sets.Tim Button - 2021 - Bulletin of Symbolic Logic 27 (4):436-460.
    The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets found before S, we find a set whose members are exactly those sets. We find nothing else at S.' Surprisingly, this story already guarantees that the sets are arranged in well-ordered levels, and suffices for quasi-categoricity. I show this by presenting Level Theory, a simplification of set theories (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Level Theory, Part 2: Axiomatizing the Bare Idea of a Potential Hierarchy.Tim Button - 2021 - Bulletin of Symbolic Logic 27 (4):461-484.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Quantification and Paradox.Edward Ferrier - 2018 - Dissertation, University of Massachusetts Amherst
    I argue that absolutism, the view that absolutely unrestricted quantification is possible, is to blame for both the paradoxes that arise in naive set theory and variants of these paradoxes that arise in plural logic and in semantics. The solution is restrictivism, the view that absolutely unrestricted quantification is not possible. -/- It is generally thought that absolutism is true and that restrictivism is not only false, but inexpressible. As a result, the paradoxes are blamed, not on illicit quantification, but (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A neglected resolution of Russell’s paradox of propositions.Gabriel Uzquiano - 2015 - Review of Symbolic Logic 8 (2):328-344.
    Bertrand Russell offered an influential paradox of propositions in Appendix B of The Principles of Mathematics, but there is little agreement as to what to conclude from it. We suggest that Russell's paradox is best regarded as a limitative result on propositional granularity. Some propositions are, on pain of contradiction, unable to discriminate between classes with different members: whatever they predicate of one, they predicate of the other. When accepted, this remarkable fact should cast some doubt upon some of the (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Worlds and Propositions Set Free.Otávio Bueno, Christopher Menzel & Edward N. Zalta - 2014 - Erkenntnis 79 (4):797–820.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Modality and Paradox.Gabriel Uzquiano - 2015 - Philosophy Compass 10 (4):284-300.
    Philosophers often explain what could be the case in terms of what is, in fact, the case at one possible world or another. They may differ in what they take possible worlds to be or in their gloss of what is for something to be the case at a possible world. Still, they stand united by the threat of paradox. A family of paradoxes akin to the set-theoretic antinomies seem to allow one to derive a contradiction from apparently plausible principles. (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Foundations of applied mathematics I.Jeffrey Ketland - 2021 - Synthese 199 (1-2):4151-4193.
    This paper aims to study the foundations of applied mathematics, using a formalized base theory for applied mathematics: ZFCAσ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathsf {ZFCA}_{\sigma }$$\end{document} with atoms, where the subscript used refers to a signature specific to the application. Examples are given, illustrating the following five features of applied mathematics: comprehension principles, application conditionals, representation hypotheses, transfer principles and abstract equivalents.
    Download  
     
    Export citation  
     
    Bookmark   2 citations