Switch to: References

Citations of:

Strict Constructivism and the Philosophy of Mathematics

Dissertation, Princeton University (2000)

Add citations

You must login to add citations.
  1. The applicability of mathematics as a scientific and a logical problem.Feng Ye - 2010 - Philosophia Mathematica 18 (2):144-165.
    This paper explores how to explain the applicability of classical mathematics to the physical world in a radically naturalistic and nominalistic philosophy of mathematics. The applicability claim is first formulated as an ordinary scientific assertion about natural regularity in a class of natural phenomena and then turned into a logical problem by some scientific simplification and abstraction. I argue that there are some genuine logical puzzles regarding applicability and no current philosophy of mathematics has resolved these puzzles. Then I introduce (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Indispensability argument and anti-realism in philosophy of mathematics.Feng Ye - 2007 - Frontiers of Philosophy in China 2 (4):614-628.
    The indispensability argument for abstract mathematical entities has been an important issue in the philosophy of mathematics. The argument relies on several assumptions. Some objections have been made against these assumptions, but there are several serious defects in these objections. Ameliorating these defects leads to a new anti-realistic philosophy of mathematics, mainly: first, in mathematical applications, what really exist and can be used as tools are not abstract mathematical entities, but our inner representations that we create in imagining abstract mathematical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On Naturalizing the Epistemology of Mathematics.Jeffrey W. Roland - 2009 - Pacific Philosophical Quarterly 90 (1):63-97.
    In this paper, I consider an argument for the claim that any satisfactory epistemology of mathematics will violate core tenets of naturalism, i.e. that mathematics cannot be naturalized. I find little reason for optimism that the argument can be effectively answered.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Strict Finitism and the Logic of Mathematical Applications.Feng Ye - 2011 - Dordrecht, Netherland: Springer.
    This book intends to show that radical naturalism, nominalism and strict finitism account for the applications of classical mathematics in current scientific theories. The applied mathematical theories developed in the book include the basics of calculus, metric space theory, complex analysis, Lebesgue integration, Hilbert spaces, and semi-Riemann geometry. The fact that so much applied mathematics can be developed within such a weak, strictly finitistic system, is surprising in itself. It also shows that the applications of those classical theories to the (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Predicativity.Solomon Feferman - 2005 - In Stewart Shapiro (ed.), Oxford Handbook of Philosophy of Mathematics and Logic. Oxford and New York: Oxford University Press. pp. 590-624.
    What is predicativity? While the term suggests that there is a single idea involved, what the history will show is that there are a number of ideas of predicativity which may lead to different logical analyses, and I shall uncover these only gradually. A central question will then be what, if anything, unifies them. Though early discussions are often muddy on the concepts and their employment, in a number of important respects they set the stage for the further developments, and (...)
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Does reductive proof theory have a viable rationale?Solomon Feferman - 2000 - Erkenntnis 53 (1-2):63-96.
    The goals of reduction andreductionism in the natural sciences are mainly explanatoryin character, while those inmathematics are primarily foundational.In contrast to global reductionistprograms which aim to reduce all ofmathematics to one supposedly ``universal'' system or foundational scheme, reductive proof theory pursues local reductions of one formal system to another which is more justified in some sense. In this direction, two specific rationales have been proposed as aims for reductive proof theory, the constructive consistency-proof rationale and the foundational reduction rationale. However, (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Indispensability argument and anti-realism in philosophy of mathematics.Y. E. Feng - 2007 - Frontiers of Philosophy in China 2 (4):614-628.
    The indispensability argument for abstract mathematical entities has been an important issue in the philosophy of mathematics. The argument relies on several assumptions. Some objections have been made against these assumptions, but there are several serious defects in these objections. Ameliorating these defects leads to a new anti-realistic philosophy of mathematics, mainly: first, in mathematical applications, what really exist and can be used as tools are not abstract mathematical entities, but our inner representations that we create in imagining abstract mathematical (...)
    Download  
     
    Export citation  
     
    Bookmark