Switch to: References

Add citations

You must login to add citations.
  1. Σ01 soundness isn’t enough: Number theoretic indeterminacy’s unsavory physical commitments.Sharon Berry - 2023 - British Journal for the Philosophy of Science 74 (2):469-484.
    It’s sometimes suggested that we can (in a sense) settle the truth-value of some statements in the language of number theory by stipulation, adopting either φ or ¬φ as an additional axiom. For example, in Clarke-Doane (2020b) and a series of recent APA presentations, Clarke-Doane suggests that any Σ01 sound expansion of our current arithmetical practice would express a truth. In this paper, I’ll argue that (given a certain popular assumption about the model-theoretic representability of languages like ours) we can’t (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Shadows of Syntax: Revitalizing Logical and Mathematical Conventionalism.Jared Warren - 2020 - New York, USA: Oxford University Press.
    What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Supertasks and Arithmetical Truth.Jared Warren & Daniel Waxman - 2020 - Philosophical Studies 177 (5):1275-1282.
    This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations