The aim here is to investigate assertion and inference as notions of logic. Assertion will be explained in terms of its purpose, which is to give interlocutors the right to request the assertor to do a certain task. The assertion is correct if, and only if, the assertor knows how to do this task. Inference will be explained as an assertion equipped with what I shall call a justification profile, a strategy for making good on the assertion. The inference is (...) valid if, and only if, correctness is preserved from the premiss assertions to the conclusion assertion. Most of this is a spelling out of views on assertion and inference presented by Per Martin-Löf in lectures since 2015. (shrink)

This is a dialogue between Lisa and Max on Dag Prawitz's work concerning the concept of deductive validity. Lisa first explains Prawitz's criticisms of the presently prevailing non‐epistemic analyses of validity. Then Lisa describes three different ways in which Prawitz attempted to develop an epistemic concept of validity. Max asks questions for clarification, raises some objections and compares Prawitz's three approaches with other lines of thought. Two inference rules are specially discussed: disjunction introduction and ex contradictione quodlibet. Max and Lisa (...) view Prawitz's contribution as part of a variegated, ongoing research pursuing an explication of the concept of validity, which began with the Socratic and Platonic distinction between merely persuasive arguments and good arguments and with Aristotle's definition of syllogism. Throughout the history of philosophy, logicians have aimed at clarifying a pre‐theoretic idea of good deduction and have proposed, criticized, refined, adjusted precise theoretical concepts of validity. Prawitz has criticized current views about validity, has advanced new proposals and revised them. His work is an important chapter of the long pursuit of the concept of validity. (shrink)

Formal logic has often been seen as uniquely placed to analyze mathematical argumentation. While formal logic is certainly necessary for a complete understanding of mathematical practice, it is not sufficient. Important aspects of mathematical reasoning closely resemble patterns of reasoning in nonmathematical domains. Hence the tools developed to understand informal reasoning, collectively known as argumentation theory, are also applicable to much mathematical argumentation. This chapter investigates some of the details of that application. Consideration is given to the many contrasting meanings (...) of the word “argument”; to some of the specific argumentation-theoretic tools that have been applied to mathematics, notably Toulmin layouts and argumentation schemes; to some of the different ways that argumentation is implicated in mathematical practices; and to the social aspects of mathematical argumentation. (shrink)

A consequence relation is strongly classical if it has all the theorems and entailments of classical logic as well as the usual meta-rules (such as Conditional Proof). A consequence relation is weakly classical if it has all the theorems and entailments of classical logic but lacks the usual meta-rules. The most familiar example of a weakly classical consequence relation comes from a simple supervaluational approach to modelling vague language. This approach is formally equivalent to an account of logical consequence according (...) to which α1, ..., αn entails β just in case □α1, ..., □αn entails □β in the modal logic S5. This raises a natural question: If we start with a different underlying modal logic, can we generate a strongly classical logic? This paper explores this question. In particular, it discusses four related technical issues: (1) Which base modal logics generate strongly classical logics and which generate weakly classical logics? (2) Which base logics generate themselves? (3) How can we directly characterize the logic generated from a given base logic? (4) Given a logic that can be generated, which base logics generate it? The answers to these questions have philosophical interest. They can help us to determine whether there is a plausible supervaluational approach to modelling vague language that yields the usual meta-rules. They can also help us to determine the feasibility of other philosophical projects that rely on an analogous formalism, such as the project of defining logical consequence in terms of the preservation of an epistemic status. (shrink)

How should we understand validity? A standard way to characterize validity is in terms of the preservation of truth (or truth in a model). But there are several problems facing such characterizations. An alternative approach is to characterize validity epistemically, for instance in terms of the preservation of an epistemic status. In this paper, I raise a problem for such views. First, I argue that if the relevant epistemic status is factive, such as being in a position to know or (...) having conclusive evidence for, then the account runs into trouble if we endorse certain familiar logical principles. Second, I argue that if the relevant epistemic status is non-factive, such as is rationally committed to or has justification for believing, then a similar problem arises if we endorse the logical principles as well as a sufficiently strong epistemic “level-bridging” principle. Finally, I argue that an analogous problem arises for the most natural characterization of validity in terms of rational credence. (shrink)

The spiritus asper as used by Frege in a letter to Russell from 1904 bears resemblance to Church’s lambda. It is natural to ask how they relate to each other. An alternative approach to functional abstraction developed by Per Martin-Löf some thirty years ago allows us to describe the relationship precisely. Frege’s spiritus asper provides a way of restructuring a unary function name in Frege’s sense such that the argument place indicator occurs all the way to the right. Martin-Löf’s alternative (...) approach shows that this is only half of what lambda does. The other half is the deletion of the argument place indicator, resulting in what Frege would have called an isolated function name. (shrink)

The goal of this paper is to answer the following question: Does it make sense to speak of thought experiments not only in physics, but also in mathematics, to refer to an authentic type of activity? One may hesitate because mathematics as such is the exercise of reasoning par excellence, an activity where experience does not seem to play an important role. After reviewing some results of the research on thought experiments in the natural sciences, we turn our attention to (...) experiments and thought experiments in mathematics, especially in fundamental mathematics, and investigate what thought experiments can teach us there. If we accept the principle that mathematical practice can sometimes be best described by a pragmatist approach where the concept of experience in mathematics is considered from a new perspective, thought experiments can in some cases be a useful instrument different from both ‘mathematical experiments’ and ‘formal’ proofs: they are mathematical experiments using deviant methods. (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)

In this paper, we provide a detailed critical review of current approaches to ecthesis in Aristotle’s Prior Analytics, with a view to motivate a new approach, which builds upon previous work by Marion & Rückert (2016) on the dictum de omni. This approach sets Aristotle’s work within the context of dialectic and uses Lorenzen’s dialogical logic, hereby reframed with use of Martin-Löf's constructive type theory as ‘immanent reasoning’. We then provide rules of syllogistic for the latter, and provide proofs of (...) e-conversion, Darapti and Bocardo and e-subalternation, while showing how close to Aristotle’s text these proofs remain. (shrink)

The traditional view of evidence in mathematics is that evidence is just proof and proof is just derivation. There are good reasons for thinking that this view should be rejected: it misrepresents both historical and current mathematical practice. Nonetheless, evidence, proof, and derivation are closely intertwined. This paper seeks to tease these concepts apart. It emphasizes the role of argumentation as a context shared by evidence, proofs, and derivations. The utility of argumentation theory, in general, and argumentation schemes, in particular, (...) as a methodology for the study of mathematical practice is thereby demonstrated. Argumentation schemes represent an almost untapped resource for mathematics education. Notably, they provide a consistent treatment of rigorous and non-rigorous argumentation, thereby working to exhibit the continuity of reasoning in mathematics with reasoning in other areas. Moreover, since argumentation schemes are a comparatively mature methodology, there is a substantial body of existing work to draw upon, including some increasingly sophisticated software tools. Such tools have significant potential for the analysis and evaluation of mathematical argumentation. The first four sections of the paper address the relationships of evidence to proof, proof to derivation, argument to proof, and argument to evidence, respectively. The final section directly addresses some of the educational implications of an argumentation scheme account of mathematical reasoning. (shrink)

The two different layers of logical theory—epistemological and ontological—are considered and explained. Special attention is given to epistemic assumptions of the kind that a judgement is granted as known, and their role in validating rules of inference, namely to aid the inferential preservation of epistemic matters from premise judgements to conclusion judgement, while ordinary Natural Deduction assumptions serve to establish the holding of consequence from antecedent propositions to succedent proposition.

In Die Grundgesetze der Arithmetik (I, §48), Frege introduces his rule of the fusion of horizontals, according to which if an occurrence of the horizontal stroke is followed by another occurrence of the same stroke, either in isolation or “contained” in a propositional connective, the two occurrences can be fused with each other. However, the role of this rule, and of the horizontal sign more generally, is controversial; Michael Dummett notoriously claimed, for instance, that the horizontal is “wholly superfluous” in (...) Frege's logical system. In this paper, we challenge Dummett's view by providing a comprehensive analysis of the significance of the horizontal stroke. After some preliminary remarks, we argue that even if Frege's connectives in some sense “contain” the horizontal, yet they are total functions. Then, we take up the question of the sense expressed by the horizontal, and we claim that, unlike other sentential operators, the horizontal is not sense‐compositional. Finally, we consider the semantic and pragmatic aspects of Frege's horizontal in connection to his judgment stroke and the double judgment stroke. Contra Dummett, we argue that the horizontal is a special and indispensable element of Frege's logic. (shrink)

In practice, mathematical proofs are most often the result of careful planning by the agents who produced them. As a consequence, each mathematical proof inherits a plan in virtue of the way it is produced, a plan which underlies its “architecture” or “unity”. This paper provides an account of plans and planning in the context of mathematical proofs. The approach adopted here consists in looking for these notions not in mathematical proofs themselves, but in the agents who produced them. The (...) starting point is to recognize that to each mathematical proof corresponds a proof activity which consists of a sequence of deductive inferences—i.e., a sequence of epistemic actions—and that any written mathematical proof is only a report of its corresponding proof activity. The main idea to be developed is that the plan of a mathematical proof is to be conceived and analyzed as the plan of the agent(s) who carried out the corresponding proof activity. The core of the paper is thus devoted to the development of an account of plans and planning in the context of proof activities. The account is based on the theory of planning agency developed by Michael Bratman in the philosophy of action. It is fleshed out by providing an analysis of the notions of intention—the elementary components of plans—and practical reasoning—the process by which plans are constructed—in the context of proof activities. These two notions are then used to offer a precise characterization of the desired notion of plan for proof activities. A fruitful connection can then be established between the resulting framework and the recent theme of modularity in mathematics introduced by Jeremy Avigad. This connection is exploited to yield the concept of modular presentations of mathematical proofs which has direct implications for how to write and present mathematical proofs so as to deliver various epistemic benefits. The account is finally compared to the technique of proof planning developed by Alan Bundy and colleagues in the field of automated theorem proving. The paper concludes with some remarks on how the framework can be used to provide an analysis of understanding and explanation in the context of mathematical proofs. (shrink)

How is Frege able to claim that the notion of judgement is essential to his logic without introducing a form of psychologism? I argue first that Frege’s logical notion of judgement is to be distinguished from an empirical notion of judgement, that it cannot be understood as an abstract, idealized notion, and that there are doubts concerning a transcendental reading of Frege’s writings. Then, I explain that the logical notion of judgement has to be understood from a first-person perspective, to (...) be contrasted with a third-person perspective, in which judgement is understood as an empirical, psychological phenomenon. Frege’s logic is essentially a first-person engagement, as each of us can make use of the ideography as a science of logic only if we ourselves have made the relevant judgements. Finally, I claim that the judging agent as conceived by Frege can, after all, be understood as a transcendental ego. (shrink)

Logical pluralism is the view that there is more than one formal logic that correctly (or best, or legitimately) codifies the logical consequence relation in natural language. This essay provides a taxonomy of different variations on the logical pluralist theme based on a five-part structure, and then identifies an unoccupied position in this taxonomy: perspectival logical pluralism. Perspectival pluralism provides an attractive position from which to formulate a philosophy of logic from a feminist perspective (and from other, identity-based perspectives, such (...) as critical race theory). An example of how such an account might be developed is sketched. The essay concludes by defusing an obvious objection to the perspectival approach: the claim that the correct logic (or logics), in virtue of the formal nature of logic, should be independent of considerations regarding the identity of the reasoner. (shrink)

Jean Buridan developed his theory of consequence within a semantical framework compatible with what we now call token-based semantics. In his Treatise on Consequences and Sophismata, Buridan showed...

This paper distinguishes between two types of persuasive force arguments can have in terms of two different connections between arguments and inferences. First, borrowing from Pinto, an arguer's invitation to inference directly persuades an addressee if the addressee performs an inference that the arguer invites. This raises the question of how invited inferences are determined by an invitation to inference. Second, borrowing from Sorenson, an arguer's invitation to inference indirectly persuades an addressee if the addressee performs an inference guided by (...) the argument even though it is uninvited. This raises the question of how an invitation to inference can guide inferences that the arguer does not use the argument to invite. Focusing on belief-inducing inference, the primary aims here are to clarify what is necessary for an addressee's belief-inducing inference to be invited by an argument used as an instrument of persuasion; and to highlight the capacity of arguments to guide such inferences. The paper moves beyond Pinto's discussion by using Boghossian's Taking Condition in service of and in way that illustrates how epistemically bad arguments can rationally persuade addressees of their conclusions. (shrink)

The deviation of mathematical proof—proof in mathematical practice—from the ideal of formal proof—proof in formal logic—has led many philosophers of mathematics to reconsider the commonly accepted view according to which the notion of formal proof provides an accurate descriptive account of mathematical proof. This, in turn, has motivated a search for alternative accounts of mathematical proof purporting to be more faithful to the reality of mathematical practice. Yet, in order to develop and evaluate such alternative accounts, it appears as a (...) necessary prerequisite to first possess a clear picture of what the deviation of mathematical proof from formal proof consists in. The present work aims to contribute building such a picture by investigating the relation between the elementary steps of deduction constituting the two types of proofs—mathematical inference and logical inference. Many claims have been made in the literature regarding the relation between mathematical inference and logical inference, most of them stating that the former is lacking properties that are constitutive of the latter. Such differentiating claims are, however, usually put forward without a clear conception of the properties occurring in them, and are generally considered to be immediately justified by our direct acquaintance, or phenomenological experience, with the two types of inferences. The present study purports to advance our understanding of the relation between mathematical inference and logical inference by developing a detailed philosophical analysis of the differentiating claims, that is, an analysis of the meaning of the differentiating claims—through the properties that occur in them—as well as the reasons that support them. To this end, we provide at the outset a representative list of the different properties of logical inference that have occurred in the differentiating claims, and we notice that they all boil down to the three properties of formality, generality, and mechanicality. For each one of these properties, our analysis proceeds in two steps: we first provide precise conceptual characterizations of the different ways logical inference has been said to be formal, general, and mechanical, in the philosophical and logical literature on formal proof; we then examine why mathematical inference does not appear to be formal, general, and mechanical, for the different variations of these notions identified. Our study results in a precise conceptual apparatus for expressing and discussing the properties differentiating mathematical inference from logical inference, and provides a first inventory of the various reasons supporting the observations of those differences. The differentiating claims constitute thus a set of data that any philosophical account of mathematical inference and proof purporting to be more faithful to mathematical practice ought to be able to accommodate and explain. (shrink)

Mathematical proofs are not sequences of arbitrary deductive steps—each deductive step is, to some extent, rational. This paper aims to identify and characterize the particular form of rationality at play in mathematical proofs. The approach adopted consists in viewing mathematical proofs as reports of proof activities—that is, sequences of deductive inferences—and in characterizing the rationality of the former in terms of that of the latter. It is argued that proof activities are governed by specific norms of rational planning agency, and (...) that a deductive step in a mathematical proof qualifies as rational whenever the corresponding deductive inference in the associated proof activity figures in a plan that has been constructed rationally. It is then shown that mathematical proofs whose associated proof activities violate these norms are likely to be judged as defective by mathematical agents, thereby providing evidence that these norms are indeed present in mathematical practice. We conclude that, if mathematical proofs are not mere sequences of deductive steps, if they possess a rational structure, it is because they are the product of rational planning agents. (shrink)

Church has contributed a lot to the safeguard of G. Frege's theory of meaning after the discovery of antinomies in it. To achieve this he has adapted it by keeping parts, discarding others and adding new ones, most of which are clearly exposed in an informal way in the introduction to his Introduction to Mathematical Logic. As for any modification of a theory by another person, it is interesting to understand how the thoughts of the former survive in the new (...) theory even though radical changes have occurred, or on the contrary how it retains only the appearance of the initial theory. We shall therefore go through the basic concepts of logic he introduces in this introduction and assess their relation to Frege's original theory. (shrink)

In the present paper, the Fregean conception of proof-theoretic semantics that I developed elsewhere will be revised so as to better reflect the different roles played by open and closed derivations. I will argue that such a conception can deliver a semantic analysis of languages containing paradoxical expressions provided some of its basic tenets are liberalized. In particular, the notion of function underlying the Brouwer–Heyting–Kolmogorov explanation of implication should be understood as admitting functions to be partial. As argued in previous (...) work, the correctness of an inference rule should not be defined in terms of transmission of provability, but rather should be grounded on weaker principles, which I show that are motivated by consideration about the content of the inversion principle. In the conclusion, I briefly address the issue of compositionality, arguing that the violation of compositionality induced by paradoxes are no worse than others that are regarded, at least by Dummett, as wholly unproblematic. (shrink)

In this paper it is suggested to generalize our understanding of general (structural) proof theory and to consider it as a general theory of two kinds of derivations, namely proofs and dual proofs. The proposal is substantiated by (i) considerations on assertion, denial, and bi-lateralism, (ii) remarks on compositionality in proof-theoretic semantics, and (iii) comments on falsification and co-implication. The main formal result of the paper is a normal form theorem for the natural deduction proof system N2Int of the bi-intuitionistic (...) logic 2Int. The proof makes use of the faithful embedding of 2Int into intuitionistic logic with respect to validity and shows that conversions of dual proofs can be sidestepped. (shrink)

In this paper we argue that an account of proof-theoretic harmony based on reductions and expansions delivers an inferentialist picture of meaning which should be regarded as intensional, as opposed to other approaches to harmony that will be dubbed extensional. We show how the intensional account applies to any connective whose rules obey the inversion principle first proposed by Prawitz and Schroeder-Heister. In particular, by improving previous formulations of expansions, we solve a problem with quantum-disjunction first posed by Dummett. As (...) recently observed by Schroeder-Heister, however, the specification of an inversion principle cannot yield an exhaustive account of harmony. The reason is that there are more collections of elimination rules than just the one obtained by inversion which we are willing to acknowledge as being in harmony with a given collection of introduction rules. Several authors more or less implicitly suggest that what is common to all alternative harmonious collection of rules is their being interderivable with each other. On the basis of considerations about identity of proofs and formula isomorphism, we show that this is too weak a condition for a given collection of elimination rules to be in harmony with a collection of introduction rules, at least if the intensional picture of meaning we advocate is not to collapse on an extensional one. (shrink)

RésuméCette première étude permet notamment de dégager ce résultat épistémologique: les différentes formes d’“inférence co-relationnelle” connues dans la jurisprudence islamique sous le nom de qiyās représentent une forme innovante et sophistiquée de raisonnement qui permet non seulement d'avoir une conception épistémologique plus claire du raisonnement légal en général, mais aussi de produire une mécanique bien huilée pour le “raisonnement parallèle”; cette mécanique du “raisonnement parallèle” peut être déployée selon un large spectre dans différents cadres de résolution de problèmes et ne (...) semble pas se réduire aux formes standard de l'argumentation analogique étudiées en philosophie des sciences contemporaine. Nous n'aborderons cependant dans la présente étude que le cas de la dénommée “inférence co-relationnelle du facteur occasionnel”, et ce seulement dans le contexte de la jurisprudence islamique. (shrink)

This paper stresses the importance of identifying the nature of an author's conception of logic when using terms from modern logic in order to avoid, as far as possible, injecting our own conception of logic in the author's texts. Sundholm (2012. “‘Inference versus consequence” revisited: Inference, conditional, implication’, Synthese, 187, 943–956) points out that inferences are staged at the epistemic level and are made out of judgments, not propositions. Since it is now standard to read Aristotelian sullogismoi as inferences, I (...) have taken Alexander of Aphrodisias's commentaries to Aristotle's logical treatises as a basis for arguing that the premises and conclusions should be read as judgments rather than as propositions. Under this reading, when Alexander speaks of protaseis, we should not read the modern notion of proposition, but rather what we now call judgments. The point is not just a matter of terminology, it is about the conception of logic this terminology conveys. In this regard, insisting on judgments rather than on propositions helps bring to light Alexander's epistemic conception of logic. (shrink)

One of the epistemological results emerging from this initial study is that the different forms of co-relational inference, known in the Islamic jurisprudence as qiyās, represent an innovative and sophisticated form of reasoning that not only provides new epistemological insights into legal reasoning in general but also furnishes a fine-grained pattern for parallel reasoning which can be deployed in a wide range of problem-solving contexts and does not seem to reduce to the standard forms of analogical argumentation studied in contemporary (...) philosophy of science. However, in the present paper we will only discuss the case of so-called co-relational inferences of the occasioning factor and only in the context of Islamic jurisprudence. (shrink)

In this paper we consider logical inference as an activity that results in proofs and hence produces knowledge. We suggest to merge the semantical analysis of deliberatively seeing-to-it-that from stit theory and the semantics of the epistemic logic with justification from. The general idea is to understand proving that A as seeing to it that a proof of A is available. We introduce a semantics of various notions of proving as an activity and present a number of valid principles that (...) relate the various notions of proving to each other and to notions of justified knowledge, implicit knowledge, and possibility. We also point out and comment upon certain principles our semantics fails to validate. (shrink)