The incompleteness of formal systems for arithmetic has been a recognized fact of mathematics. The term “incompleteness” suggests that the formal system in question fails to offer a deduction which it ought to. This chapter focuses on the status of a formal system, Peano Arithmetic, and explores a viewpoint on which Peano Arithmetic occupies an intrinsic, conceptually well-defined region of arithmetical truth. The idea is that it consists of those truths which can be perceived directly from (...) the purely arithmetical content of a categorical conceptual analysis of the notion of natural number. The chapter explores its conceptual stability in light of the apparently destabilizing effect, through extensibility, of the phenomenon of incompleteness. It also offers heuristic and conceptual support for the viewpoint that Peano Arithmetic is the strongest natural first-order system for arithmetic, and that there is a sense in which it is complete with respect to purely arithmetical truth. (shrink)

Isaacson’s thesis claims that Peano arithmetic is complete with respect to arithmetical truth as defined by Isaacson. According to this thesis, the incompleteness phenomenon revealed in Gödel’s incompleteness theorems does not pertain to arithmetical incompleteness. In our analysis, we discuss both the advantages and disadvantages of Isaacson’s thesis. Additionally, we propose seven case examples that may pose potential challenges to Isaacson’s thesis. To effectively defend Isaacson’s thesis, one must address these case examples. We conclude that either Isaacson’s notion (...) of arithmetical truth is not right, or that it is difficult to defend Isaacson’s thesis. (shrink)

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 are of no help in explaining arithmetical determinacy. (shrink)

Four views of arithmetical truth are distinguished: the classical view, the provability view, the extended provability view, the criterial view. The main problem with the first is the ontology it requires one to accept. Two anti-realist views are the two provability views. The first of these is judged to be preferable. However, it requires a non-trivial account of the provability of axioms. The criterial view is gotten from remarks Wittgenstein makes in Tractatus 6.2-6.22 . It is judged to be (...) the best of four views. It is also defended against objections. (shrink)

We take an argument of Gödel's from his ground‐breaking 1931 paper, generalize it, and examine its validity. The argument in question is this: "the sentence G says about itself that it is not provable, and G is indeed not provable; therefore, G is true".

Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like 'All the theorems are true', 'Everything Peter said is true', etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show (...) that in the case of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first-order logic, full second-order logic, and existential second-order (?11-) logic. (shrink)

Truthmaking is usually defined as a relationship of ontological dependence that holds between propositions (the truthbearers) and worldly objects (the truthmakers). But is this accurate? If we have reasons to answer this question in the negative, then we can either allow other kinds of objects as truthmakers or we can go further and state that truthmaking does not require a supposition that any particular kinds of objects are truthmakers, leading to a sort of ontological deflationism about truthmaking. These answers have (...) already been raised in the literature as genuine possibilities. Still, none of them has been substantiated by anything more elementary and fundamental than truthmaking, which might render such responses ad hoc. In this paper, it will be shown that by relying on grounding, we can support both approaches. To demonstrate this, we will use arithmetical truth as the backbone of the paper, showing that we have independent reasons both to allow abstract objects to be truthmakers for arithmetical statements and to dispense altogether with the reliance on truthmakers to explain their truth. (shrink)

We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to emphasize the incomplete picture of both theories and treat models as their syntactical counterparts. Insisting on the incomplete picture will allow us to argue in favor of the revisability of the standard model interpretation. We then show that it is hopeless (...) to expect that the relative grounding provided by a standard interpretation can resist being revisable. We start briefly characterizing the expansion of arithmetic `truth' provided by the interpretation in a set theory. Further, we show that, for every well-founded interpretation of recursive extensions of PA in extensions of ZF, the interpreted version of arithmetic has more theorems than the original. This theorem expansion is not complete however. We continue by defining the coordination problem. The problem can be summarized as follows. We consider two independent communities of mathematicians responsible for deciding over new axioms for ZF and PA. How likely are they to be coordinated regarding PA’s interpretation in ZF? We prove that it is possible to have extensions of PA not interpretable in a given set theory ST. We further show that the probability of a random extension of arithmetic being interpretable in ST is zero. (shrink)

In Pantsar, an outline for an empirically feasible epistemological theory of arithmetic is presented. According to that theory, arithmetical knowledge is based on biological primitives but in the resulting empirical context develops an essentially a priori character. Such contextual a priori theory of arithmetical knowledge can explain two of the three characteristics that are usually associated with mathematical knowledge: that it appears to be a priori and objective. In this paper it is argued that it can also explain the (...) third one: why arithmetical knowledge appears to be necessary. A Kripkean analysis of necessity is used as an example to show that a proper analysis of the relevant possible worlds can explain arithmetical necessity in a sufficiently strong form. (shrink)

Theorems of arithmetic are used, perhaps essentially, to reach conclusions about the natural world. This applicability can be explained in a natural way by analogy with the applicability of statements of law to the world. ;In order to carry out an ontological argument for my thesis, I assume the existence of universals as a working hypothesis. I motivate a theory of laws according to which statements of law are singular statements about scientific properties. Such statements entail generalizations about instances (...) of those properties. My task, then, is to show that theorems of arithmetic, in application, are similar to statements of law in this respect. On the basis of my working hypothesis, I argue that there are inclining reasons to think that cardinal numbers are scientific properties whose instances occur in the natural world. The works of Mill, Frege and Benacerraf play central roles in these arguments. ;In general, I urge that there are no conclusive epistemological or ontological factors which preclude arithmetical truths from being laws of nature. Consequently, I think we can extend any semantic theory which is adequate for statements of law to theorems of arithmetic. This would apply even to a theory of predication which does not involve commitment to universals. So, to the degree that my argument succeeds with the working hypothesis, it also supports the unconditioned thesis that arithmetical truths are laws of nature. (shrink)

We employ the lens provided by formal truth theory to study axiomatizations of Peano Arithmetic ${\textsf {(PA)}}$. More specifically, let Elementary Arithmetic ${\textsf {(EA)}}$ be the fragment $\mathsf {I}\Delta _0 + \mathsf {Exp}$ of ${\textsf {PA}}$, and let ${\textsf {CT}}^-[{\textsf {EA}}]$ be the extension of ${\textsf {EA}}$ by the commonly studied axioms of compositional truth ${\textsf {CT}}^-$. We investigate both local and global properties of the family of first order theories of the form ${\textsf {CT}}^-[{\textsf {EA}}] (...) +\alpha $, where $\alpha $ is a particular way of expressing “ ${\textsf {PA}}$ is true” (using the truth predicate). Our focus is dominantly on two types of axiomatizations, namely: (1) schematic axiomatizations that are deductively equivalent to ${\textsf {PA}}$ and (2) axiomatizations that are proof-theoretically equivalent to the canonical axiomatization of ${\textsf {PA}}$. (shrink)

We introduce a notion of syntactical truth predicate (s.t.p.) for the second order arithmetic PA 2. An s.t.p. is a set T of closed formulas such that: (i) T(t = u) if and only if the closed first order terms t and u are convertible, i.e., have the same value in the standard interpretation (ii) T(A → B) if and only if (T(A) $\Longrightarrow$ T(B)) (iii) T(∀ x A) if and only if (T(A[x ← t]) for any closed (...) first order term t) (iv) T(∀ X A) if and only if (T(A[X ←▵]) for any closed set definition $\triangle = \{x \mid D(x)\}$ ). S.t.p.'s can be seen as a counterpart to Tarski's notion of (model-theoretical) validity and have main model properties. In particular, their existence is equivalent to the existence of an ω-model of PA 2, this fact being provable in PA 2 with arithmetical comprehension only. (shrink)

We present a theory VF of partial truth over Peano arithmetic and we prove that VF and ID 1 have the same arithmetical content. The semantics of VF is inspired by van Fraassen's notion of supervaluation.

Kant's claim that arithmetical truths are synthetic is famously contradicted by Frege, who considers them to be analytical. It may seem that this is a mere dispute about linguistic labels, since both Kant and Frege agree that arithmetical truths are a priori and informative, and, therefore, it is only a matter of how one chooses to call them. I argue that the choice between calling arithmetic “synthetic” or “analytic” has a deeper significance. I claim that the dispute is not (...) a merely linguistic one, but one involving the status of arithmetic as a science. Namely, it is a dispute about what truths are appropriate to use in grounding a scientific discipline. I interpret Frege's critique of Kant as being mainly about the lack of distinction between the context of justification and the context of discovery. (shrink)

Although many fields of study have been radically reshaped by feminist critiques, formal a priori disciplines like mathematics and computer science have proven more intransigent; feminist critiques have largely emphasized goals like increasing enrollment or participation in these fields, stopping short of proposing radical critiques of their theoretical foundations. In this paper, we discuss how Valerie Plumwood’s work on reading classical logic as a logic of domination can be extended to provide grounds for authentic feminist theories of mathematics. We argue (...) that the relevant arithmetic $$\mathsf{R}^{\sharp}$$ described by Plumwood’s collaborator Robert K. Meyer satisfies the criteria characteristic of a Plumwoodian critique of arithmetic. The setting of $$\mathsf{R}^{\sharp}$$ is finally used to investigate several consequences of such an approach, including the degree to which such an arithmetic parts ways with classical mathematics as regards arithmetical truths. (shrink)

General Arithmetic is the theory consisting of induction on a successor function. Normal arithmetic, say in the system called Peano Arithmetic, makes certain additional demands on the successor function. First, that it be total. Secondly, that it be one-to-one. And thirdly, that there be a first element which is not in its image. General Arithmetic abandons all of these further assumptions, yet is still able to prove many meaningful arithmetic truths, such as, most basically, Commutativity (...) and Associativity of Addition and Multiplication, but also Lagrange’s Four-Square Theorem. Adding one more axiom, the one-oneness of succession, one can prove many more theorems, such as Quadratic Reciprocity and Fermat’s Little Theorem. By looking at arithmetic in this general setting, one receives a deeper understanding of the underlying structures. (shrink)

We present a construction of a truth class (an interpretation of a compositional truth predicate) in an arbitrary countable recursively saturated model of first-order arithmetic. The construction is fully classical in that it employs nothing more than the classical techniques of formal proof theory.

Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between (...) reflection principles and principles of mathematical and transfinite induction as well as the status of the latter with respect to various foundational characterizations of number theory. (shrink)

This paper offers an elementary proof that formal arithmetic is consistent. The system that will be proved consistent is a first-order theory R♯, based as usual on the Peano postulates and the recursion equations for + and ×. However, the reasoning will apply to any axiomatizable extension of R♯ got by adding classical arithmetical truths. Moreover, it will continue to apply through a large range of variation of the un- derlying logic of R♯, while on a simple and straightforward (...) translation, the classical first-order theory P♯ of Peano arithmetic turns out to be an exact subsystem of R♯. Since the reasoning is elementary, it is formalizable within R♯ itself; i.e., we can actually demonstrate within R♯ (or within P♯, if we care) a statement that, in a natural fashion, asserts the consistency of R♯ itself. The reader is unlikely to have missed the significance of the remarks just made. In plain English, this paper repeals Goedel’s famous second theorem. (That’s the one that asserts that sufficiently strong systems are inadequate to demonstrate their own consistency.) That theorem (or at least the significance usually claimed for it) was a mis- take—a subtle and understandable mistake, perhaps, but a mistake nonetheless. Accordingly, this paper reinstates the formal program which is often taken to have been blasted away by Goedel’s theorems— namely, the Hilbert program of demonstrating, by methods that everybody can recognize as effective and finitary, that intuitive mathematics is reliable. Indeed, the present consistency proof for arithmetic will be recognized as correct by anyone who can count to 3. (So much, indeed, for the claim that the reliability of arithmetic rests on transfinite induction up to ε0, and for the incredible mythology that underlies it.). (shrink)

Many philosophers believe that a deflationist theory of truth must conservatively extend any base theory to which it is added. But when applied to arithmetic, it's argued, the imposition of a conservativeness requirement leads to a serious objection to deflationism: for the Gödel sentence for Peano Arithmetic is not a theorem of PA, but becomes one when PA is extended by adding plausible principles governing truth. This paper argues that no such objection succeeds. The issue turns (...) on how we understand the notion of logical consequence implicit in any conservativeness requirement, and whether we possess a categorical conception of the natural numbers. I offer a disjunctive response: if we possess a categorical conception of arithmetic, then deflationists have principled reason to accept a rich notion of logical consequence according to which the Gödel sentence follows from PA. But if we do not, then the reasons for requiring the derivation of the Gödel sentence lapse, and deflationists are free to accept a conservativeness requirement stated proof-theoretically. Either way, deflationism is in the clear. (shrink)

In nonstandard mathematics, the predicate ‘x is standard’ is fundamental. Recently, ‘relative’ or ‘stratified’ nonstandard theories have been developed in which this predicate is replaced with ‘x is y -standard’. Thus, objects are not standard in an absolute sense, but standard relative to other objects and there is a whole stratified universe of ‘levels’ or ‘degrees’ of standardness. Here, we study stratified nonstandard arithmetic and the related transfer principle. Using the latter, we obtain the ‘reduction theorem’ which states that (...) arithmetical formulas can be reduced to equivalent bounded formulas. Surprisingly, the reduction theorem is also equivalent to the transfer principle. As applications, we obtain a truth definition for arithmetical sentences and we formalize Nelson's notion of impredicativity. (shrink)

The goal of the research programme I describe in this article is a realist epistemology for arithmetic which respects arithmetic's special epistemic status (the status usually described as a prioricity) yet accommodates naturalistic concerns by remaining fundamentally empiricist. I argue that the central claims which would allow us to develop such an epistemology are (i) that arithmetical truths are known through an examination of our arithmetical concepts; (ii) that (at least our basic) arithmetical concepts are accurate mental representations (...) of elements of the arithmetical structure of the independent world; (iii) that (ii) obtains in virtue of the normal functioning of our sensory apparatus. The first of these claims protects arithmetic's special epistemic status relative, for example, to the laws of physics, the second preserves the independence of arithmetical truth, and the third ensures that we remain empiricists. Preliminaries Justifying and grounding concepts Cameras and filters An epistemology for arithmetic Concluding remarks. (shrink)

We show that the elementary theory of the recursively enumerable tt-degrees has the same computational complexity as true first-order arithmetic. As auxiliary results, we prove theorems about exact pairs and initial segments in the tt-degrees.

Kripke's Wittgenstein on Rules and Private Language has enlivened recent discussion of Wittgenstein's later philosophy. Yet it is quite possible to disengage his interpretive thesis from its supporting argumentation. Doing so leaves one with an intriguing sceptical argument which Kripke first powerfully advances, then tries to halt. But contrary to the impression his argument may leave, Kripke's solution and the position it concedes to the Sceptic are deeply allied. Here I shall demonstrate their common assumption, and on that basis argue (...) that Kripke's solution begs the Sceptic's question. Furthermore, I believe we can live with the Sceptic. The sceptical argument can be turned into a reasonable contribution to a kind of nominalism in the philosophy of meaning and truth. (shrink)

The paper presents a new argument supporting the ontological standpoint according to which there are no mathematical facts in any set theoretic model of arithmetical theories. It may be interpreted as showing that it is impossible to construct fact-arithmetic. The importance of this conclusion arises in the context of cognitive science. In the paper, a new type of slingshot argument is presented, which is called hyper-slingshot. The difference between meta-theoretical hyper-slingshots and conventional slingshots consists in the fact that the (...) former are formulated in the semantic meta-language of mathematical theories without the use of the iota-operator or the lambda-operator as the abstractor, whereas the latter require for their expression at least one of these non-standard term-operators. Hyper-slingshots implement simpler language tools in comparison with those used in conventional slingshots. (shrink)

We assess Meyer’s formalization of arithmetic in his [21], based on the strong relevant logic R and compare this with arithmetic based on a suitable logic of meaning containment, which was developed in Brady [7]. We argue in favour of the latter as it better captures the key logical concepts of meaning and truth in arithmetic. We also contrast the two approaches to classical recapture, again favouring our approach in [7]. We then consider our previous development (...) of Peano arithmetic including primitive recursive functions, finally extending this work to that of general recursion. (shrink)

We develop arithmetical measure theory along the lines of Lutz [10]. This yields the same notion of measure 0 set as considered before by Martin-Löf, Schnorr, and others. We prove that the class of sets constructible by r.e.-constructors, a direct analogue of the classes Lutz devised his resource bounded measures for in [10], is not equal to RE, the class of r.e. sets, and we locate this class exactly in terms of the common recursion-theoretic reducibilities below K. We note that (...) the class of sets that bounded truth-table reduce to K has r.e.-measure 0, and show that this cannot be improved to truth-table. For Δ2-measure the borderline between measure zero and measure nonzero lies between weak truth-table reducibility and Turing reducibility to K. It follows that there exists a Martin-Löf random set that is tt-reducible to K, and that no such set is btt-reducible to K. In fact, by a result of Kautz, a much more general result holds. (shrink)

The system called F is essentially a sub-theory of Frege Arithmetic without the ad infinitum assumption that there is always a next number. In a series of papers (Systems for a Foundation of Arithmetic, True” Arithmetic Can Prove Its Own Consistency and Proving Quadratic Reciprocity) it was shown that F proves a large number of basic arithmetic truths, such as the Euclidean Algorithm, Unique Prime Factorization (i.e. the Fundamental Law of Arithmetic), and Quadratic Reciprocity, indeed (...) a sizable amount of arithmetic. In particular, F proves some (but not all) of the Peano Axioms; that is, F proves the axioms of a sub-theory - call it FPA - of second-order Peano-Arithmetic. This short technical note will demonstrate that the converse also holds, in the following sense. F has the same language as second-order Peano Arithmetic except that, in addition, it has a two-place predicate symbol “Μ”. Then it is possible to provide a definition, indeed a reasonable definition, for “Μ” such that FPA proves all the axioms of F. So F and FPA effectively have the same proof-theoretic strength. In particular FPA, which lacks the Successor Axiom stating that every natural number has a successor, is able to prove the Euclidean Algorithm, Unique Prime Factorization, and Quadratic Reciprocity, indeed (again) a sizable amount of arithmetic. (shrink)

It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is Π1T-complete. In this connection, the techniques of a uniform partial truth definition for intuitionistic arithmetic theories is used. The main theorem is applied to the characterization of the predicate logic corresponding to certain variant of the notion of realizable predicate formula. Namely, it is shown that the set of irrefutable predicate formulas is recursively isomorphic to (...) the complement of the set ︀. The notion of Σn-realizability is defined on the basis of the notion of Σn-function. It is proved that the predicate logic of Σn-realizability is Πω+1-hard. (shrink)

This paper proposes a non-realist account of finite arithmetic in which basic numerical propositions implicit in Catholic doctrines such as monotheism and trinitarianism are logical truths and so require no metaphysical (as distinct from logical) preamble of faith.

A language in which we can express arithmetic and which contains its own satisfaction predicate (in the style of Kripke's theory of truth) can be formulated using just two nonlogical primitives: (the successor function) and Sat (a satisfaction predicate).

This monograph presents a non-reflexive proof of Gödel’s First Incompleteness Theorem. That is: we demonstrate the incompleteness of first-order arithmetic without relying on self-reference, paradoxes, or diagonalization. Instead, we base our proof on a cardinality mismatch: the set of arithmetical truths is countable, but the space of candidate proof-sets over those truths has the cardinality of the continuum. Thus, the system cannot, even in principle, admit a recursively enumerable set of axioms that proves all and only the true arithmetical (...) statements—some truths must go unprovable. This is the substance of Theorem 0. We call this result a non-reflexive proof of incompleteness, in contrast to Gödel’s original argument, which crucially relies on self-reference and the arithmetization of syntax. Our proof avoids any appeal to statements like “This sentence is unprovable.” It is entirely based on set-theoretic and logical properties of arithmetic and its metatheory. (shrink)

Frege's scathing comments on Mill on the empirical grounds of arithmetical truth are elaborated. The suggestion is made that some entities are ‘well-behaved' : if you perform two acts and then two more, the ‘result' will be that exactly four acts have occurred. How much it all matters or means is not further discussed.

This paper offers a brief response to Patterson’s paper, ”Descartes on Modality and the Eternal Truths”, which itself is at least in part a response to Moore’s paper, ‘What Descartes ought to have thought about morality”. After reviewing some relevant points from both Patterson’s and Moore’s papers regarding the question of the divine creation of necessary truths, I focus on the possible consequences of Descartes’ understanding of divine simplicity for this interpretive debate. I argue that, by bearing Descartes’ commitment to (...) a strong form of divine simplicity in mind, we can see how he can both be committed to a voluntaristic account of the creation of divine truths and yet indicate that God could not have created things in another way. (shrink)

Michael Potter considers several versions of the view that the truths of arithmetic are analytic and finds difficulties with all of them. There is, I think, no gainsaying his claim that arithmetic cannot be analytic in Kant’s sense. However, his pessimistic assessment of the view that what is now widely called Hume’s principle can serve as an analytic foundation for arithmetic seems to me unjustified. I consider and offer some answers to the objections he brings against it.

The conservativeness argument poses a dilemma to deflationism about truth, according to which a deflationist theory of truth must be conservative but no adequate theory of truth is conservative. The debate on the conservativeness argument has so far been framed in a specific formal setting, where theories of truth are formulated over arithmetical base theories. I will argue that the appropriate formal setting for evaluating the conservativeness argument is provided not by theories of truth over (...) arithmetic but by those over subject matters ‘richer’ than arithmetic, such as set theory. The move to this new formal setting provides deflationists with better defence and brings a broader perspective to the debate. (shrink)

In the 10th century, the Brethren of Purity conceived a henological arithmetic which they believed could explain the mathematical structure of the cosmos (as a macroanthropos), and could lead the student to the discovery of the real substance of his own soul (as a micro-cosmos), a discovery which is the first step towards knowledge of metaphysical and theological truth.

SummaryAccording to Dummett's understanding of Frege, the sense of a denoting expression is a procedure for determining its denotation. The purpose of this article is to pursue this suggestion and develop a semi‐formal interpretation of Fregean sense for the special case of a first‐order language of arithmetic. In particular, we define the sense of each arithmetic expression to be a hypothetical process to determine the denoted number or truth value. The sense‐process is “hypothetical” in that the senses (...) of some expressions cannot be completed in a finite number of steps. The motivation for this work is to explicate an intensional notion of effectiveness in terms of the senses of function names. It is proposed, in particular, that an expression is effective if and only if its sense can be completed in a finite number of steps. It is shown that a function is computable if and only if it has an effective name.RésuméSelon la lecture que Dummet donne de Frege, le sens ?on;une expression consiste en une procédure pour déterminer sa dénotation. Le but de cet article est de développer cette suggestion par une interprétation semi‐formelle du sens frégéen dans le cas particulier ?on;un langage de premier ordre en arithmétique. En particulier, nous définissons comme sens de toute expression mathématique un procédé hypothétique pour déterminer le nombre dénoté ou la valeur de vérité. Le procédé créateur de sens est hypothetique en ce sens que les sens de certaines expressions ne peuvent pas être donnés en un nombre fini de pas. Le but de cette étude est ?on;expliciter une notion intensionnelle ?on;effectuabilite en termes de sens des noms de fonction. II est en particulier propose qu'une expression soit dite effectuable si et seulement si son sens peut être épuisé en un nombre fini de pas. On montre qu'une fonction est calculable si et seulement si elle a un nom effectuable.ZusammenfassungDummets Auffassung von Frege gemäss besteht der Sinn eines denotierenden Ausdruckes in einem Verfahren, das dessen Denotation bestimmt. Es ist der Zweck der vorliegenden Arbeit, die‐sen Vorschlag weiterzufuUhren und eine halbformale Interpretation des Fregeschen Sinnes fiir den besonderen Fall der Sprache erster Stufe der Arithmetik zu entwickeln. Es wird im besonderen der Sinn eines jeden arithmetischen Ausdruckes als hypothetisches Verfahren zur Bestimmung der denotierten Zahl oder des Wahrheitswertes definiert. Die Sinngebung ist insofern hypothe‐tisch, als der Sinn gewisser Ausdrucke nicht in einer endlichen Zahl von Schritten gegeben wer‐den kann. Das Anliegen der Arbeit grundet in der Absicht, einen intensionalen Begriff der Effek‐tivitat aufgrund des Sinnes von Funktionsnamen zu erlautern. Es wird im besonderen festgelegt, dass ein Ausdruck dann und nur dann effektiv sei, wenn sein Sinn in einer endlichen Zahl von Schritten erreicht werden kann. Es wird gezeigt, dass eine Funktion genau dann berechenbar ist, wenn sie einen effektiven Namen hat. (shrink)

This chapter treats the question of how Frege understands the connection between the familiar truths of ordinary arithmetic and the unfamiliar and complex truths with which his formal proofs conclude. It is argued that although Frege does not intend ordinary and formal sentences to express the same thoughts or to be “about” the same objects, nevertheless the relationship between the two kinds of sentence is intended to be sufficiently close that the success of the project would, in fact, have (...) demonstrated the purely-logical status of ordinary arithmetic. It is argued, as against Joan Weiner, that the semantic distance between ordinary and derived sentences does not undermine this straightforward reading of Frege’s project. (shrink)

The subject of the first section is Carnapian modal logic. One of the things I will do there is to prove that certain description principles, viz. the ''self-predication principles'', i.e. the principles according to which a descriptive term satisfies its own descriptive condition, are theorems and that others are not. The second section will be devoted to Carnapian modal arithmetic. I will prove that, if the arithmetical theory contains the standard weak principle of induction, modal truth collapses to (...) truth. Then I will propose a different formulation of Carnapian modal arithmetic and establish that it is free of collapse. Noteworthy is that one can retain the standard strong principle of induction. I will occupy myself in the third section with Carnapian epistemic logic and arithmetic. Here too it is claimed that the standard weak principle of induction is invalid and that the alternative principle is valid. In the fourth and last section I will get back to the self-predication principles and I will point to some of the consequences if one adds them to Carnapian Epistemic arithmetic. The interaction of self-predication principles and the strong principle of induction results in a collapse of de re knowability. (shrink)

In early analytic philosophy, one of the most central questions concerned the status of arithmetical objects. Frege argued against the popular conception that we arrive at natural numbers with a psychological process of abstraction. Instead, he wanted to show that arithmetical truths can be derived from the truths of logic, thus eliminating all psychological components. Meanwhile, Dedekind and Peano developed axiomatic systems of arithmetic. The differences between the logicist and axiomatic approaches turned out to be philosophical as well as (...) mathematical. In this paper, I will argue that Dedekind’s approach can be seen as a precursor to modern structuralism and as such, it enjoys many advantages over Frege’s logicism. I also show that from a modern perspective, Frege’s criticism of abstraction and psychologism is one-sided and fails against the psychological processes that modern research suggests to be at the heart of numerical cognition. The approach here is twofold. First, through historical analysis, I will try to build a clear image of what Frege’s and Dedekind’s views on arithmetic were. Then, I will consider those views from the perspective of modern philosophy of mathematics, and in particular, the empirical study of arithmetical cognition. I aim to show that there is nothing to suggest that the axiomatic Dedekind approach could not provide a perfectly adequate basis for philosophy of arithmetic. (shrink)