The subject of this article is Modal-Epistemic Arithmetic (MEA), a theory introduced by Horsten to interpret Epistemic Arithmetic (EA), which in turn was introduced by Shapiro to interpret Heyting Arithmetic. I will show how to interpret MEA in EA such that one can prove that the interpretation of EA is MEA is faithful. Moreover, I will show that one can get rid of a particular Platonist assumption. Then I will discuss models for MEA in light (...) of the problems of logical omniscience and logical competence. Awareness models, impossible worlds models and syntactical models have been introduced to deal with the first problem. Certain conditions on the accessibility relations are needed to deal with the second problem. I go on to argue that those models are subject to the problem of quantifying in, for which I will provide a solution. (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)

An epistemic formalization of arithmetic is constructed in which certain non-trivial metatheoretical inferences about the system itself can be made. These inferences involve the notion of provability in principle, and cannot be made in any consistent extensions of Stewart Shapiro's system of epistemic arithmetic. The system constructed in the paper can be given a modal-structural interpretation.

An epistemic formalization of arithmetic is constructed in which certain non-trivial metatheoretical inferences about the system itself can be made. These inferences involve the notion of provability in principle, and cannot be made in any consistent extensions of Stewart Shapiro's system of epistemic arithmetic. The system constructed in the paper can be given a modal-structural interpretation.

This paper presents a defense of Epistemic Arithmetic as used for a formalization of intuitionistic arithmetic and of certain informal mathematical principles. First, objections by Allen Hazen and Craig Smorynski against Epistemic Arithmetic are discussed and found wanting. Second, positive support is given for the research program by showing that Epistemic Arithmetic can give interesting formulations of Church's Thesis.

This paper propounds the following theses: 1). that the traditional focus on the Blackstone ratio of errors as a device for setting the criminal standard of proof is ill-conceived, 2). that the preoccupation with the rate of false convictions in criminal trials is myopic, and 3). that the key ratio of interest, in judging the political morality of a system of criminal justice, involves the relation between the risk that an innocent person runs of being falsely convicted of a serious (...) crime and the risk of being criminally victimized by someone who was falsely acquitted. (shrink)

In the first chapter I have introduced Carnapian intensional logic against the background of Frege's and Quine's puzzles. The main body of the dissertation consists of two parts. In the first part I discussed Carnapian modal logic and arithmetic with descriptions. In the second chapter, I have described three Carnapian theories, CCL, CFL, and CNL. All three theories have three things in common. First, they are formulated in languages containing description terms. Second, they contain a system of modal logic. (...) Third, they do not contain the unrestricted classical substitution principle, but they do contain the classical substitution principle restricted to non-modal formulas and the Carnapian substitution principle, which says that two terms can be substituted salva veritate if they are necessarily coreferential. There are two major differences between the three theories. First, CCL and CFL allow universal instantiation with description terms, whereas CNL does not. Moreover, the quantificational theory of the CCL is classical, whereas the quantificational theory of CFL is a free logic. Another difference is that CCL and CFL contain different description principles. Most importantly, the description principle of CCL ensures that even improper descriptions have a denotation, whereas the description principle of CFL does not guarantee this. CNL does not have a description principle. In the third chapter, I have studied collapse arguments for CCL, CFL, and CNL. A collapse argument is an argument for the following statement: if p is true, then it is necessarily true. A crucial role in the proofs of these collapse results was played by so-called self-predication principles, which say that under certain conditions the predicate that expresses the descriptive condition can be combined by the description term formed out of that predicate with the result being a true sentence. In this chapter I have discussed a collapse argument for the extension of CCL with a self-predication principle, I have given a collapse argument for a similarly extended CFL, and most importantly, I have given a collapse argument for the extension of CNL with a self- predication principle. Finally, I have argued that the relevant self-predication principles are unsound under a Carnapian interpretation. In the fourth chapter, I have studied the extension of Peano Arithmetic with a Carnapian modal logic C, which is a dummy letter standing for either CCL or CFL. One can prove that the principle of the necessity of identity is a theorem of CPA. This implies that one gets a collapse result for CPA. The standard principle of weak induction was crucial for the proof. One can also prove that, if one assumes a particular self-predication principle, and if one assumes the principle of strong induction or, equivalently, the least-number principle, then one gets a partial collapse of de re modal truths in de dicto modal truths. I have argued that, if the box operator is interpreted as a metaphysical necessity operator, then Platonists would not be inimical to the collapse result. But if CPA is extended with a physical theory, then there is a threat that physical truths become physical necessiti es. It was shown that, under a Carnapian interpretation, the standard principle of weak induction is unsound, and that it can be replaced by a Carnapian principle of weak induction that is sound. The problem of logical and mathematical omniscience prevents ordinary Carnapian intensional logic from being taken seriously as a logic adequate for describing the principles of demonstrability. Yet many of the proof-theoretic results of the first part carry over to the part on Carnapian epistemic arithmetic with descriptions, since proof-theoretic results are independent of the informal reading of the operators. In the fifth chapter, I looked at extensions of arithmetic with a modal logic in which the box operator is interpreted as a demonstrability operator. A first extension in that sense is Shapiro s Epistemic Arithmetic. Shapiro himself offered the problem of mathematical omniscience as a reason why it is difficult to find a model theory for EA. Horsten attempted to provide a model theory via the detour of Modal-Epistemic Arithmetic. The attention of the reader was drawn to an incoherence in the model theory of. Two alternative solutions were presented and, after a short discussion of the problem of de re demonstrability one of those alternatives was chosen. The discussion of the problem of de re demonstrability made it clear that it would be interesting to study the epistemic properties of notation systems. Horsten himself provided a framework for this, viz. Carnapian Epistemic Arithmetic, and he started a systematic study of the epistemic properties of notation systems within that framework. However, he did not provide non-trivial but adequate models. To make a start with solving the problem of finding good models for CEA, I introduced Carnapian Modal-Epistemic Arithmetic In constructing CMEA I incorporated the lesson about the principle of weak induction learnt in the fourth chapter. In the sixth chapter, I gave a critical assessment of an argument concerning the limits of de re demonstrability about the natural numbers. The conclusion of the Description Argument is that it is undemonstrable that there is a natural number that has a certain property but of which it is undemonstrable that it has that property. A crucial step in the Description Argument involved a self-predication principle. Making good use of one of the results obtained in the third chapter, I proved a collapse result for the background theory against which the Description Argument was formulated. I concluded that either the either the Description Argument is sound but its conclusion is trivial, o r the Description Argument is unsound, or it is a cheapshot. As an appendix I included an article co-authored by prof. dr. Leon Horsten and me. The topic of the article is indirectly related to some other topics investigated in my dissertation. Also, it backs up one of the addition al theses I might be asked to publicly defend during my doctoral exam. T he topic of the appendix is the set of the so-called paradoxes of strict implication. Jonathan Lowe has argued that a particular variation on C.I. Lewis notion of strict implication avoids the paradoxes of strict implication. Pace Lowe, it is argued that Lowe s notion of implication does not achieve this aim. Moreover, a general argument is offered to the effect that no other variation on Lewis notion of constantly strict implication describes the logical behaviour of natural language conditional s in a satisfactory way. (shrink)

Philosophers of science since Nagel have been interested in the links between intertheoretic reduction and explanation, understanding and other forms of epistemic progress. Although intertheoretic reduction is widely agreed to occur in pure mathematics as well as empirical science, the relationship between reduction and explanation in the mathematical setting has rarely been investigated in a similarly serious way. This paper examines an important particular case: the reduction of arithmetic to set theory. I claim that the reduction is unexplanatory. (...) In defense of this claim, I offer evidence from mathematical practice, and I respond to contrary suggestions due to Steinhart, Maddy, Kitcher and Quine. I then show how, even if set-theoretic reductions are generally not explanatory, set theory can nevertheless serve as a legitimate foundation for mathematics. Finally, some implications of my thesis for philosophy of mathematics and philosophy of science are discussed. In particular, I suggest that some reductions in mathematics are probably explanatory, and I propose that differing standards of theory acceptance might account for the apparent lack of unexplanatory reductions in the empirical sciences. (shrink)

The central topic of this article is (the possibility of) de re knowledge about natural numbers and its relation with names for numbers. It is held by several prominent philosophers that (Peano) numerals are eligible for existential quantification in epistemic contexts (‘canonical’), whereas other names for natural numbers are not. In other words, (Peano) numerals are intimately linked with de re knowledge about natural numbers, whereas the other names for natural numbers are not. In this article I am looking (...) for an explanation of this phenomenon. It is argued that the standard induction scheme plays a key role. (shrink)

By “epistemic modals,” I mean epistemic uses of modal words: adverbs like “necessarily,” “possibly,” and “probably,” adjectives like “necessary,” “possible,” and “probable,” and auxiliaries like “might,” “may,” “must,” and “could.” It is hard to say exactly what makes a word modal, or what makes a use of a modal epistemic, without begging the questions that will be our concern below, but some examples should get the idea across. If I say “Goldbach’s conjecture might be true, and it (...) might be false,” I am not endorsing the Cartesian view that God could have made the truths of arithmetic come out differently. I make the claim not because I believe in the metaphysical contingency of mathematics, but because I know that Goldbach’s conjecture has not yet been proved or refuted. Similarly, if I say “Joe can’t be running,” I am not saying that Joe’s constitution prohibits him from running, or that Joe is essentially a non-runner, or that Joe isn’t allowed to run. My basis for making the claim may be nothing more than that I see Joe’s running shoes hanging on a hook. (shrink)

A crucial part of the contemporary interest in logicism in the philosophy of mathematics resides in its idea that arithmetical knowledge may be based on logical knowledge. Here an implementation of this idea is considered that holds that knowledge of arithmetical principles may be based on two things: (i) knowledge of logical principles and (ii) knowledge that the arithmetical principles are representable in the logical principles. The notions of representation considered here are related to theory-based and structure-based notions of representation (...) from contemporary mathematical logic. It is argued that the theory-based versions of such logicism are either too liberal (the plethora problem) or are committed to intuitively incorrect closure conditions (the consistency problem). Structure-based versions must on the other hand respond to a charge of begging the question (the circularity problem) or explain how one may have a knowledge of structure in advance of a knowledge of axioms (the signature problem). This discussion is significant because it gives us a better idea of what a notion of representation must look like if it is to aid in realizing some of the traditional epistemic aims of logicism in the philosophy of mathematics. (shrink)

This is the first critical edition of the first and second Epistles of the Brethren Purity--the Rasa 'il--in Arabic with a fully annotated English translation. It presents technical and epistemic analyses of mathematical concepts and their metaphysical bases, and an overview of the mathematical sciences within Islamic intellectual milieu.

Most of the arguments usually appealed to in order to support the view that some abstraction principles are analytic depend on ascribing to them some sort of existential parsimony or ontological neutrality, whereas the opposite arguments, aiming to deny this view, contend this ascription. As a result, other virtues that these principles might have are often overlooked. Among them, there is an epistemic virtue which I take these principles to have, when regarded in the appropriate settings, and which I (...) suggest to call ‘epistemic economy’. My purpose is to isolate and clarify this notion by appealing to some examples concerning the definition of natural and real numbers. (shrink)

This paper ties together three threads of discussion about the following question: in accepting a system of axioms S, what else are we thereby warranted in accepting, on the basis of accepting S? First, certain foundational positions in the philosophy of mathematics are said to be epistemically stable, in that there exists a coherent rationale for accepting a corresponding system of axioms of arithmetic, which does not entail or otherwise rationally oblige the foundationalist to accept statements beyond the logical (...) consequences of those axioms. Second, epistemic stability is said to be incompatible with the implicit commitment thesis, according to which accepting a system of axioms implicitly commits the foundationalist to accept additional statements not immediately available in that theory. Third, epistemic stability stands in tension with the idea that in accepting a system of axioms S, one thereby also accepts soundness principles for S. We offer a framework for analysis of sets of implicit commitment which reconciles epistemic stability with the latter two notions, and argue that all three ideas are in fact compatible. (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)

Michael Dummett's argument for intuitionism can be criticized for the implicit reliance on the existence of what might be called absolutely undecidable statements. Neil Tennant attacks epistemic optimism, the view that there are no such statements. I expose what seem serious flaws in his attack, and I suggest a way of defending the use of classical logic in arithmetic that circumvents the issue of optimism. I would like to thank an anonymous referee for helpful comments. CiteULike Connotea Del.icio.us (...) What's this? (shrink)

In this note two propositions about the epistemic formalization of Church's Thesis are proved. First it is shown that all arithmetical sentences deducible in Shapiro's system EA of Epistemic Arithmetic from ECT are derivable from Peano Arithmetic PA + uniform reflection for PA. Second it is shown that the system EA + ECT has the epistemic disjunction property and the epistemic numerical existence property for arithmetical formulas.

In “The Paradox of the Knower without Epistemic Closure”, MIND 110:319-33, 2001, I develop a version of the Knower Paradox which does not assume epistemic closure, and I use it to argue that the original Knower Paradox does not support an argument against epistemic closure. In “The Paradox of the Knower without Epistemic Closure?”, MIND 113:95-107, 2004, Gabriel Uzquiano, using his own result, argues that my rebuttal to the anti-closure argument is not successful. I respond here (...) by arguing that in order to use Uzquiano’s result in an argument against closure, one must assume an implausible skepticism about arithmetic. (shrink)

This essay corrects an error in the presentation of the Paradox of the Knowledge-Plus Knower, which is the variant of Kaplan and Montague’s Knower Paradox presented in C. Cross 2001: ‘The Paradox of the Knower without Epistemic Closure,’ MIND, 110, pp. 319–33. The correction adds a universally quantified transitivity principle for derivability as an additional assumption leading to paradox. This correction does not affect the status of the Knowledge-Plus paradox as a rebuttal to an argument against epistemic closure, (...) since the quantified transitivity principle is true in the standard model of arithmetic and therefore innocuous. (shrink)

This book is written so as to be ‘accessible to philosophers without a mathematical background’. The reviewer can assure the reader that this aim is achieved, even if only by focusing throughout on just one example of an arithmetical truth, namely ‘7+5=12’. This example’s familiarity will be reassuring; but its loneliness in this regard will not. Quantified propositions — even propositions of Goldbach type — are below the author’s radar.The author offers ‘a new kind of arithmetical epistemology’, one which ‘respects (...) certain important intuitions’ 1 : apriorism, realism, and empiricism. The book contains some clarification of these ‘isms’, and some thoughtful critiques of major positions regarding them, as espoused by such representative figures as Boghossian, Bealer, Peacocke, Field, Bostock, Maddy, Locke, Kant, C.I. Lewis, Ayer, Quine, Fodor, and McDowell. The philosophical reader will find some interest and value in these wider-ranging discussions. Our concern in this review, however, is to examine closely the original positive proposal on offer.Arithmetical truths, the author maintains, are conceptual truths. Knowing truths like 7+5=12 involves no ‘epistemic reliance on any empirical evidence’; but that, she says, is not to claim ‘epistemic independence of the senses altogether’. She wants to show that "experience grounds our concepts … and then mere conceptual examination enables us to learn arithmetical truths ." Concepts that are ‘appropriately sensitive’ to ‘the nature of [an independent] reality’ she calls grounded. Because of the role of grounded concepts, ‘arithmetical truths explain our arithmetical beliefs in the right sort of way for those beliefs to count as knowledge’ .In the context of her concentration on the special nature of arithmetical knowledge, the author offers what could strike some bystanders as an unnecessarily over-ambitious account of knowledge tout court. Knowledge, for the author, is "true belief which … ". (shrink)

Philosophizing, according to E. Martens, can be seen as an elemental cultural technology, like arithmetic or writing, which both can and should be acquired in childhood. Martens is proposing here an understanding of philosophy that attributes value not only to the content canon, but also to the process itself, as Wittgenstein, for one, also did when he stated in the Tractatus Logico-Philosophicus, “Philosophy is not a doctrine, but an activity.” For Socrates, this activity consisted in “giving an account of (...) ourselves, our knowledge, our way of life.” In Nietzsche’s view, the precondition for this kind of accounting is the personal capacity for self-distancing, which allows us to grasp our quite individual primal experiences of emotion, perception, sudden illuminations of insight, and so on, as general concepts and logical structures. (shrink)

The aim of this paper is threefold. Firstly, §1 and §2 introduce the novel concept logical akrasia by analogy to epistemic akrasia. If successful, the initial sections will draw attention to an interesting akratic phenomenon which has not received much attention in the literature on akrasia (although it has been discussed by logicians in different terms). Secondly, §3 and §4 present a dilemma related to logical akrasia. From a case involving the consistency of Peano Arithmetic and Gödel’s Second (...) Incompleteness Theorem it’s shown that either we must be agnostic about the consistency of Peano Arithmetic or akratic in our arithmetical theorizing. If successful, these sections will underscore the pertinence and persistence of akrasia in arithmetic (by appeal to Gödel’s seminal work). Thirdly, §5 concludes by suggesting a way of translating the dilemma of arithmetical akrasia into a case of regular epistemic akrasia; and further how one might try to escape the dilemma when it’s framed this way. (shrink)

We propose that, for the purpose of studying theoretical properties of the knowledge of an agent with Artificial General Intelligence (that is, the knowledge of an AGI), a pragmatic way to define such an agent’s knowledge (restricted to the language of Epistemic Arithmetic, or EA) is as follows. We declare an AGI to know an EA-statement φ if and only if that AGI would include φ in the resulting enumeration if that AGI were commanded: “Enumerate all the EA-sentences (...) which you know.” This definition is non-circular because an AGI, being capable of practical English communication, is capable of understanding the everyday English word “know” independently of how any philosopher formally defines knowledge; we elaborate further on the non-circularity of this circular-looking definition. This elegantly solves the problem that different AGIs may have different internal knowledge definitions and yet we want to study knowledge of AGIs in general, without having to study different AGIs separately just because they have separate internal knowledge definitions. Finally, we suggest how this definition of AGI knowledge can be used as a bridge which could allow the AGI research community to import certain abstract results about mechanical knowing agents from mathematical logic. (shrink)

A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While the bulk of the paper is devoted to developing the details of the semantics, to illustrate the scope of this approach, we show that the construction produces (i) a model of a modal version of Church's Thesis and a variant of a modal set (...) theory due to Goodman and Scedrov, (ii) a model of a modal version of Troelstra's generalized continuity principle together with a fragment of second-order arithmetic, and (iii) a model based on Scott's graph model (for the untyped lambda calculus) which witnesses the failure of the stability of non-identity. (shrink)

New epistemic principles are formulated in the language of Shapiro's system of Epistemic Arithmetic. It is argued that some plausibility can be attributed to these principles. The relations between these principles and variants of controversial constructivistic principles are investigated. Special attention is given to variants of the intuitionistic version of Church's thesis and to variants of Markov's principle.

I will examine three claims made by Ackerman and Kripke. First, they claim that not any arithmetical terms is eligible for universal instantiation and existential generalisation in doxastic or epistemic contexts. Second, Ackerman claims that Peano numerals are eligible for universal instantiation and existential generalisation in doxastic or epistemic contexts. Kripke's position is a bit more subtle. Third, they claim that the successor relation and the smaller-than relation must be effectively calculable. These three claims will be examined from (...) the framework of modal-epistemic arithmetic, i.e. arithmetic extended with certain modal, epistemic and modal-epistemic principles. I will present theorems that give support to the claims made by Ackerman and Kripke. (shrink)

Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it (...) can be overcome. We introduce the concept of purity for theories of arithmetic: a theory of arithmetic is pure when it only proves arithmetical truths. Then, we argue that, under Isaacson’s thesis, some PA-provable truths—including transfinite induction claims for infinite ordinals and some consistency statements—are seemingly not arithmetical in Isaacson’s sense, and hence that Isaacson’s thesis might entail the impurity of PA. Nonetheless, we conjecture that the advocate of Isaacson’s thesis can avoid this undesirable consequence: the arithmetical nature, as understood by Isaacson, of all contentious PA-provable statements can be justified. As a case study, we explore how this is done for transfinite induction claims with infinite ordinals below ε0. To this end, we show that the PA-proof of such claims employs exclusively resources from finite mathematics, and that ordinals below ε0 are finitary objects despite being infinite. (shrink)

This paper concerns the epistemic status of "Hume's principle"--the assertion that for any concepts and , the number of s is the same as the number of s just in case the s and the s are in one-one correspondence. I oppose the view that Hume's principle is a stipulation governing the introduction of a new concept with the thesis that it represents the correct analysis of a concept in use. Frege's derivation of the basic laws of arithmetic (...) from Hume's principle shows our pure arithmetical knowledge to arise out of the most common everyday applications we make of the numbers. The analysis of arithmetical knowledge in terms of Hume's principle ties our conception of number to the interconnections of which our concepts of divided reference are capable; in so doing, it locates the origin of our conception of number in the structure of our conceptual framework. (shrink)

This paper considers whether incompatibilism, the view that negation is to be explained in terms of a primitive notion of incompatibility, and Fregeanism, the view that arithmetical truths are analytic according to Frege’s definition of that term in §3 of Foundations of Arithmetic, can both be upheld simultaneously. Both views are attractive on their own right, in particular for a certain empiricist mind-set. They promise to account for two philosophical puzzling phenomena: the problem of negative truth and the problem (...) of epistemic access to numbers. For an incompatibilist, proofs of numerical non-identities must appeal to primitive incompatibilities. I argue that no analytic primitive incompatibilities are forthcoming. Hence incompatibilists cannot be Fregeans. (shrink)

-/- Provability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. -/- From a philosophical point of view, provability logic is interesting because (...) the concept of provability in a fixed theory of arithmetic has a unique and non-problematic meaning, other than concepts like necessity and knowledge studied in modal and epistemic logic. Furthermore, provability logic provides tools to study the notion of self-reference. (shrink)

Frege's arithmetical-platonism is glossed as the first step in developing the thesis; however, it remains silent on the subject of structures in mathematics: the obvious examples being groups and rings, lattices and topologies. The structuralist objects to this silence, also questioning the sufficiency of Fregean platonism is answering a number of problems: e.g. Benacerraf's Twin Puzzles of Epistemic and Referential Access. The development of structuralism as a philosophical position, based on the slogan 'All mathematics is structural' collapses: there is (...) no single coherent account which remains faithful to the tenets of structuralism and solves the puzzles of platonism. This prompts the adoption of a more modest structuralism, the aim of which is not to solve the problems facing arithmetical-platonism, but merely to give an account of the 'obviously structural areas of mathematics'. Modest strucmralism should complement an account of mathematical systems; here, Frege's platonism fulfils that role, which then constrains and shapes the development of this modest structuralism. Three alternatives are considered; a substitutional account, an account based on a modification of Dummett's theory of thin reference and a modified from of in re structuralism. This split level analysis of mathematics leads to an investigation of the robustness of the truth predicate over the two classes of mathematical statement. Focussing on the framework set out in Wright's Truth and Objectivity, a third type of statement is identified in the literature: Hilbert's formal statements. The following thesis arises: formal statements concern no special subject matter, and are merely minimally truth apt; the statements of structural mathematics form a subdiscourse - identified by the similarity of the logical grammar - displaying cognitive command. Thirdly, the statements of mathematics which concern systems form a subdiscourse which has both cognitive command and width of cosmological role. The extensions of mathematical concepts are such that best practice on the part of mathematicians either tracks or determines that extension - at least in simple cases. Examining the notions of response dependence leads to considerations of indefinite extensibility and intuitionism. The conclusion drawn is that discourse about structures and mathematical systems are response dependent but that this does not give rise to any revisionary arguments contra intuitionism. (shrink)

We translate Socrates’ famous saying I know that I know nothing into the arithmetical sentence I prove that I prove nothing. Then it is easy to show that this translated saying is formally undecidable in formal arithmetic, using Gödel’s Second Incompleteness Theorem. We investigate some variations of this Socrates-Gödel sentence. In an appendix we sketch a ramified epistemic logic with propositional quantifiers in order to analyze the Socrates-Gödel sentence in a more logical way, separated from the arithmetical context.

Do numbers, sets, and so forth, exist? What do mathematical statements mean? Are they literally true or false, or do they lack truth values altogether? Addressing questions that have attracted lively debate in recent years, Stewart Shapiro contends that standard realist and antirealist accounts of mathematics are both problematic. As Benacerraf first noted, we are confronted with the following powerful dilemma. The desired continuity between mathematical and, say, scientific language suggests realism, but realism in this context suggests seemingly intractable (...) class='Hi'>epistemic problems. As a way out of this dilemma, Shapiro articulates a structuralist approach. On this view, the subject matter of arithmetic, for example, is not a fixed domain of numbers independent of each other, but rather is the natural number structure, the pattern common to any system of objects that has an initial object and successor relation satisfying the induction principle. Using this framework, realism in mathematics can be preserved without troublesome epistemic consequences. Shapiro concludes by showing how a structuralist approach can be applied to wider philosophical questions such as the nature of an "object" and the Quinean nature of ontological commitment. Clear, compelling, and tautly argued, Shapiro's work, noteworthy both in its attempt to develop a full-length structuralist approach to mathematics and to trace its emergence in the history of mathematics, will be of deep interest to both philosophers and mathematicians. (shrink)

Proof-theoretic reflection principles have been discussed in proof theory ever since Gödel’s discovery of the incompleteness theorems. But these reflection principles have not received much attention in the philosophical community. The present chapter aims to survey some of the principal meta-mathematical results on the iteration of proof-theoretic reflection principles and investigate these results from a logico-philosophical perspective; we will concentrate on the epistemological significance of these technical results and on the epistemic notions involved in the proofs. In particular, we (...) will focus on the notions of commitment to and acceptance of a theory. Special attention is given to the connection between proof-theoretic reflection and axiomatic truth theories. After distinguishing between different types of proof-theoretic reflection principles, we review some proof-theoretic results concerning extensions of formal theories by (iterated) reflection principles. As basis theories, we concentrate on standard arithmetical and elementary axiomatic truth theories. We then go on to explore the epistemological significance of these results. In this investigation, we aim to show that the epistemic notion of acceptance of (or commitment to) a theory plays a crucial role in the philosophical argumentation for reflection principles and their iteration. (shrink)

Reflection principles are of central interest in the development of axiomatic theories. Whereas they are independent statements they appear to have a specific epistemological status. Our trust in those principles is as warranted as our trust in the axioms of the system itself. This paper is an attempt in clarifying this special epistemic status. We provide a motivation for the adoption of uniform reflection principles by their analogy to a form of the constructive \(\omega \) -rule. Additionally, we analyse (...) the role of informal arithmetic and the conception of natural numbers as an inductive structure, also with regard to extra conceptual resources such as a primitive truth predicate. (shrink)

This volume is primarily concerned with equality as a basic component of the democratic character of representation. In other words, of the many types of equality that have attracted the attention of theorists since democracy's beginnings - arithmetic equality, equality before the law, equality of opportunity- we would like to draw attention to representational equality, that is, the role of equality in systems of democratic representation. In what form is equality present in traditional forms of electoral representation? How can (...) it be secured in new forms of representation, such as claims-making, deliberative, klerotarian and epistemic representation? And to what extent are electoral or non-electoral models of representation able to accommodate increasing social inequalities? The articles in this volume discuss these issues from a normative and conceptual point of view, seeking to shed new light on the important but under-explored relationship between equality and representation. This book was originally published as a special issue of Critical Review of International Social and Political Philosophy. (shrink)

According to Quine, Charles Parsons, Mark Steiner, and others, Russell’s logicist project is important because, if successful, it would show that mathematical theorems possess desirable epistemic properties often attributed to logical theorems, such as aprioricity, necessity, and certainty. Unfortunately, Russell never attributed such importance to logicism, and such a thesis contradicts Russell’s explicitly stated views on the relationship between logic and mathematics. This raises the question: what did Russell understand to be the philosophical importance of logicism? Building on recent (...) work by Andrew Irvine and Martin Godwyn, I argue that Russell thought a systematic reduction of mathematics increases the certainty of known mathematical theorems (even basic arithmetical facts) by showing mathematical knowledge to be coherently organized. The paper outlines Russell’s theory of coherence, and discusses its relevance to logicism and the certainty attributed to mathematics. (shrink)

In this paper, I start by describing and examining the main results about the option of formalizing the Yablo Paradox in arithmetic. As it is known, although it is natural to assume that there is a right representation of that paradox in first order arithmetic, there are some technical results that give rise to doubts about this possibility. Then, I present some arguments that have challenged that Yablo’s construction is non-circular. Just like that, Priest (1997) has argued that (...) such formalization shows that Yablo’s Paradox involves implicit circularity. In the same direction, Beall (2001) has introduced epistemic factors in this discussion. Even more, Priest has also argued that the introduction of infinitary reasoning would be of little help. Finally, one could reject definitions of circularity in term of fixed-point adopting non-well-founded set theory. Then, one could hold that the Yablo paradox and the Liar paradox share the same non-well-founded structure. So, if the latter is circular, the first is too. In all such cases, I survey Cook’s approach (2006, forthcoming) on those arguments for the charge of circularity. In the end, I present my position and summarize the discussion involved in this volume. En este artículo, describo y examino los principales resultados vinculados a la formalización de la paradoja de Yablo en la aritmética. Aunque es natural suponer que hay una representación correcta de la paradoja en la aritmética de primer orden, hay algunos resultados técnicos que hacen surgir dudas acerca de esta posibilidad. Más aún, presento algunos argumentos que han cuestionado que la construcción de Yablo no sea circular. Así, Priest (1997) ha argumentado que la formalización de la paradoja de Yablo en la aritmética de primer orden muestra que la misma involucra implícitamente circularidad. En la misma dirección, Beall (2001) ha introducido factores epistémicos en esta discusión. Más aún, Priest ha también argumentado que la introducción de razonamiento infinitario como complemento de la formalización en la aritmética sería de poca ayuda. Finalmente, se podría rechazar todo intento de dar definiciones de circularidad en términos de puntos fijos adoptando teoría de conjuntos infundados. Entonces, se podría sostener que la paradoja de Yablo y la del mentiroso comparten la misma estructura infundada. Por eso, si la última es circular, también lo es la primera. En todos los casos, presento el enfoque de Roy Cook (2006, en prensa) sobre estos argumentos que atribuyen circularidad a la construcción de Yablo. En el final, presento mi posición y un breve resumen de la discusión involucrada en este volumen. (shrink)

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 (...) that this flaw afflicts many proposals discussed in the literature; we defend a new, stable disentangled theory, double second-order arithmetic. (shrink)

Richard Cartwright's impact on other philosophers has been as much a product of his own personal contact with students and colleagues as the result of his written work. The essays in this book demonstrate the deep influence he has had, not only by his thinking but equally by his style and manner and, above all, by his clarity and purity of intention. All of the essays are concerned with the questions of logic, language, and metaphysics that have been at the (...) core of Cartwright's own work. The chapters and their authors are: The Consistency of Frege's Foundations of Arithmetic, George Boolos. Russell's "No-Classes" Theory of Classes, Leonard Linsky. Quine's Indeterminacy, Charles S. Chihara. Justifying Symbolizations, Harold Levin. Substitutivity, Scott Soames. Moore-Paradox, Sincerity Conditions, and Epistemic Qualification, Charles E. Caton. Matching Illocutionary Act Types, William P. Alston. Scattered Objects, Roderick M. Chisholm. Parts and Places, Helen Morris Cartwright. Ruminations on an Account of Personal Identity, Judith Jarvis Thomson. G_del's Ontological Proof, Jordan Howard Sobel. "The Concept of the Subject Contains the Concept of the Predicate," David Wiggins. Judith Jarvis Thomson is Professor of Philosophy at MIT. Philosophical Essays, the first collection of Richard Cartwright's work, is being published simultaneously by The MIT Press. (shrink)

The project of this Précis de philosophie de la logique et des mathématiques (vol. 1 under the direction of F. Poggiolesi and P. Wagner, vol. 2 under the direction of A. Arana and M. Panza) aims to offer a rich, systematic and clear introduction to the main contemporary debates in the philosophy of mathematics and logic. The two volumes bring together the contributions of thirty researchers (twelve for the philosophy of logic and eighteen for the philosophy of mathematics), specialists in (...) the history or philosophy of logic or mathematics. Each volume consists of ten chapters; each chapter is about forty pages, is independent from the others and deals with a particular philosophical question about logic or mathematics. The objective is to offer to the French-speaking reader a reference book. On many of the issues addressed, this Précis offers the first clear and thorough synthesis that is available in French. -/- This book is intended for third year / master's students, but also for teachers of philosophy in secondary or higher education, for logicians and mathematicians willing to take a philosophical look at the fundamental concepts of their discipline, and for any reader interested in the basic issues discussed in the philosophy of logic and mathematics. Each chapter is self-contained, although some basic training in logic (or in mathematics, as the case may be) is required. The book should be looked at as a comprehensive framework for contemporary discussions in the philosophy of logic and mathematics, while also giving some guidance on the disciplinary content required by these discussions. -/- The first three chapters of the present volume (on the philosophy of mathematics) are devoted to the history of the philosophy of mathematics: from antiquity to the modern era, and from this period to the foundational crisis of the nineteenth century, to the twentieth century. Next, four chapters deal with the crucial questions for the philosophy of mathematics of the twentieth century: the opposition and/or comparison of set theory and category theory as foundational frameworks for mathematics; mathematical constructivism; the analysis of calculability; and Benaceraff's problem. The two following chapters are focused on the philosophy of mathematical practice, by treating the notion of ideals of proof, in particular explanation and purity, and the notion of informal proof and the use of visual artifacts in mathematical argumentation. Finally the last chapter deals with the applicability of mathematics, including the role of probability. -/- In Chapter 1, Sébastien Maronne and David Rabouin present the history of the philosophy of mathematics from antiquity to the modern era. The goal is to show that the philosophy of mathematics has a history as ancient as mathematics and philosophy itself, a history largely continuous with the latter, often by staying out of sync with respect to the former. In Chapter 2, Sébastien Gandon discusses the question of the foundations of mathematics from Kant to the end of the nineteenth century. By tying this question to Kant, he is able to show that the discussion of the foundations of mathematics that occupied a large part of these two centuries has much older roots. Accent is placed on the differences between the framework proposed by Kant for making sense of classical mathematics and the use made by Frege and then Russell of logical tools for giving a different reading of arithmetic and real analysis. The link between between these different conceptions and the evolution of mathematics itself is also underlined. -/- Chapter 3, written by Hourya Benis-Sinaceur and Mirna Džamonja, deals with the evolution of mathematics in the twentieth century, notably the structuralist turn of Dedekind, E. Noether, and Bourbaki, and certain more recent developments. They devote themselves, among other things, to explaining how these developments can be understood as responses to and extensions of questions posed during the foundational debate of the immediately preceding era. -/- In Chapter 4, Jean-Pierre Marquis and Jean-Jacques Szczeciniarz discuss the different foundational options coming from set theory and category theory. They discuss, among other things, Lawvere's program to replace ZF with an axiomatization of the category of sets, the latter judged better adapted to the needs of contemporary mathematics. Different reactions, as much philosophical as technical, raised by this program are also taken into account. -/- Constructive mathematics are the object of Chapter 5, in which Gerhard Heinzmann and Mark van Atten examine in a critical and comparative manner a variety of constructivisms, including intuitionism, constructive type theory, predicativism, and finitism. -/- In Chapter 6, Guido Gherardi and Maël Pegny present computability theory, stressing its philosophical consequences. They discuss the basic concepts of this theory, for the computability of both the natural numbers and the real numbers. They then tackle the theory of computational complexity. -/- In Chapter 7, Andrea Sereni and Fabrice Pataut present Benacerraf's problem, opposing every possible account of mathematical knowledge to the availability of a theory of truth founded on an abstract ontology of mathematical objects. They give an overview of the original problem and its reformulation by Hartry Field, and reconstruct the debate that this problem has raised, by meeting at once the major opposing positions today of the analytic affiliation of the philosophy of mathematics, as much those on the platonist side as on that of nominalism. -/- In Chapter 8, Valeria Giardino and Yacin Hamami treat certain crucial aspects of the philosophy of mathematical practice. They deal in particular with the notion of an informal proof and on the role of artifacts in mathematical reasoning. They consider how such proofs, making use of these means, can contribute to the understanding of theorems and mathematical theories, thanks also to the role of visualisation and the aid of computer tools. -/- Why do mathematics often give several proofs of the same theorem? This is the question that Andrew Arana raises in Chapter 9, introducing the notion of an epistemic ideal and discuss two such ideals, the explanatoriness and purity of proof. -/- Chapter 10 is devoted to the applicability of mathematics in the study of empirical phenomena. After summarizing the history of this question, going back to Plato and Aristotle and passing by Mill and Kant, Daniele Molinini and Marco Panza reconstruct the contemporary debate, in relation, among other things, to questions raised in the philosophy of science. -/- Two appendices complete the volume. In the first Frédéric Patras treats the French tradition in philosophy of mathematics of the 20th century. In the second, Maria Carla Galavotti discusses the notion of probability and its use in science. (shrink)

The proportional weight view in epistemology of disagreement generalizes the equal weight view and proposes that we assign to judgments of different people weights that are proportional to their epistemic qualifications. It is shown that if the resulting degrees of confidence are to constitute a probability function, they must be the weighted arithmetic means of individual degrees of confidence, while if the resulting degrees of confidence are to obey the Bayesian rule of conditionalization, they must be the weighted (...) geometric means of individual degrees of confidence. The double bind entails that the proportional weight view (and its moderate adjustment in favor of one’s own judgment) is inconsistent with Bayesianism. (shrink)

Metaepistemology may be partly characterized as the study of the nature, aims, methods and legitimacy of epistemology. Given such a characterization, most epistemological views and theories have an important metaepistemological aspect or, at least, a number of more or less explicit metaepistemological commitments. Metaepistemology is an important area of philosophy because it exemplifies that philosophy must serve as its own meta-discipline by continuously reflecting critically on its own methods and aims. Even though philosophical methodology may be regarded as a branch (...) of epistemology, epistemology itself is as much in need of metaphilosophical examination as other core disciplines of philosophy. Moreover, metaepistemology is important because it bears significantly on first-order epistemological questions. Indeed, many of the most prominent contemporary debates in philosophy have a distinctly metaepistemological aspect. For example, the debates between rationalists and empiricists do not only concern the nature of cognition of specific areas – perception, arithmetic, logic and so forth – but also general metaepistemological questions about whether it is realistic and desirable that epistemology be naturalized. Likewise, the debates between epistemic internalists and externalists include metaepistemological debates about whether the proper focus for epistemology should be the cognizer’s rational perspective or some more objective property of the cognizer’s epistemic position. Similarly, the debates concerning the relationship between folk epistemology and epistemological theorizing include metaepistemological debates about how empirical data concerning folk epistemology should impact epistemology itself. Each of these debates provides an example of how first-order epistemological issues are deeply connected, and sometimes inseparable from, metaepistemological considerations. (shrink)

There is a long-standing gap in the literature as to whether Gödelian incompleteness constitutes a challenge for Neo-Logicism, and if so how serious it is. In this paper, I articulate and address the challenge in detail. The Neo-Logicist project is to demonstrate the analyticity of arithmetic by deriving all its truths from logical principles and suitable definitions. The specific concern raised by Gödel’s first incompleteness theorem is that no single sound system of logic syntactically implies all arithmetical truths. I (...) set out some responses that initially seem appealing and explain why they are not compelling. The upshot is that Neo-Logicism either offers an epistemic route only to some truths of arithmetic; or that it has to move from a syntactic to a semantic notion of logical consequence, which risks undermining its epistemic goals. I conclude by considering Crispin Wright’s recent attempt to address Gödelian incompleteness, which I argue is not satisfactory. (shrink)

This article examines Hilary Putnam's work in the philosophy of mathematics and - more specifically - his arguments against mathematical realism or objectivism. These include a wide range of considerations, from Gödel's incompleteness-theorem and the limits of axiomatic set-theory as formalised in the Löwenheim-Skolem proof to Wittgenstein's sceptical thoughts about rule-following, Michael Dummett's anti-realist philosophy of mathematics, and certain problems – as Putnam sees them – with the conceptual foundations of Peano arithmetic. He also adopts a thought-experimental approach – (...) a variant of Descartes' dream scenario – in order to establish the in-principle possibility that we might be deceived by the apparent self-evidence of basic arithmetical truths or that it might be ‘rational’ to doubt them under some conceivable set of circumstances. Thus Putnam assumes that mathematical realism involves a self-contradictory ‘Platonist’ idea of our somehow having quasi-perceptual epistemic ‘contact’ with truths that in their very nature transcend the utmost reach of human cognitive grasp. On this account, quite simply, ‘nothing works’ in philosophy of mathematics since wecan either cling to that unworkable notion of objective truth or abandon mathematical realism in favour of a verificationist approach that restricts the range of admissible statements to those for which we happen to possess some means of proof or ascertainment. My essay puts the case, conversely, that these hyperbolic doubts are not forced upon us but result from a false understanding of mathematical realism – a curious mixture of idealist and empiricist themes – which effectively skews the debate toward a preordained sceptical conclusion. I then go on to mount a defence of mathematical realism with reference to recent work in this field and also to indicate some problems – as I seethem – with Putnam's thought-experimental approach as well ashis use of anti-realist arguments from Dummett, Kripke, Wittgenstein, and others. (shrink)