Switch to: References

Add citations

You must login to add citations.
  1. First-Order Reasoning and Primitive Recursive Natural Number Notations.David Isles - 2010 - Studia Logica 96 (1):49-64.
    If the collection of models for the axioms 21 of elementary number theory is enlarged to include not just the " natural numbers " or their non-standard infinitistic extensions but also what are here called "primitive recursive notations", questions arise about the reliability of first-order derivations from 21. In this enlarged set of "models" some derivations usually accepted as "reliable" may be problematic. This paper criticizes two of these derivations which claim, respectively, to establish the totality of exponentiation and to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A pragmatic analysis of mathematical realism and intuitionism.Michel J. Blais - 1989 - Philosophia Mathematica (1):61-85.
    Download  
     
    Export citation  
     
    Bookmark  
  • Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.
    This article bears on four topics: observational predicates and phenomenal properties, vagueness, strict finitism as a philosophy of mathematics, and the analysis of feasible computability. It is argued that reactions to strict finitism point towards a semantics for vague predicates in the form of nonstandard models of weak arithmetical theories of the sort originally introduced to characterize the notion of feasibility as understood in computational complexity theory. The approach described eschews the use of nonclassical logic and related devices like degrees (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Physicalism, instrumentalism and the semantics of modal logic.Graeme Forbes - 1983 - Journal of Philosophical Logic 12 (3):271 - 298.
    The delicate point in the formalistic position is to explain how the non-intuitionistic classical mathematics is significant, after having initially agreed with the intuitionists that its theorems lack a real meaning in terms of which they are true (S. C. Kleene, 1952).
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Critical Studies / Book Reviews: Critical Studies / Book Reviews.Paul Ernest - 2001 - Philosophia Mathematica 9 (3):376-378.
    Download  
     
    Export citation  
     
    Bookmark  
  • The sorites paradox.Dale A. Thorpe - 1984 - Synthese 61 (3):391 - 421.
    A solution to the sorites paradox is obtained by distinguishing three formats of the sorites argument and appraising them in the light of four fundamental considerations: (i) the appropriate notion of truth for the application of vague predicates to their borderline cases, (ii) a certain construal of borderline cases, (iii) a certain freedom of use of vague terms not enjoyed by non-Vague terms and (iv) the revocation of that freedom by deductive contexts.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Wright’s Strict Finitistic Logic in the Classical Metatheory: The Propositional Case.Takahiro Yamada - 2023 - Journal of Philosophical Logic 52 (4).
    Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in his strict finitistic metatheory, of equations between numerals on which concrete arithmetical sentences are evaluated. As a first step towards classical formalisation of strict finitism, we propose their counterparts in the classical metatheory with one additional assumption, and then extract the propositional part of ‘strict finitistic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Sharpened lower bounds for cut elimination.Samuel R. Buss - 2012 - Journal of Symbolic Logic 77 (2):656-668.
    We present sharpened lower bounds on the size of cut free proofs for first-order logic. Prior lower bounds for eliminating cuts from a proof established superexponential lower bounds as a stack of exponentials, with the height of the stack proportional to the maximum depth d of the formulas in the original proof. Our results remove the constant of proportionality, giving an exponential stack of height equal to d — 0(1). The proof method is based on more efficiently expressing the Gentzen-Solovay (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Bounded arithmetic, proof complexity and two papers of Parikh.Samuel R. Buss - 1999 - Annals of Pure and Applied Logic 96 (1-3):43-55.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Different senses of finitude: An inquiry into Hilbert’s finitism.Sören Stenlund - 2012 - Synthese 185 (3):335-363.
    This article develops a critical investigation of the epistemological core of Hilbert's foundational project, the so-called the finitary attitude. The investigation proceeds by distinguishing different senses of 'number' and 'finitude' that have been used in the philosophical arguments. The usual notion of modern pure mathematics, i.e. the sense of number which is implicit in the notion of an arbitrary finite sequence and iteration is one sense of number and finitude. Another sense, of older origin, is connected with practices of counting (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Feng Ye. Strict Finitism and the Logic of Mathematical Applications.Nigel Vinckier & Jean Paul Van Bendegem - 2016 - Philosophia Mathematica 24 (2):247-256.
    Download  
     
    Export citation  
     
    Bookmark   1 citation