Philosophy Compass, Volume 17, Issue 2, February 2022.

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)

After introducing semantic anti-realism and the paradox of knowability, the paper offers a reconstruction of the anti-realist argument from understanding. The proposed reconstruction validates an unrestricted principle to the effect that truth requires the existence of a certain kind of “demonstration”. The paper shows that that principle fails to imply the problematic instances of the original unrestricted feasible-knowability principle but that the overall view underlying the new principle still has unrestricted epistemic consequences. Appealing precisely to the paradox of knowability, the (...) paper also argues, against the BHK semantics, for the non- constructive character of the demonstrations envisaged by semantic anti-realism, and contends that, in such setting, one of the most natural arguments for a broadly intuitionist revision of classical logic loses all its force.Tras presentar el anti-realismo semántico y la paradoja de la cognoscibilidad, el artículo ofrece una reconstrucción del argumento anti-realista basado en la comprensión. La reconstrucción que se propone valida un principio irrestricto, del que se sigue que la verdad requiere la existencia de un determinado tipo de “demostración”. El artículo muestra que este principio no implica las instancias problemáticas del original principio irrestricto de la cognoscibilidad realizable, y que la concepción general que subyace al nuevo principio todavía tiene consecuencias epistémicas irrestrictas. Apelando precisamente a la paradoja de la cognoscibilidad, el artículo argumenta además, en contra de la semántica BHK, a favor del carácter no constructivo de las demostraciones que contempla el anti-realismo semántico, y defiende que, en ese marco, uno de los argumentos más naturales a favor de una revisión a grandes rasgos intuicionista de la lógica clásica pierde toda su fuerza. (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)

In the present paper I wish to regard constructivelogic as a self-contained system for the treatment ofepistemological issues; the explanations of theconstructivist logical notions are cast in anepistemological mold already from the outset. Thediscussion offered here intends to make explicit thisimplicit epistemic character of constructivism.Particular attention will be given to the intendedinterpretation laid down by Heyting. This interpretation, especially as refined in the type-theoretical work of Per Martin-Löf, puts thesystem on par with the early efforts of Frege andWhitehead-Russell. This quite (...) recent work, however,has proved valuable not only in the philosophy andfoundations of mathematics, but has also foundpractical application in computer science, where thelanguage of constructivism serves as an implementableprogramming language, and within the philosophy oflanguage.\footnote{Nordstr\"{o}m et al. give an overview of the work in computerscience, whereas Ranta provides an impressiveconstructivist alternative to Montague Grammar usingthe richer type structure of Martin-L\"{o}f in placeof the simple classical type theory of Church.} Mypresentation will be carried out through a contrastwith standard metamathematical work.\footnote{Troelstra and van Dalen give an encyclopedictreatment of the metamathematics of constructivism.}In the course of the development I have occasion tooffer some novel considerations on thenature of proof and inference. (shrink)

The standard approach to what I call “proof-theoretic semantics”, which is mainly due to Dummett and Prawitz, attempts to give a semantics of proofs by defining what counts as a valid proof. After a discussion of the general aims of proof-theoretic semantics, this paper investigates in detail various notions of proof-theoretic validity and offers certain improvements of the definitions given by Prawitz. Particular emphasis is placed on the relationship between semantic validity concepts and validity concepts used in normalization theory. It (...) is argued that these two sorts of concepts must be kept strictly apart. (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)

Taking Per Martin-Löf’s constructive type theory as a starting-point a theory of assertion is developed, which is able to account for the epistemic aspects of the speech act of assertion, and in which it is shown that assertion is not a wide genus. From a constructivist point of view, one is entitled to assert, for example, that a proposition A is true, only if one has constructed a proof object a for A in an act of demonstration. One thereby has (...) grounded the assertion by an act of demonstration, and a grounding account of assertion therefore suits constructive type theory. Because the act of demonstration in which such a proof object is constructed results in knowledge that A is true, the constructivist account of assertion has to ward off some of the criticism directed against knowledge accounts of assertion. It is especially the internal relation between a judgement being grounded and its being known that makes it possible to do so. The grounding account of assertion can be considered as a justification account of assertion, but it also differs from justification accounts recently proposed, namely in the treatment of selfless assertions, that is, assertions which are grounded, but are not accompanied by belief. (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.

According to a main idea of Gentzen the meanings of the logical constants are reflected by the introduction rules in his system of natural deduction. This idea is here understood as saying roughly that a closed argument ending with an introduction is valid provided that its immediate subarguments are valid and that other closed arguments are justified to the extent that they can be brought to introduction form. One main part of the paper is devoted to the exact development of (...) this notion. Another main part of the paper is concerned with a modification of this notion as it occurs in Michael Dummett’s book The Logical Basis of Metaphysics. The two notions are compared and there is a discussion of how they fare as a foundation for a theory of meaning. It is noted that Dummett’s notion has a simpler structure, but it is argued that it is less appropriate for the foundation of a theory of meaning, because the possession of a valid argument for a sentence in Dummett’s sense is not enough to be warranted to assert the sentence. (shrink)

In his 1951 Gibbs Memorial Lecture, Kurt Gödel put forth his famous disjunction that either the power of the mind outstrips that of any machine or there are absolutely unsolvable problems. The view that there are no absolutely unsolvable problems is optimism, the view that there are such problems is pessimism. In his 1995—and, revised in 2013—Verificationism Then and Now, Per Martin-Löf presents an illustrative argument for a constructivist form of optimism. In response to that argument, Solomon Feferman points out (...) that Martin-Löf’s reasoning relies upon constructive understandings of key philosophical notions. In the vein of Feferman’s analysis, one might be object to Martin-Löf’s argument for either its reliance upon constructivist considerations, or for its appeal to non-unproblematically mathematical premises. We argue that both of these responses fall short. On one hand, to be critical of Martin-Löf’s reasoning for its constructiveness is to reject what would otherwise be a scientific advance on the basis of the assumption of constructivism’s falsehood or implausibility, which is of course uncharitable at best. On the other hand, to object to the argument for its use of non-unproblematically mathematical premises is to assume that there is some philosophically neutral mathematics, which is implausible. Martin-Löf’s argument relies upon his third law, the claim that from the impossibility of a proof of a proposition we can construct a proof of its negation. We close with a discussion of some ways in which this claim can be criticized from the constructive point of view. Specifically, we contend that Martin-Löf’s third law is incompatible with what has been called “Poincaré’s Principle of Epistemic Conservation”, the thesis that genuine increase in mathematical knowledge requires subject-specific insight. (shrink)

A combination of epistemic logic and dynamic logic of programs is presented. Although rich enough to formalize some simple game-theoretic scenarios, its axiomatization is problematic as it leads to the paradoxical conclusion that agents are omniscient. A cut-free labelled Gentzen-style proof system is then introduced where knowledge and action, as well as their combinations, are formulated as rules of inference, rather than axioms. This provides a logical framework for reasoning about games in a modular and systematic way, and to give (...) a step-by-step reconstruction of agents omniscience. In particular, its semantic assumptions are made explicit and a possible solution can be found in weakening the properties of the knowledge operator. (shrink)

According to Plato’s Apology of Socrates, a humanly wise person is distinguished by her ability to correctly assess the epistemic status and value of her beliefs. She knows when she has knowledge or has mere belief or is ignorant. She makes no unjustified knowledge claims and considers her knowledge to be limited in scope and value. This means: A humanly wise person is intellectually modest. However, when interpreted classically, Socratic wisdom cannot be modest. For in classical epistemic logic, modelling second-order (...) knowledge of knowing something or not, i.e. positive and negative introspection, requires a degree of self-transparency that would at most be attributed to an omniscient and infallible agent. If intellectual modesty is part of Socratic wisdom, we have to look for another epistemic model. I will offer three proposals and argue that an intuitionist reading of the classical concept of knowledge is best suited for this purpose. (shrink)

Homotopy Type Theory is a putative new foundation for mathematics grounded in constructive intensional type theory that offers an alternative to the foundations provided by ZFC set theory and category theory. This article explains and motivates an account of how to define, justify, and think about HoTT in a way that is self-contained, and argues that, so construed, it is a candidate for being an autonomous foundation for mathematics. We first consider various questions that a foundation for mathematics might be (...) expected to answer, and find that many of them are not answered by the standard formulation of HoTT as presented in the ‘HoTT Book’. More importantly, the presentation of HoTT given in the HoTT Book is not autonomous since it explicitly depends upon other fields of mathematics, in particular homotopy theory. We give an alternative presentation of HoTT that does not depend upon ideas from other parts of mathematics, and in particular makes no reference to homotopy theory, and argue that it is a candidate autonomous foundation for mathematics. Our elaboration of HoTT is based on a new interpretation of types as mathematical concepts, which accords with the intensional nature of the type theory. 1 Introduction2 What Is a Foundation for Mathematics?2.1 A characterization of a foundation for mathematics2.2 Autonomy3 The Basic Features of Homotopy Type Theory3.1 The rules3.2 The basic ways to construct types3.3 Types as propositions and propositions as types3.4 Identity3.5 The homotopy interpretation4 Autonomy of the Standard Presentation?5 The Interpretation of Tokens and Types5.1 Tokens as mathematical objects?5.2 Tokens and types as concepts6 Justifying the Elimination Rule for Identity7 The Foundations of Homotopy Type Theory without Homotopy7.1 Framework7.2 Semantics7.3 Metaphysics7.4 Epistemology7.5 Methodology8 Possible Objections to this Account8.1 A constructive foundation for mathematics?8.2 What are concepts?8.3 Isn’t this just Brouwerian intuitionism?8.4 Duplicated objects8.5 Intensionality and substitution salva veritate9 Conclusion9.1 Advantages of this foundation. (shrink)

The logic of identity contains riches not seen through the coarse lens of predicate logic. This is one of several lessons to draw from the subtle treatment of identity in Martin‐Löf type theory, to which the reader will be introduced in this article. After a brief general introduction we shall mainly be concerned with the distinction between identity propositions and identity judgements. These differ from each other both in logical form and in logical strength. Along the way, connections to philosophical (...) debates concerning identity are noted. Some use of logical symbolism is inevitable in any serious discussion of type theory, but the emphasis here is on basic ideas rather than technicalities. (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 argue that the implementation of theDummettian program of an ``anti-realist'' semanticsrequires quite different conceptions of the technicalmeaning-theoretic terms used than those presupposed byDummett. Starting from obvious incoherences in anattempt to conceive truth conditions as assertibilityconditions, I argue that for anti-realist purposesnon-epistemic semantic notions are more usefully kept apart from epistemic ones rather than beingreduced to them. Embedding an anti-realist theory ofmeaning in Martin-Löf's Intuitionistic Type Theory(ITT) takes care, however, of many notorious problemsthat have arisen in trying to specify suitableintuitionistic (...) notions of semantic value,truth-conditions, and validity, taking into accountthe so-called ``defeasibility of evidence'' forassertions in empirical discourses. (shrink)

As a celebration of theTractatus100th anniversary it might be worth revisiting its relation to the later writings. From the former to the latter, David Pears recalls that “everyone is aware of the holistic character of Wittgenstein’s later philosophy, but it is not so well known that it was already beginning to establish itself in theTractatus” (The False Prison, 1987). From the latter to the former, Stephen Hilmy’s (The Later Wittgenstein, 1987) extensive study of theNachlasshas helped removing classical misconceptions such as (...) Hintikka’s claim that “Wittgenstein in thePhilosophical Investigationsalmost completely gave up the calculus analogy.” Hilmy points out that even in theInvestigationsone finds the use of the calculus/game paradigm to the understanding of language, such as “in operating with the word” (Part I, §559) and “it plays a different part in the calculus”. Hilmy also quotes from a late (1946) unpublished manuscript (MS 130) “this sentence has use in the calculus of language”, which seems to be compatible with “asking whether and how a proposition can be verified is only a particular way of asking ‘How do you mean?’” Central in this back and forth there is an aspect which seems to deserve attention in the discussion of a semantics for the language of mathematics which might be based on (normalisation of) proofs and/or Hintikka/Lorenzen game-dialogue: the explication of consequences. Such a discussion is substantially supported by the use of the open and searchableThe Wittgenstein Archives at the University of Bergen. These findings are framed within the discussion of the meaning of logical constants in the context of natural deduction style rules of inference. (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)

Can an epistemic conception of truth and an endorsement of the excluded middle (together with other principles of classical logic abandoned by the intuitionists) cohabit in a plausible philosophical view? In PART I I describe the general problem concerning the relation between the epistemic conception of truth and the principle of excluded middle. In PART II I give a historical overview of different attitudes regarding the problem. In PART III I sketch a possible holistic solution.

Dem "Manifestationsargument" zufolge steht eine realistische Semantik der Wahrheitsbedingungen im Widerspruch zu dem Gedanken, dass das Verstehen von Sätzen eine Fähigkeit ist, die sich im Handeln manifestieren können muss. – Der Aufsatz zeigt, dass sowohl Realisten als auch Anti-Realisten die These aufzugeben haben, dass das Verstehen eines Satzes im Erfassen der jeweiligen Wahrheitsbedingungenbesteht. Die realistische Annahme der Existenz verifikationstranszendenter Wahrheiten steht – unabhängig vom Manifestationsprinzip – im Widerspruch zu einer wahrheitskonditionalen Semantik. Die von heutigen Anti-Realisten vertretenen Theorien des Verstehens sind (...) allerdings einem ähnlichen Einwand ausgesetzt, insofern sie gleichfalls nicht unsere Fähigkeit, unentscheidbare Sätze zu verstehen, erklären können. (shrink)

One of the important discussions in the philosophy of mathematics, is that centered on Benacerraf’s Dilemma. Benacerraf’s dilemma challenges theorists to provide an epistemology and semantics for mathematics, based on their favourite ontology. This challenge is the point on which all philosophies of mathematics are judged, and clarifying how we might acquire mathematical knowledge is one of the main occupations of philosophers of mathematics. In this thesis I argue that this discussion has overlooked an important part of mathematics, namely mathematics (...) as it is exercised by ordinary people. I do so by looking at the different theories that have been put forward in the recent debate, and showing for each of these that they are unable to account for the mathematical practices of ordinary people. In order to show that these practices do need to be accounted for, I also argue that ordinary people are doing mathematics, i.e. that they engage in properly mathematical practices. Because these practices are properly mathematical, they should be accounted for by any philosophy of mathematics. The conclusion of my thesis, then, is that current theories fail to do something that they should do, while remaining neutral on how well they perform when it comes to accounting for the practices of professional mathematicians. (shrink)