Switch to: References

Citations of:

Finitism

Journal of Philosophy 78 (9):524-546 (1981)

Add citations

You must login to add citations.
  1. More infinity for a better finitism.Sam Sanders - 2010 - Annals of Pure and Applied Logic 161 (12):1525-1540.
    Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis with a PRA consistency proof, proposed in around 1995 by Patrick Suppes and Richard Sommer. It is based on an earlier system developed by Rolando Chuaqui and Patrick Suppes. Here, we discuss the inherent problems and limitations of the classical nonstandard framework and propose a much-needed refinement of ERNA, called , in the spirit of Karel Hrbacek’s stratified set theory. We study the metamathematics of and its (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Unfolding finitist arithmetic.Solomon Feferman & Thomas Strahm - 2010 - Review of Symbolic Logic 3 (4):665-689.
    The concept of the (full) unfolding of a schematic system is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted ? The program to determine for various systems of foundational significance was previously carried out for a system of nonfinitist arithmetic, ; it was shown that is proof-theoretically equivalent to predicative analysis. In the present paper we work out the unfolding notions for a basic schematic system (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Hilbert versus Hindman.Jeffry L. Hirst - 2012 - Archive for Mathematical Logic 51 (1-2):123-125.
    We show that a statement HIL, which is motivated by a lemma of Hilbert and close in formulation to Hindman’s theorem, is actually much weaker than Hindman’s theorem. In particular, HIL is finitistically reducible in the sense of Hilbert’s program, while Hindman’s theorem is not.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • L'infinité des nombres premiers : une étude de cas de la pureté des méthodes.Andrew Arana - 2011 - Les Etudes Philosophiques 97 (2):193.
    Une preuve est pure si, en gros, elle ne réfère dans son développement qu’à ce qui est « proche » de, ou « intrinsèque » à l’énoncé à prouver. L’infinité des nombres premiers, un théorème classique de l’arithmétique, est un cas d’étude particulièrement riche pour les recherches philosophiques sur la pureté. Deux preuves différentes de ce résultat sont ici considérées, à savoir la preuve euclidienne classique et une preuve « topologique » plus récente proposée par Furstenberg. D’un point de vue (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Is unsaying polite?Berislav Žarnić - 2011 - In Majda Trobok, Nenad Miščević & Berislav Žarnić (eds.), Between Logic and Reality: Modeling Inference, Action and Understanding. Dordrecht and New York: Springer. pp. 201--224.
    This paper is divided in five sections. Section 11.1 sketches the history of the distinction between speech act with negative content and negated speech act, and gives a general dynamic interpretation for negated speech act. “Downdate semantics” for AGM contraction is introduced in Section 11.2. Relying on semantically interpreted contraction, Section 11.3 develops the dynamic semantics for constative and directive speech acts, and their external negations. The expressive completeness for the formal variants of natural language utterances, none of which is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Transfer and a Supremum Principle for ERNA.Chris Impens & Sam Sanders - 2008 - Journal of Symbolic Logic 73 (2):689 - 710.
    Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis proposed around 1995 by Patrick Suppes and Richard Sommer, who also proved its consistency inside PRA. It is based on an earlier system developed by Rolando Chuaqui and Patrick Suppes, of which Michal Rössler and Emil Jeřábek have recently proposed a weakened version. We add a Π₁-transfer principle to ERNA and prove the consistency of the extended theory inside PRA. In this extension of ERNA a σ₁-supremum (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Extensions of the Finitist Point of View.Matthias Schirn & Karl-Georg Niebergall - 2001 - History and Philosophy of Logic 22 (3):135-161.
    Hilbert developed his famous finitist point of view in several essays in the 1920s. In this paper, we discuss various extensions of it, with particular emphasis on those suggested by Hilbert and Bernays in Grundlagen der Mathematik (vol. I 1934, vol. II 1939). The paper is in three sections. The first deals with Hilbert's introduction of a restricted ? -rule in his 1931 paper ?Die Grundlegung der elementaren Zahlenlehre?. The main question we discuss here is whether the finitist (meta-)mathematician would (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Crisis in the Foundations of Mathematics.J. Ferreiros - 2008 - In T. Gowers (ed.), Princeton Companion to Mathematics. Princeton University Press.
    A general introduction to the celebrated foundational crisis, discussing how the characteristic traits of modern mathematics (acceptance of the notion of an “arbitrary” function proposed by Dirichlet; wholehearted acceptance of infinite sets and the higher infinite; a preference “to put thoughts in the place of calculations” and to concentrate on “structures” characterized axiomatically; a reliance on “purely existential” methods of proof) provoked extensive polemics and alternative approaches. Going beyond exclusive concentration on the paradoxes, it also discusses the role of the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Two (or three) notions of finitism.Mihai Ganea - 2010 - Review of Symbolic Logic 3 (1):119-144.
    Finitism is given an interpretation based on two ideas about strings (sequences of symbols): a replacement principle extracted from Hilberts class 2 can be justified by means of an additional finitistic choice principle, thus obtaining a second equational theory . It is unknown whether is strictly stronger than since 2 may coincide with the class of lower elementary functions.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Price of Mathematical Scepticism.Paul Blain Levy - 2022 - Philosophia Mathematica 30 (3):283-305.
    This paper argues that, insofar as we doubt the bivalence of the Continuum Hypothesis or the truth of the Axiom of Choice, we should also doubt the consistency of third-order arithmetic, both the classical and intuitionistic versions. -/- Underlying this argument is the following philosophical view. Mathematical belief springs from certain intuitions, each of which can be either accepted or doubted in its entirety, but not half-accepted. Therefore, our beliefs about reality, bivalence, choice and consistency should all be aligned.
    Download  
     
    Export citation  
     
    Bookmark  
  • 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000.Carol Wood - 2001 - Bulletin of Symbolic Logic 7 (1):82-163.
    Download  
     
    Export citation  
     
    Bookmark  
  • Logic, ontology, mathematical practice.Stewart Shapiro - 1989 - Synthese 79 (1):13 - 50.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Kurt gödel.Juliette Kennedy - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Elementary realizability.Zlatan Damnjanovic - 1997 - Journal of Philosophical Logic 26 (3):311-339.
    A realizability notion that employs only Kalmar elementary functions is defined, and, relative to it, the soundness of EA-(Π₁⁰-IR), a fragment of Heyting Arithmetic (HA) with names and axioms for all elementary functions and induction rule restricted to Π₁⁰ formulae, is proved. As a corollary, it is proved that the provably recursive functions of EA-(Π₁⁰-IR) are precisely the elementary functions. Elementary realizability is proposed as a model of strict arithmetic constructivism, which allows only those constructive procedures for which the amount (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Intuition, Iteration, Induction.Mark van Atten - 2024 - Philosophia Mathematica 32 (1):34-81.
    Brouwer’s view on induction has relatively recently been characterised as one on which it is not only intuitive (as expected) but functional, by van Dalen. He claims that Brouwer’s ‘Ur-intuition’ also yields the recursor. Appealing to Husserl’s phenomenology, I offer an analysis of Brouwer’s view that supports this characterisation and claim, even if assigning the primary role to the iterator instead. Contrasts are drawn to accounts of induction by Poincaré, Heyting, and Kreisel. On the phenomenological side, the analysis provides an (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Mathematical Commitment Without Computational Strength.Anton Freund - 2022 - Review of Symbolic Logic 15 (4):880-906.
    We present a new manifestation of Gödel’s second incompleteness theorem and discuss its foundational significance, in particular with respect to Hilbert’s program. Specifically, we consider a proper extension of Peano arithmetic ( $\mathbf {PA}$ ) by a mathematically meaningful axiom scheme that consists of $\Sigma ^0_2$ -sentences. These sentences assert that each computably enumerable ( $\Sigma ^0_1$ -definable without parameters) property of finite binary trees has a finite basis. Since this fact entails the existence of polynomial time algorithms, it is (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Finitist Axiomatic Truth.Sato Kentaro & Jan Walker - 2023 - Journal of Symbolic Logic 88 (1):22-73.
    Following the finitist’s rejection of the complete totality of the natural numbers, a finitist language allows only propositional connectives and bounded quantifiers in the formula-construction but not unbounded quantifiers. This is opposed to the currently standard framework, a first-order language. We conduct axiomatic studies on the notion of truth in the framework of finitist arithmetic in which at least smash function $\#$ is available. We propose finitist variants of Tarski ramified truth theories up to rank $\omega $, of Kripke–Feferman truth (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The collapse of the Hilbert program: A variation on the gödelian theme.Saul A. Kripke - 2022 - Bulletin of Symbolic Logic 28 (3):413-426.
    The Hilbert program was actually a specific approach for proving consistency, a kind of constructive model theory. Quantifiers were supposed to be replaced by ε-terms. εxA(x) was supposed to denote a witness to ∃xA(x), or something arbitrary if there is none. The Hilbertians claimed that in any proof in a number-theoretic system S, each ε-term can be replaced by a numeral, making each line provable and true. This implies that S must not only be consistent, but also 1-consistent. Here we (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Strict Finitism's Unrequited Love for Computational Complexity.Noel Arteche - manuscript
    As a philosophy of mathematics, strict finitism has been traditionally concerned with the notion of feasibility, defended mostly by appealing to the physicality of mathematical practice. This has led the strict finitists to influence and be influenced by the field of computational complexity theory, under the widely held belief that this branch of mathematics is concerned with the study of what is “feasible in practice”. In this paper, I survey these ideas and contend that, contrary to popular belief, complexity theory (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Epistemology Versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf.Peter Dybjer, Sten Lindström, Erik Palmgren & Göran Sundholm (eds.) - 2012 - Dordrecht, Netherland: Springer.
    This book brings together philosophers, mathematicians and logicians to penetrate important problems in the philosophy and foundations of mathematics. In philosophy, one has been concerned with the opposition between constructivism and classical mathematics and the different ontological and epistemological views that are reflected in this opposition. The dominant foundational framework for current mathematics is classical logic and set theory with the axiom of choice. This framework is, however, laden with philosophical difficulties. One important alternative foundational programme that is actively pursued (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Gödelian platonism and mathematical intuition.Wesley Wrigley - 2021 - European Journal of Philosophy 30 (2):578-600.
    European Journal of Philosophy, Volume 30, Issue 2, Page 578-600, June 2022.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A marriage of Brouwer’s intuitionism and Hilbert’s finitism I: Arithmetic.Takako Nemoto & Sato Kentaro - 2022 - Journal of Symbolic Logic 87 (2):437-497.
    We investigate which part of Brouwer’s Intuitionistic Mathematics is finitistically justifiable or guaranteed in Hilbert’s Finitism, in the same way as similar investigations on Classical Mathematics already done quite extensively in proof theory and reverse mathematics. While we already knew a contrast from the classical situation concerning the continuity principle, more contrasts turn out: we show that several principles are finitistically justifiable or guaranteed which are classically not. Among them are: fan theorem for decidable fans but arbitrary bars; continuity principle (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Theory of Implicit Commitment for Mathematical Theories.Mateusz Łełyk & Carlo Nicolai - manuscript
    The notion of implicit commitment has played a prominent role in recent works in logic and philosophy of mathematics. Although implicit commitment is often associated with highly technical studies, it remains so far an elusive notion. In particular, it is often claimed that the acceptance of a mathematical theory implicitly commits one to the acceptance of a Uniform Reflection Principle for it. However, philosophers agree that a satisfactory analysis of the transition from a theory to its reflection principle is still (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Hilbert's Metamathematical Problems and Their Solutions.Besim Karakadilar - 2008 - Dissertation, Boston University
    This dissertation examines several of the problems that Hilbert discovered in the foundations of mathematics, from a metalogical perspective. The problems manifest themselves in four different aspects of Hilbert’s views: (i) Hilbert’s axiomatic approach to the foundations of mathematics; (ii) His response to criticisms of set theory; (iii) His response to intuitionist criticisms of classical mathematics; (iv) Hilbert’s contribution to the specification of the role of logical inference in mathematical reasoning. This dissertation argues that Hilbert’s axiomatic approach was guided primarily (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Hypatia's silence.Martin Fischer, Leon Horsten & Carlo Nicolai - 2021 - Noûs 55 (1):62-85.
    Hartry Field distinguished two concepts of type‐free truth: scientific truth and disquotational truth. We argue that scientific type‐free truth cannot do justificatory work in the foundations of mathematics. We also present an argument, based on Crispin Wright's theory of cognitive projects and entitlement, that disquotational truth can do justificatory work in the foundations of mathematics. The price to pay for this is that the concept of disquotational truth requires non‐classical logical treatment.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Takeuti's Well-Ordering Proof: Finitistically Fine?Eamon Darnell & Aaron Thomas-Bolduc - 2018 - In Maria Zack & Dirk Schlimm (eds.), Research in History and Philosophy of Mathematics The CSHPM 2017 Annual Meeting in Toronto, Ontario. New York: Birkhäuser.
    If it could be shown that one of Gentzen's consistency proofs for pure number theory could be shown to be finitistically acceptable, an important part of Hilbert's program would be vindicated. This paper focuses on whether the transfinite induction on ordinal notations needed for Gentzen's second proof can be finitistically justified. In particular, the focus is on Takeuti's purportedly finitistically acceptable proof of the well-ordering of ordinal notations in Cantor normal form. The paper begins with a historically informed discussion of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Proof Theory as an Analysis of Impredicativity( New Developments in Logic: Proof-Theoretic Ordinals and Set-Theoretic Ordinals).Ryota Akiyoshi - 2012 - Journal of the Japan Association for Philosophy of Science 39 (2):93-107.
    Download  
     
    Export citation  
     
    Bookmark  
  • Lieber Herr Bernays!, Lieber Herr Gödel! Gödel on finitism, constructivity and Hilbert's program.Solomon Feferman - 2008 - Dialectica 62 (2):179-203.
    This is a survey of Gödel's perennial preoccupations with the limits of finitism, its relations to constructivity, and the significance of his incompleteness theorems for Hilbert's program, using his published and unpublished articles and lectures as well as the correspondence between Bernays and Gödel on these matters. There is also an important subtext, namely the shadow of Hilbert that loomed over Gödel from the beginning to the end.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The prehistory of the subsystems of second-order arithmetic.Walter Dean & Sean Walsh - 2017 - Review of Symbolic Logic 10 (2):357-396.
    This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar\'e to Feferman as concerns arithmetic definability and provability, (ii) the interplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K\"onig's (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Gödel's Third Incompleteness Theorem.Timothy McCarthy - 2016 - Dialectica 70 (1):87-112.
    In a note appended to the translation of “On consistency and completeness” (), Gödel reexamined the problem of the unprovability of consistency. Gödel here focuses on an alternative means of expressing the consistency of a formal system, in terms of what would now be called a ‘reflection principle’, roughly, the assertion that a formula of a certain class is provable in the system only if it is true. Gödel suggests that it is this alternative means of expressing consistency that we (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory.Michael Rathjen - 2005 - Synthese 147 (1):81-120.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
    Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeley
    In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the Concept of Finitism.Luca Incurvati - 2015 - Synthese 192 (8):2413-2436.
    At the most general level, the concept of finitism is typically characterized by saying that finitistic mathematics is that part of mathematics which does not appeal to completed infinite totalities and is endowed with some epistemological property that makes it secure or privileged. This paper argues that this characterization can in fact be sharpened in various ways, giving rise to different conceptions of finitism. The paper investigates these conceptions and shows that they sanction different portions of mathematics as finitistic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Intuiting the infinite.Robin Jeshion - 2014 - Philosophical Studies 171 (2):327-349.
    This paper offers a defense of Charles Parsons’ appeal to mathematical intuition as a fundamental factor in solving Benacerraf’s problem for a non-eliminative structuralist version of Platonism. The literature is replete with challenges to his well-known argument that mathematical intuition justifies our knowledge of the infinitude of the natural numbers, in particular his demonstration that any member of a Hilbertian stroke string ω-sequence has a successor. On Parsons’ Kantian approach, this amounts to demonstrating that for an “arbitrary” or “vaguely represented” (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Paradox of the Knower revisited.Walter Dean & Hidenori Kurokawa - 2014 - Annals of Pure and Applied Logic 165 (1):199-224.
    The Paradox of the Knower was originally presented by Kaplan and Montague [26] as a puzzle about the everyday notion of knowledge in the face of self-reference. The paradox shows that any theory extending Robinson arithmetic with a predicate K satisfying the factivity axiom K → A as well as a few other epistemically plausible principles is inconsistent. After surveying the background of the paradox, we will focus on a recent debate about the role of epistemic closure principles in the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A hierarchy of hereditarily finite sets.Laurence Kirby - 2008 - Archive for Mathematical Logic 47 (2):143-157.
    This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already existing set of a single new element drawn from the already existing sets. The structure of the lowest levels of this hierarchy is examined, and some results are obtained about the cardinalities of levels of the hierarchy.
    Download  
     
    Export citation  
     
    Bookmark   5 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  
  • A Simple Proof of Parsons' Theorem.Fernando Ferreira - 2005 - Notre Dame Journal of Formal Logic 46 (1):83-91.
    Let be the fragment of elementary Peano arithmetic in which induction is restricted to -formulas. More than three decades ago, Parsons showed that the provably total functions of are exactly the primitive recursive functions. In this paper, we observe that Parsons' result is a consequence of Herbrand's theorem concerning the -consequences of universal theories. We give a self-contained proof requiring only basic knowledge of mathematical logic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.
    A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Varieties of Finitism.Manuel Bremer - 2007 - Metaphysica 8 (2):131-148.
    I consider here several versions of finitism or conceptions that try to work around postulating sets of infinite size. Restricting oneself to the so-called potential infinite seems to rest either on temporal readings of infinity (or infinite series) or on anti-realistic background assumptions. Both these motivations may be considered problematic. Quine’s virtual set theory points out where strong assumptions of infinity enter into number theory, but is implicitly committed to infinity anyway. The approaches centring on the indefinitely large and the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Hilbert's program and the omega-rule.Aleksandar Ignjatović - 1994 - Journal of Symbolic Logic 59 (1):322 - 343.
    In the first part of this paper we discuss some aspects of Detlefsen's attempt to save Hilbert's Program from the consequences of Godel's Second Incompleteness Theorem. His arguments are based on his interpretation of the long standing and well-known controversy on what, exactly, finitistic means are. In his paper [1] Detlefsen takes the position that there is a form of the ω-rule which is a finitistically valid means of proof, sufficient to prove the consistency of elementary number theory Z. On (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • On a semantic interpretation of Kant's concept of number.Wing-Chun Wong - 1999 - Synthese 121 (3):357-383.
    What is central to the progression of a sequence is the idea of succession, which is fundamentally a temporal notion. In Kant's ontology numbers are not objects but rules (schemata) for representing the magnitude of a quantum. The magnitude of a discrete quantum 11...11 is determined by a counting procedure, an operation which can be understood as a mapping from the ordinals to the cardinals. All empirical models for numbers isomorphic to 11...11 must conform to the transcendental determination of time-order. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Relative consistency and accessible domains.Wilfried Sieg - 1990 - Synthese 84 (2):259 - 297.
    Wilfred Sieg. Relative Consistency and Accesible Domains.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Finite mathematics.Shaughan Lavine - 1995 - Synthese 103 (3):389 - 420.
    A system of finite mathematics is proposed that has all of the power of classical mathematics. I believe that finite mathematics is not committed to any form of infinity, actual or potential, either within its theories or in the metalanguage employed to specify them. I show in detail that its commitments to the infinite are no stronger than those of primitive recursive arithmetic. The finite mathematics of sets is comprehensible and usable on its own terms, without appeal to any form (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Tolerance and metalanguages in carnap'slogical syntax of language.David Devidi & Graham Solomon - 1995 - Synthese 103 (1):123 - 139.
    Michael Friedman has recently argued that Carnap'sLogical Syntax of Language is fundamentally flawed in a way that reveals the ultimate failure of logical positivism. Friedman's argument depends crucially on two claims: (1) that Carnap was committed to the view that there is a universal metalanguage and (2) that given what Carnap wanted from a metalanguage, in particular given that he wanted a definition of analytic for an object language, he was in fact committed to a hierarchy of stronger and stronger (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Truth, reflection, and hierarchies.Michael Glanzberg - 2005 - Synthese 142 (3):289 - 315.
    A common objection to hierarchical approaches to truth is that they fragment the concept of truth. This paper defends hierarchical approaches in general against the objection of fragmentation. It argues that the fragmentation required is familiar and unprob-lematic, via a comparison with mathematical proof. Furthermore, it offers an explanation of the source and nature of the fragmentation of truth. Fragmentation arises because the concept exhibits a kind of failure of closure under reflection. This paper offers a more precise characterization of (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • The baire category theorem in weak subsystems of second-order arithmetic.Douglas K. Brown & Stephen G. Simpson - 1993 - Journal of Symbolic Logic 58 (2):557-578.
    Working within weak subsystems of second-order arithmetic Z2 we consider two versions of the Baire Category theorem which are not equivalent over the base system RCA0. We show that one version (B.C.T.I) is provable in RCA0 while the second version (B.C.T.II) requires a stronger system. We introduce two new subsystems of Z2, which we call RCA+ 0 and WKL+ 0, and show that RCA+ 0 suffices to prove B.C.T.II. Some model theory of WKL+ 0 and its importance in view of (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations