5 found
Order:
  1.  83
    Absolutely General Knowledge.Rachel Elizabeth Fraser & Beau Madison Mount - forthcoming - Philosophy and Phenomenological Research.
    Philosophy and Phenomenological Research, EarlyView.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  2.  63
    Antireductionism and Ordinals.Beau Madison Mount - 2019 - Philosophia Mathematica 27 (1):105-124.
    I develop a novel argument against the claim that ordinals are sets. In contrast to Benacerraf’s antireductionist argument, I make no use of covert epistemic assumptions. Instead, my argument uses considerations of ontological dependence. I draw on the datum that sets depend immediately and asymmetrically on their elements and argue that this datum is incompatible with reductionism, given plausible assumptions about the dependence profile of ordinals. In addition, I show that a structurally similar argument can be made against the claim (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3. Higher‐Order Abstraction Principles.Beau Madison Mount - 2015 - Thought: A Journal of Philosophy 4 (4):228-236.
    I extend theorems due to Roy Cook on third- and higher-order versions of abstraction principles and discuss the philosophical importance of results of this type. Cook demonstrated that the satisfiability of certain higher-order analogues of Hume's Principle is independent of ZFC. I show that similar analogues of Boolos's new v and Cook's own ordinal abstraction principle soap are not satisfiable at all. I argue, however, that these results do not tell significantly against the second-order versions of these principles.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  4.  19
    Stable and Unstable Theories of Truth and Syntax.Beau Madison Mount & Daniel Waxman - 2021 - Mind 130 (518):439-473.
    Recent work on formal theories of truth has revived an approach, due originally to Tarski, on which syntax and truth theories are sharply distinguished—‘disentangled’—from mathematical base theories. In this paper, we defend a novel philosophical constraint on disentangled theories. We argue that these theories must be epistemically stable: they must possess an intrinsic motivation justifying no strictly stronger theory. In a disentangled setting, even if the base and the syntax theory are individually stable, they may be jointly unstable. We contend (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  56
    We Turing Machines Can't Even Be Locally Ideal Bayesians.Beau Madison Mount - 2016 - Thought: A Journal of Philosophy 5 (4):285-290.
    Vann McGee has argued that, given certain background assumptions and an ought-implies-can thesis about norms of rationality, Bayesianism conflicts globally with computationalism due to the fact that Robinson arithmetic is essentially undecidable. I show how to sharpen McGee's result using an additional fact from recursion theory—the existence of a computable sequence of computable reals with an uncomputable limit. In conjunction with the countable additivity requirement on probabilities, such a sequence can be used to construct a specific proposition to which Bayesianism (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark