My first aim in this paper is to use time diagrams in the style of Brentano to analyze constructions in Brouwer's separable mathematics more precisely. I argue that constructions must involve not only pairing and projecting as basic operations guaranteed by the intuition of twoity, as sometimes assumed in the literature, but also a recalling operation. My second aim is to argue that Brouwer's views on the intuition of twoity and arithmetic lead to an ontological explosion. Redeveloping the constructions of (...) natural numbers and systems sketched in an appendix to Brouwer's Cambridge lectures, I observe that the only plausible way he can make some elementary arithmetic in his separable mathematics is by allowing for the same canonical number to be determined by multiple separable entities, resulting in an overabundant mathematical ontology. (shrink)

I argue against the interpretation of propositions as intentions and proof-objects as fulfillments proposed by Heyting and defended by Tieszen and van Atten. The idea is already a frequent target of criticisms regarding the incompatibility of Brouwer’s and Husserl’s positions, mainly by Rosado Haddock and Hill. I raise a stronger objection in this paper. My claim is that even if we grant that the incompatibility can be properly dealt with, as van Atten believes it can, two fundamental issues indicate that (...) the interpretation is unsustainable regardless: (1) it is hard to determine, without appealing to propositional intentions on pain of circularity, what intention a proof-object should be understood as a fulfillment of; (2) due to a difficult fulfillment dilemma, it is unclear, at best, what the object of an intention corresponding to a proposition is. (shrink)

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term (...) itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

Intuitionism’s disagreement with classical logic is standardly based on its specific understanding of truth. But different intuitionists have actually explicated the notion of truth in fundamentally different ways. These are considered systematically and separately, and evaluated critically. It is argued that each account faces difficult problems. They all either have implausible consequences or are viciously circular.

The aims of this paper are twofold: firstly, to say something about that philosophy of mathematics known as 'intuitionism' and, secondly, to fit these remarks into a more general message for the philosophy of mathematics as a whole. What I have to say on the first score can, without too much inaccuracy, be compressed into two theses. The first is that the intuitionistic critique of classical mathematics can be seen as based primarily on epistemological rather than on meaning-theoretic considerations. The (...) second is that the intuitionist's chief objection to the classical mathematician's use of logic does not center on the use of particular logical principles (in particular, the law of excluded middle and its ilk). Rather on the role the classical mathematician assigns (or at least extends) generally (i.e. regardless of the particular principles used) to the use of logic in the production mathematical proofs. Thus, the intuitionist critique of logic that we shall be presenting is far more radical than that which has commonly been presented. -/- Concerning the second, more general, theme, my claim is this: some restriction of the role of logical inference in mathematical proof such as that mentioned above is necessary if one is to account for the seeming difference in the epistemic conditions of provers whose reasoning is based on genuine insight into the subject-matter being investigated, and would-be provers whose reasoning is based not on such insight, but rather on principles of inference which hold of every subject-matter indifferently. (shrink)

We may try to explain proofs as chains of valid inference, but the concept of validity needed in such an explanation cannot be the traditional one. For an inference to be legitimate in a proof it must have sufficient epistemic power, so that the proof really justifies its final conclusion. However, the epistemic concepts used to account for this power are in their turn usually explained in terms of the concept of proof. To get out of this circle we may (...) consider an idea within intuitionism about what it is to justify the assertion of a proposition. It depends on Heyting’s view of the meaning of a proposition, but does not presuppose the concept of inference or of proof as chains of inferences. I discuss this idea and what is required in order to use it for an adequate notion of valid inference. (shrink)

We present a new English translation of L.E.J. Brouwer's paper ‘De onbetrouwbaarheid der logische principes’ of 1908, together with a philosophical and historical introduction. In this paper Brouwer for the first time objected to the idea that the Principle of the Excluded Middle is valid. We discuss the circumstances under which the manuscript was submitted and accepted, Brouwer's ideas on the principle of the excluded middle, its consistency and partial validity, and his argument against the possibility of absolutely undecidable propositions. (...) We note that principled objections to the general excluded middle similar to Brouwer's had been advanced in print by Jules Molk two years before. Finally, we discuss the influence on George Griss' negationless mathematics. (shrink)

The Knowability Paradox purports to show that the controversial but not patently absurd hypothesis that all truths are knowable entails the implausible conclusion that all truths are known. The notoriety of this argument owes to the negative light it appears to cast on the view that there can be no verification-transcendent truths. We argue that it is overly simplistic to formalize the views of contemporary verificationists like Dummett, Prawitz or Martin-Löf using the sort of propositional modal operators which are employed (...) in the original derivation of the Paradox. Instead we propose that the central tenet of verificationism is most accurately formulated as follows: if φ is true, then there exists a proof of φ Building on the work of Artemov (Bull Symb Log 7(1): 1-36, 2001), a system of explicit modal logic with proof quantifiers is introduced to reason about such statements. When the original reasoning of the Paradox is developed in this setting, we reach not a contradiction, but rather the conclusion that there must exist non-constructed proofs. This outcome is evaluated relative to the controversy between Dummett and Prawitz about proof existence and bivalence. (shrink)

Prawitz has recently developed a theory of epistemic grounding that differs in many respects from his earlier semantics of arguments and proofs. An innovative approach to inferences yields a new conception of the intertwinement of the notions of valid inference and proof. We aim at singling out three reasons that may have led Prawitz to the ground-theoretic turn, i.e.: a better order in the explanation of the relation between valid inferences and proofs; a notion of valid inference based on which (...) valid inferences and proofs are recognisable as such; a reconstruction of the deductive activity that makes inferences capable of yielding justification per se. These topics are discussed by Prawitz with reference to a very general and ancient question: why and how correct deduction has the epistemic power to compel us to accept its conclusions, provided its premises are justified? We conclude by remarking that, in spite of some improvements, the ground-theoretic approach shares with the previous one a problem of vacuous validity which, as Prawitz himself points out, blocks in both cases a satisfactory explanation of epistemic compulsion. (shrink)

The topic of this paper is the question whether there is a logic which could be justly called the logic of inference. It may seem that at least since Prawitz, Dummett and others demonstrated the proof-theoretical prominency of intuitionistic logic, the forthcoming answer is that it is this logic that is the obvious choice for the accolade. Though there is little doubt that this choice is correct (provided that inference is construed as inherently single-conclusion and complying with the Gentzenian structural (...) rules), I do not think that the usual justification of it is satisfactory. Therefore, I will first try to clarify what exactly is meant by the question, and then sketch a conceptual framework in which it can be reasonably handled. I will introduce the concept of 'inferentially native' logical operators (those which explicate inferential properties) and I will show that the axiomatization of these operators leads to the axiomatic system of intuitionistic logic. Finally, I will discuss what modifications of this answer enter the picture when more general notions of inference are considered. (shrink)

The notion of cognitive act is of importance for an epistemology that is apt for constructive type theory, and for epistemology in general. Instead of taking knowledge attributions as the primary use of the verb 'to know' that needs to be given an account of, and understanding a first-person knowledge claim as a special case of knowledge attribution, the account of knowledge that is given here understands first-person knowledge claims as the primary use of the verb 'to know'. This means (...) that a cognitive act is an act that counts as cognitive from a first-person point of view. The method of linguistic phenomenology is used to explain or elucidate our epistemic notions. One of the advantages of the theory is that an answer can be given to some of the problems in modern epistemology, such as the Gettier problem. (shrink)

The concept of “necessity of thought” plays a central role in Dag Prawitz’s essay “Logical Consequence from a Constructivist Point of View” (Prawitz 2005). The theme is later developed in various articles devoted to the notion of valid inference (Prawitz, 2009, forthcoming a, forthcoming b). In section 1 I explain how the notion of necessity of thought emerges from Prawitz’s analysis of logical consequence. I try to expound Prawitz’s views concerning the necessity of thought in sections 2, 3 and 4. (...) In sections 5 and 6 I discuss some problems arising with regard to Prawitz’s views. (shrink)

The goal of this paper is to explore the significance of Montague’s paradox—that is, any arithmetical theory $T\supseteq Q$ over a language containing a predicate $P$ satisfying $P\rightarrow \varphi $ and $T\vdash \varphi \,\therefore\,T\vdash P$ is inconsistent—as a limitative result pertaining to the notions of formal, informal, and constructive provability, in their respective historical contexts. To this end, the paradox is reconstructed in a quantified extension $\mathcal {QLP}$ of Artemov’s logic of proofs. $\mathcal {QLP}$ contains both explicit modalities $t:\varphi $ (...) and also proof quantifiers $x:\varphi $. In this system, the basis for the rule NEC is decomposed into a number of distinct principles governing how various modes of reasoning about proofs and provability can be internalized within the system itself. A conceptually motivated resolution to the paradox is proposed in the form of an argument for rejecting the unrestricted rule NEC on the basis of its subsumption of an intuitively invalid principle pertaining to the interaction of proof quantifiers and the proof-theorem relation expressed by explicit modalities. (shrink)

The paper is a defense of a strict form of anti-realism, competing the "in principle" form defended by Michael Dummett. It proposes to ground anti-realism on the basis of two principles ("immanence" and "implicitness") and to develop the consequences of these principles in the light of sub-structural logics.

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...) introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of p roofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence. (shrink)

In this paper we examine two approaches to the formal treatment of the notion of problem in the paradigm of algorithmic semantics. Namely, we will explore an approach based on Martin-Löf’s Constructive Type Theory, which can be seen as a direct continuation of Kolmogorov’s original calculus of problems, and an approach utilizing Tichý’s Transparent Intensional Logic, which can be viewed as a non-constructive attempt of interpreting Kolmogorov’s logic of problems. In the last section we propose Kolmogorov and CTT-inspired modifications to (...) TIL-based approach. The focus will be on non-empirical problems only. (shrink)

Brouwer's demonstration of his Bar Theorem gives rise to provocative questions regarding the proper explanation of the logical connectives within intuitionistic and constructivist frameworks, respectively, and, more generally, regarding the role of logic within intuitionism. It is the purpose of the present note to discuss a number of these issues, both from an historical, as well as a systematic point of view.

This paper contains five observations concerning the intended meaning of the intuitionistic logical constants: (1) if the explanations of this meaning are to be based on a non-decidable concept, that concept should not be that of `proof"; (2) Kreisel"s explanations using extra clauses can be significantly simplified; (3) the impredicativity of the definition of → can be easily and safely ameliorated; (4) the definition of → in terms of `proofs from premises" results in a loss of the inductive character of (...) the definitions of ∨ and ∃ and (5) the same occurs with the definition of ∀ in terms of `proofs with free variables". (shrink)

The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results concerning intuitionistic propositional logic that bear on that perspective, and discuss their significance. First, for a range of connectives including both negation and the falsum, there are no classically or intuitionistically correct introduction rules. Second, irrespective of the choice of negation or the falsum as a primitive connective, classical and intuitionistic consequence satisfy exactly the (...) same structural, introduction, and elimination (briefly, elementary) rules. Third, for falsum as primitive only, intuitionistic consequence is the least consequence relation that satisfies all classically correct elementary rules. (shrink)

This volume explores the relation between legal reasoning and logic from both a historical and a systematic perspective. The topics addressed include, among others, conditional legal acts, disjunctions in legal acts, presumptions and conjectures, conflicts of values, Jørgensen´s Dilemma, the Rhetor´s Dilemma, the theory of legal fictions and the categorization of contracts. The unifying problematic of these contributions concerns the conditional structures and, more particularly, the relationship between legal theory and legal reasoning in the context of conditions.

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...) introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of proofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence. (shrink)

This paper can be read as an attempt at providing philosophical foundations to linear logic. The only plausible form of philosophical antirealism deals with practical feasibility rather than with effectivity in principle. The very notion of recognizability is ambiguous, audit has to be considered from a stricter perspective than currently done. The intuitionistic assertability conditions are to be reinforced. This change requires a move towards a frame in which the circumstances of the application of a logical rule can be specified. (...) Gentzen's sequential calculi provide such a frame, when some structural rules have been removed or limited. (shrink)

Even though Husserl and Brouwer have never discussed each other's work, ideas from Husserl have been used to justify Brouwer's intuitionistic logic. I claim that a Husserlian reading of Brouwer can also serve to justify the existence of choice sequences as objects of pure mathematics. An outline of such a reading is given, and some objections are discussed.

Dans ce texte, je pars de l’analyse intuitionniste de la vérité mathématique, « A est vrai si et seulement s’il existe une preuve de A » comme cas particulier de l’analyse de la vérité en termes de « vérifacteur », et je montre pourquoi Wittgenstein partageait celle-ci avec les intuitionnistes. Cependant, la notion de preuve à l’oeuvre dans cette analyse est, selon l’intuitionnisme, celle de la « preuve-comme-objet », et je montre par la suite, en interprétant son argument sur le (...) caractère « synoptique » des preuves, que Wittgenstein avait plutôt en tête une conception de la « preuve-comme-trace ».In this paper, I start with the intutionist analysis of mathematical truth, « A is true if and only if there exists a proof of A », as a particular case of the analysis of truth in terms of « truth-makers », and I show why Wittgenstein shared it with the intuitionists. However, the notion of proof at work in this analysis is, according to intuitionism, that of « proof-as-object », and I then show, with an interpretation of his argument on the « surveyability » of proofs, that, instead, Wittgenstein had in mind a notion of « proof-as-trace ». (shrink)

By maintaining that a conditional sentence can be taken to express the validity of a rule of inference, we offer a solution to the Miners Paradox that leaves both modus ponens and disjunction elimination intact. The solution draws on Sundholm's recently proposed account of Fitch's Paradox.

I give an account of proof terms for derivations in a sequent calculus for classical propositional logic. The term for a derivation δ of a sequent Σ≻Δ encodes how the premises Σ and conclusions Δ are related in δ. This encoding is many–to–one in the sense that different derivations can have the same proof term, since different derivations may be different ways of representing the same underlying connection between premises and conclusions. However, not all proof terms for a sequent Σ≻Δ (...) are the same. There may be different ways to connect those premises and conclusions. -/- Proof terms can be simplified in a process corresponding to the elimination of cut inferences in sequent derivations. However, unlike cut elimination in the sequent calculus, each proof term has a unique normal form (from which all cuts have been eliminated) and it is straightforward to show that term reduction is strongly normalising—every reduction process terminates in that unique normal form. Further- more, proof terms are invariants for sequent derivations in a strong sense—two derivations δ1 and δ2 have the same proof term if and only if some permutation of derivation steps sends δ1 to δ2 (given a relatively natural class of permutations of derivations in the sequent calculus). Since not every derivation of a sequent can be permuted into every other derivation of that sequent, proof terms provide a non-trivial account of the identity of proofs, independent of the syntactic representation of those proofs. (shrink)

Our starting point is Michael Luntley's falsificationist semantics for the logical connectives and quantifiers: the details of his account are criticised but we provide an alternative falsificationist semantics that yields intuitionist logic, as Luntley surmises such a semantics ought. Next an account of the logical connectives and quantifiers that combines verificationist and falsificationist perspectives is proposed and evaluated. While the logic is again intuitionist there is, somewhat surprisingly, an unavoidable asymmetry between the verification and falsification conditions for negation, the conditional, (...) and the universal quantifier. Lastly we are lead to a novel characterization of realism. (shrink)

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...) developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. (shrink)

On analyse l’interprétation BHK de constantes logiques sur la base d’une prise en compte systématique de Prawitz, résultant en une reformulation de l’interprétation BHK dans laquelle l’assertabilité de propositions atomiques est déterminée par des systèmes de Post. On démontre que l’interprétation BHK reformulée rend davantage de propositions assertables que la logique propositionnelle intuitionniste rend prouvable. La loi de Mints est examinée en tant qu’exemple d’une telle proposition. La logique propositionnelle intuitionniste devrait par conséquent être considérée comme étant incomplète. Nous concluons (...) par une discussion sur l’adéquation de l’interprétation BHK de l’implication. (shrink)

This book brings together philosophers, mathematicians and logicians to penetrate important problems in the philosophy and foundations of mathematics. In philosophy, one has been concerned with the opposition between constructivism and classical mathematics and the different ontological and epistemological views that are reflected in this opposition. The dominant foundational framework for current mathematics is classical logic and set theory with the axiom of choice. This framework is, however, laden with philosophical difficulties. One important alternative foundational programme that is actively pursued (...) today is predicativistic constructivism based on Martin-Löf type theory. Associated philosophical foundations are meaning theories in the tradition of Wittgenstein, Dummett, Prawitz and Martin-Löf. What is the relation between proof-theoretical semantics in the tradition of Gentzen, Prawitz, and Martin-Löf and Wittgensteinian or other accounts of meaning-as-use? What can proof-theoretical analyses tell us about the scope and limits of constructive and predicative mathematics? (shrink)

There are two different ways to introduce the notion of truthin constructive mathematics. The first one is to use a Tarskian definition of truth in aconstructive (meta)language. According to some authors, (Kreisel, van Dalen, Troelstra ... ),this definition is entirely similar to the Tarskian definition of classical truth (thesis A).The second one, due essentially to Heyting and Kolmogorov, and known as theBrouwer–Heyting–Kolmogorov interpretation, is to explain informally what it means fora mathematical proposition to be constructively proved. According to other authors (...) (Martin-Löfand Shapiro), this interpretation and the Tarskian definition of truth amount to thesame (thesis B). My aim in this paper is to show that thesis A is only reasonable, that thesis Bis false and to answer the following question: what is defined by the Tarskian definition ofconstructive truth? (shrink)

Ce numéro thématique de la revue Philosophiques est consacré aux Conférences Hugues Leblanc qui ont eu lieu du 1er au 3 avril 2010 au Département de philosophie de l'Université du Québec à Montréal. À cette occasion, le conférencier invité était Kevin Mulligan, titulaire de la chaire de philosophie analytique au Département de philosophie de l'Université de Genève, qui a prononcé trois conférences sous le titre " Wittgenstein vs ses prédécesseurs austro-allemands ", publiées dans ce numéro. Mulligan y développe un de (...) ses thèmes historiques de prédilection, à savoir la dette de Wittgenstein, dans ses travaux sur l'esprit et le langage, à l'endroit de ses prédécesseurs austro-allemands. Comme le veut la formule des conférences Hugues Leblanc, nous avons réuni quelques collègues afin de discuter de quelques-uns des aspects des travaux du conférencier invité et nous avons ajouté, pour compléter ce numéro de Philosophiques, quelques articles originaux portant également sur d'autres aspects des travaux de Mulligan. On peut regrouper l'ensemble de ces contributions sous quatre des grands thèmes exploités par Mulligan en philosophie : le domaine de l'ontologie (incluant les relations, les tropes, les états de choses et les vérifacteurs), le domaine de la philosophie de l'esprit, celui des émotions et des valeurs, et enfin le thème historique de la philosophie austro-allemande, de Bolzano à Wittgenstein en passant par M. Scheler et la phénoménologie de Munich. Faute de pouvoir rendre compte dans cette préface de l'ensemble de ces riches contributions à ce numéro de Philosophiques, je me contenterai de renvoyer le lecteur aux résumés, préparés par les auteurs de ces contributions, qui précèdent chacun des articles. (shrink)

Recent literature on dialogical logic discusses the case of tonk and the notion harmony in the context of a rule-based theory of meaning. Now, since the publications of those papers, a dialogical version of constructive type theory has been developed. The aim of the present paper is to show that, from the dialogical point of view, the harmony of the CTT-rules is the consequence of a more fundamental level of meaning characterized by the independence of players. We hope that the (...) following paper will contribute to a better understanding of the dialogical notion of meaning. (shrink)

Michael Dummett has interpreted and expounded upon intuitionism under the influence of Wittgensteinian views on language, meaning and cognition. I argue against the application of some of these views to intuitionism and point to shortcomings in Dummett's approach. The alternative I propose makes use of recent, post-Wittgensteinian views in the philosophy of mind, meaning and language. These views are associated with the claim that human cognition exhibits intentionality and with related ideas in philosophical psychology. Intuitionism holds that mathematical constructions are (...) mental processes or objects. Constructions are, in the first instance, forms of consciousness or possible experience of a particular type. As such, they must be understood in terms of the concept of intentionality. This view has a historical basis in the literature on intuitionism. In a famous 1931 lecture Heyting in fact identifies constructions with fulfilled or fulfillable mathematical intentions. I consider some of the consequences of this identification and contrast them with Dummett's views on intuitionism. (shrink)

Proof-theoretic semantics is an approach to logical semantics based on two ideas, of which the first is that the meaning of a logical connective can be explained by stipulating that some mode of inference, e.g., a natural deduction introduction or elimination rule, is permissible. The second idea is that the soundness of rules which are not stipulated outright may be deduced by some proof-theoretic argument from properties of the rules which are stipulated outright. I examine the first idea. My main (...) conclusion is that the idea is more problematic, and requires more discussion, than has been generally realized. I mention five problems which will have to be overcome before the idea can be accepted as definitely viable. (shrink)

Certain anti-realisms about mathematics are distinguished by their taking proof rather than truth as the central concept in the account of the meaning of mathematical statements. This notion of proof which is meaning determining or canonical must be distinguished from a notion of demonstration as more generally conceived. This paper raises a set of objections to Dummett's characterisation of the notion via the notion of a normalised natural deduction proof. The main complaint is that Dummett's use of normalised natural deduction (...) proofs relies on formalisation playing a role for which it is unfit. Instead I offer an alternative account which does not rely on formalisation and go on to examine the relation of proof to canonical proof, arguing that rather than requiring an explicit characterisation of canonical proofs we need to be more aware of the complexities of that relation. (shrink)

Martin-Löf's constructive theory introduces, beside proof processes—the brouwerian mental construction—proof objects that could become the subject matter of a new kind of proof theory. In contradistinction to the classical approach, the proposition can then be defined as the set of its proofs. The lower level type theory is therefore a set theory, where the operators Σ and Π generalize the Cartesian product and the functional space to families of sets. To obtain the familiar logical constants, we have only to choose (...) the logical reading of a : A. Σ and Π become ∃ and ∀, or, if there is no functional dependency, & and ⊃. (shrink)

There are several issues with the standard approach to the relationship between conditionals and assertions, particularly when the antecedent of a conditional is false. One prominent alternative is to say that conditionals do not express propositions, but rather make conditional assertions that may generate categorical assertions of the consequent in certain circumstances. However, this view has consequences that jar with standard interpretations of the relationship between proofs and assertion. Here, I analyse this relationship, and say that, on at least one (...) understanding of proof, conditional assertions may reflect the dynamics of proving, which generate categorical assertions. In particular, when we think about the relationship between assertion and proof as rooted in a dialogical approach to both, the distinction between conditional and categorical assertions is quite natural. (shrink)