Switch to: References

Citations of:

On the question of absolute undecidability

In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Philosophia Mathematica. Association for Symbolic Logic. pp. 153-188 (2010)

Add citations

You must login to add citations.
  1. Epistemic Modality and Hyperintensionality in Mathematics.Timothy Bowen - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Modality and Hyperintensionality in Mathematics.Timothy Bowen - manuscript
    This paper aims to contribute to the analysis of the nature of mathematical modality and hyperintensionality, and to the applications of the latter to absolute decidability. Rather than countenancing the interpretational type of mathematical modality as a primitive, I argue that the interpretational type of mathematical modality is a species of epistemic modality. I argue, then, that the framework of two-dimensional semantics ought to be applied to the mathematical setting. The framework permits of a formally precise account of the priority (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Mathematics and Metaphilosophy.Justin Clarke-Doane - 2022 - Cambridge: Cambridge University Press.
    This book discusses the problem of mathematical knowledge, and its broader philosophical ramifications. It argues that the problem of explaining the (defeasible) justification of our mathematical beliefs (‘the justificatory challenge’), arises insofar as disagreement over axioms bottoms out in disagreement over intuitions. And it argues that the problem of explaining their reliability (‘the reliability challenge’), arises to the extent that we could have easily had different beliefs. The book shows that mathematical facts are not, in general, empirically accessible, contra Quine, (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Models as Fundamental Entities in Set Theory: A Naturalistic and Practice-based Approach.Carolin Antos - 2022 - Erkenntnis 89 (4):1683-1710.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Abstracta and Possibilia: Hyperintensional Foundations of Mathematical Platonism.Timothy Bowen - manuscript
    This paper aims to provide hyperintensional foundations for mathematical platonism. I examine Hale and Wright's (2009) objections to the merits and need, in the defense of mathematical platonism and its epistemology, of the thesis of Necessitism. In response to Hale and Wright's objections to the role of epistemic and metaphysical modalities in providing justification for both the truth of abstraction principles and the success of mathematical predicate reference, I examine the Necessitist commitments of the abundant conception of properties endorsed by (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Search for New Axioms in the Hyperuniverse Programme.Claudio Ternullo & Sy-David Friedman - 2016 - In Francesca Boccuni & Andrea Sereni (eds.), Objectivity, Realism, and Proof. FilMat Studies in the Philosophy of Mathematics. Cham, Switzerland: Springer International Publishing. pp. 165-188.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Отвъд машината на Тюринг: квантовият компютър.Vasil Penchev - 2014 - Sofia: BAS: ISSK (IPS).
    Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Metasemantic Challenge for Mathematical Determinacy.Jared Warren & Daniel Waxman - 2020 - Synthese 197 (2):477-495.
    This paper investigates the determinacy of mathematics. We begin by clarifying how we are understanding the notion of determinacy before turning to the questions of whether and how famous independence results bear on issues of determinacy in mathematics. From there, we pose a metasemantic challenge for those who believe that mathematical language is determinate, motivate two important constraints on attempts to meet our challenge, and then use these constraints to develop an argument against determinacy and discuss a particularly popular approach (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • What Model Companionship Can Say About the Continuum Problem.Giorgio Venturi & Matteo Viale - forthcoming - Review of Symbolic Logic:1-40.
    We present recent results on the model companions of set theory, placing them in the context of a current debate in the philosophy of mathematics. We start by describing the dependence of the notion of model companionship on the signature, and then we analyze this dependence in the specific case of set theory. We argue that the most natural model companions of set theory describe (as the signature in which we axiomatize set theory varies) theories of $H_{\kappa ^+}$, as $\kappa (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An indeterminate universe of sets.Chris Scambler - 2020 - Synthese 197 (2):545-573.
    In this paper, I develop a view on set-theoretic ontology I call Universe-Indeterminism, according to which there is a unique but indeterminate universe of sets. I argue that Solomon Feferman’s work on semi-constructive set theories can be adapted to this project, and develop a philosophical motivation for a semi-constructive set theory closely based on Feferman’s but tailored to the Universe-Indeterminist’s viewpoint. I also compare the emergent Universe-Indeterminist view to some more familiar views on set-theoretic ontology.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Modal structuralism and reflection.Sam Roberts - 2019 - Review of Symbolic Logic 12 (4):823-860.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Mathematical instrumentalism, Gödel’s theorem, and inductive evidence.Alexander Paseau - 2011 - Studies in History and Philosophy of Science Part A 42 (1):140-149.
    Mathematical instrumentalism construes some parts of mathematics, typically the abstract ones, as an instrument for establishing statements in other parts of mathematics, typically the elementary ones. Gödel’s second incompleteness theorem seems to show that one cannot prove the consistency of all of mathematics from within elementary mathematics. It is therefore generally thought to defeat instrumentalisms that insist on a proof of the consistency of abstract mathematics from within the elementary portion. This article argues that though some versions of mathematical instrumentalism (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Against the Judgment-Dependence of Mathematics and Logic.Alexander Paseau - 2012 - Erkenntnis 76 (1):23-40.
    Although the case for the judgment-dependence of many other domains has been pored over, surprisingly little attention has been paid to mathematics and logic. This paper presents two dilemmas for a judgment-dependent account of these areas. First, the extensionality-substantiality dilemma: in each case, either the judgment-dependent account is extensionally inadequate or it cannot meet the substantiality condition (roughly: non-vacuous specification). Second, the extensionality-extremality dilemma: in each case, either the judgment-dependent account is extensionally inadequate or it cannot meet the extremality condition (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computing the uncomputable; or, The discrete charm of second-order simulacra.Matthew W. Parker - 2009 - Synthese 169 (3):447-463.
    We examine a case in which non-computable behavior in a model is revealed by computer simulation. This is possible due to differing notions of computability for sets in a continuous space. The argument originally given for the validity of the simulation involves a simpler simulation of the simulation, still further simulations thereof, and a universality conjecture. There are difficulties with that argument, but there are other, heuristic arguments supporting the qualitative results. It is urged, using this example, that absolute validation, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Intrinsic Justifications for Large-Cardinal Axioms.Rupert McCallum - 2021 - Philosophia Mathematica 29 (2):195-213.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Strong logics of first and second order.Peter Koellner - 2010 - Bulletin of Symbolic Logic 16 (1):1-36.
    In this paper we investigate strong logics of first and second order that have certain absoluteness properties. We begin with an investigation of first order logic and the strong logics ω-logic and β-logic, isolating two facets of absoluteness, namely, generic invariance and faithfulness. It turns out that absoluteness is relative in the sense that stronger background assumptions secure greater degrees of absoluteness. Our aim is to investigate the hierarchies of strong logics of first and second order that are generically invariant (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • On reflection principles.Peter Koellner - 2009 - Annals of Pure and Applied Logic 157 (2-3):206-219.
    Gödel initiated the program of finding and justifying axioms that effect a significant reduction in incompleteness and he drew a fundamental distinction between intrinsic and extrinsic justifications. Reflection principles are the most promising candidates for new axioms that are intrinsically justified. Taking as our starting point Tait’s work on general reflection principles, we prove a series of limitative results concerning this approach. These results collectively show that general reflection principles are either weak ) or inconsistent. The philosophical significance of these (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Incompatible Ω-Complete Theories.Peter Koellner & W. Hugh Woodin - 2009 - Journal of Symbolic Logic 74 (4):1155 - 1170.
    In 1985 the second author showed that if there is a proper class of measurable Woodin cardinals and $V^{B1} $ and $V^{B2} $ are generic extensions of V satisfying CH then $V^{B1} $ and $V^{B2} $ agree on all $\Sigma _1^2 $ -statements. In terms of the strong logic Ω-logic this can be reformulated by saying that under the above large cardinal assumption ZFC + CH is Ω-complete for $\Sigma _1^2 $ Moreover. CH is the unique $\Sigma _1^2 $ -statement (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Gödel and set theory.Akihiro Kanamori - 2007 - Bulletin of Symbolic Logic 13 (2):153-188.
    Kurt Gödel with his work on the constructible universeLestablished the relative consistency of the Axiom of Choice and the Continuum Hypothesis. More broadly, he ensured the ascendancy of first-order logic as the framework and a matter of method for set theory and secured the cumulative hierarchy view of the universe of sets. Gödel thereby transformed set theory and launched it with structured subject matter and specific methods of proof. In later years Gödel worked on a variety of set theoretic constructions (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Maximality and ontology: how axiom content varies across philosophical frameworks.Sy-David Friedman & Neil Barton - 2017 - Synthese 197 (2):623-649.
    Discussion of new axioms for set theory has often focused on conceptions of maximality, and how these might relate to the iterative conception of set. This paper provides critical appraisal of how certain maximality axioms behave on different conceptions of ontology concerning the iterative conception. In particular, we argue that forms of multiversism (the view that any universe of a certain kind can be extended) and actualism (the view that there are universes that cannot be extended in particular ways) face (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • What is Absolute Undecidability?†.Justin Clarke-Doane - 2012 - Noûs 47 (3):467-481.
    It is often supposed that, unlike typical axioms of mathematics, the Continuum Hypothesis (CH) is indeterminate. This position is normally defended on the ground that the CH is undecidable in a way that typical axioms are not. Call this kind of undecidability “absolute undecidability”. In this paper, I seek to understand what absolute undecidability could be such that one might hope to establish that (a) CH is absolutely undecidable, (b) typical axioms are not absolutely undecidable, and (c) if a mathematical (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Modal Pluralism and Higher‐Order Logic.Justin Clarke-Doane & William McCarthy - 2022 - Philosophical Perspectives 36 (1):31-58.
    In this article, we discuss a simple argument that modal metaphysics is misconceived, and responses to it. Unlike Quine's, this argument begins with the simple observation that there are different candidate interpretations of the predicate ‘could have been the case’. This is analogous to the observation that there are different candidate interpretations of the predicate ‘is a member of’. The argument then infers that the search for metaphysical necessities is misguided in much the way the ‘set-theoretic pluralist’ claims that the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Gödel’s Incompleteness Theorem and the Anti-Mechanist Argument: Revisited.Yong Cheng - 2020 - Studia Semiotyczne 34 (1):159-182.
    This is a paper for a special issue of Semiotic Studies devoted to Stanislaw Krajewski’s paper. This paper gives some supplementary notes to Krajewski’s on the Anti-Mechanist Arguments based on Gödel’s incompleteness theorem. In Section 3, we give some additional explanations to Section 4–6 in Krajewski’s and classify some misunderstandings of Gödel’s incompleteness theorem related to AntiMechanist Arguments. In Section 4 and 5, we give a more detailed discussion of Gödel’s Disjunctive Thesis, Gödel’s Undemonstrability of Consistency Thesis and the definability (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • In Defense of the Implicit Commitment Thesis.Ethan Brauer - 2022 - Ergo: An Open Access Journal of Philosophy 9.
    The implicit commitment thesis is the claim that believing in a mathematical theory S carries an implicit commitment to further sentences not deductively entailed by the theory, such as the consistency sentence Con(S). I provide a new argument for this thesis based on the notion of mathematical certainty. I also reply to a recent argument by Walter Dean against the implicit commitment thesis, showing that my formulation of the thesis avoids the difficulties he raises.
    Download  
     
    Export citation  
     
    Bookmark  
  • (Probably) Not companions in guilt.Sharon Berry - 2018 - Philosophical Studies 175 (9):2285-2308.
    In this paper, I will attempt to develop and defend a common form of intuitive resistance to the companions in guilt argument. I will argue that one can reasonably believe there are promising solutions to the access problem for mathematical realism that don’t translate to moral realism. In particular, I will suggest that the structuralist project of accounting for mathematical knowledge in terms of some form of logical knowledge offers significant hope of success while no analogous approach offers such hope (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Richness and Reflection.Neil Barton - 2016 - Philosophia Mathematica 24 (3):330-359.
    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, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Independence and Ignorance: How agnotology informs set-theoretic pluralism.Neil Barton - 2017 - Journal of the Indian Council of Philosophical Research 34 (2):399-413.
    Much of the discussion of set-theoretic independence, and whether or not we could legitimately expand our foundational theory, concerns how we could possibly come to know the truth value of independent sentences. This paper pursues a slightly different tack, examining how we are ignorant of issues surrounding their truth. We argue that a study of how we are ignorant reveals a need for an understanding of set-theoretic explanation and motivates a pluralism concerning the adoption of foundational theory.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Are Large Cardinal Axioms Restrictive?Neil Barton - 2023 - Philosophia Mathematica 31 (3):372-407.
    The independence phenomenon in set theory, while pervasive, can be partially addressed through the use of large cardinal axioms. A commonly assumed idea is that large cardinal axioms are species of maximality principles. In this paper I question this claim. I show that there is a kind of maximality (namely absoluteness) on which large cardinal axioms come out as restrictive relative to a formal notion of restrictiveness. Within this framework, I argue that large cardinal axioms can still play many of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Cognitivism about Epistemic Modality.Hasen Khudairi - manuscript
    This paper aims to vindicate the thesis that cognitive computational properties are abstract objects implemented in physical systems. I avail of the equivalence relations countenanced in Homotopy Type Theory, in order to specify an abstraction principle for epistemic intensions. The homotopic abstraction principle for epistemic intensions provides an epistemic conduit into our knowledge of intensions as abstract objects. I examine, then, how intensional functions in Epistemic Modal Algebra are deployed as core models in the philosophy of mind, Bayesian perceptual psychology, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A verisimilitudinarian analysis of the Linda paradox.Gustavo Cevolani, Vincenzo Crupi & Roberto Festa - 2012 - VII Conference of the Spanish Society for Logic, Methodology and Philosphy of Science.
    The Linda paradox is a key topic in current debates on the rationality of human reasoning and its limitations. We present a novel analysis of this paradox, based on the notion of verisimilitude as studied in the philosophy of science. The comparison with an alternative analysis based on probabilistic confirmation suggests how to overcome some problems of our account by introducing an adequately defined notion of verisimilitudinarian confirmation.
    Download  
     
    Export citation  
     
    Bookmark  
  • Ipotesi del Continuo.Claudio Ternullo - 2017 - Aphex 16.
    L’Ipotesi del Continuo, formulata da Cantor nel 1878, è una delle congetture più note della teoria degli insiemi. Il Problema del Continuo, che ad essa è collegato, fu collocato da Hilbert, nel 1900, fra i principali problemi insoluti della matematica. A seguito della dimostrazione di indipendenza dell’Ipotesi del Continuo dagli assiomi della teoria degli insiemi, lo status attuale del problema è controverso. In anni più recenti, la ricerca di una soluzione del Problema del Continuo è stata anche una delle ragioni (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Is the Continuum Hypothesis a definite mathematical problem?Solomon Feferman - manuscript
    The purpose of this article is to explain why I believe that the Continuum Hypothesis (CH) is not a definite mathematical problem. My reason for that is that the concept of arbitrary set essential to its formulation is vague or underdetermined and there is no way to sharpen it without violating what it is supposed to be about. In addition, there is considerable circumstantial evidence to support the view that CH is not definite.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The Residual Access Problem.Sharon Berry - manuscript
    A range of current truth-value realist philosophies of mathematics allow one to reduce the Benacerraf Problem to a problem concerning mathematicians' ability to recognize which conceptions of pure mathematical structures are coherent – in a sense which can be cashed out in terms of logical possibility. In this paper I will clarify what it takes to solve this `residual' access problem and then present a framework for solving it.
    Download  
     
    Export citation  
     
    Bookmark   1 citation