The paper studies the extension of harmony and stability, major themes in proof-theoretic semantics, from single-conclusion natural-deduction systems to multiple -conclusions natural-deduction, independently of classical logic. An extension of the method of obtaining harmoniously-induced general elimination rules from given introduction rules is suggested, taking into account sub-structurality. Finally, the reductions and expansions of the multiple -conclusions natural-deduction representation of classical logic are formulated.

This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett’s and Dag Prawitz’ philosophical motivations and give precise characterisations of the crucial notions of harmony and stability, placed in the context of proving normalisation results in systems of natural deduction. I point out a problem for defining the meaning of negation in this framework and prospects for an account of the meanings of (...) modal operators in terms of rules of inference. (shrink)

The requirement of proof-theoretic harmony has played a pivotal role in a number of debates in the philosophy of logic. Different authors have attempted to precisify the notion in different ways. Among these, three proposals have been prominent in the literature: harmony–as–conservative extension, harmony–as–leveling procedure, and Tennant’s harmony–as–deductive equilibrium. In this paper I propose to clarify the logical relationships between these accounts. In particular, I demonstrate that what I call the equivalence conjecture —that these three notions essentially come to the (...) same thing—is erroneous. (shrink)

In the proof-theoretic semantics approach to meaning, harmony , requiring a balance between introduction-rules (I-rules) and elimination rules (E-rules) within a meaning conferring natural-deduction proof-system, is a central notion. In this paper, we consider two notions of harmony that were proposed in the literature: 1. GE-harmony , requiring a certain form of the E-rules, given the form of the I-rules. 2. Local intrinsic harmony : imposes the existence of certain transformations of derivations, known as reduction and expansion . We propose (...) a construction of the E-rules (in GE-form) from given I-rules, and prove that the constructed rules satisfy also local intrinsic harmony. The construction is based on a classification of I-rules, and constitute an implementation to Gentzen’s (and Pawitz’) remark, that E-rules can be “read off” I-rules. (shrink)

The paper presents a proof-theoretic semantics (PTS) for a fragment of natural language, providing an alternative to the traditional model-theoretic (Montagovian) semantics (MTS), whereby meanings are truth-condition (in arbitrary models). Instead, meanings are taken as derivability-conditions in a dedicated natural-deduction (ND) proof-system. This semantics is effective (algorithmically decidable), adhering to the meaning as use paradigm, not suffering from several of the criticisms formulated by philosophers of language against MTS as a theory of meaning. In particular, Dummett’s manifestation argument does not (...) obtain, and assertions are always warranted, having grounds of assertion. The proof system is shown to satisfy Dummett’s harmony property, justifying the ND rules as meaning conferring. The semantics is suitable for incorporation into computational linguistics grammars, formulated in type-logical grammar. (shrink)

TheTractatusfirst appeared in 1921, the same year that Post's “Introduction to a General Theory of Elementary Propositions” appeared in theAmerican Journal of Mathematics. As the latter is the first piece clearly to present and exploit the distinction between a deductive system and a truth-functional interpretation of such a system, we may conclude that Wittgenstein's views had been arrived at somewhat before a variety of logical concepts had received the clarification and refinement incipient on the now taken-for-granted distinction between proof and (...) model theory. One such concept, of considerable interest to Wittgenstein, was that of inference. The following constitutes an attempt to explicate his notion. In particular, I shall attempt to show that his repudiation of “laws of inference” is closely tied to his rejection of logical constants; and that both can be seen as the product of what might be termed a “metaphysics of completeness”—before, of course, any notion of completeness had achieved a measure of precision or currency. (shrink)

We think of logic as objective. We also think that we are reliable about logic. These views jointly generate a puzzle: How is it that we are reliable about logic? How is it that our logical beliefs match an objective domain of logical fact? This is an instance of a more general challenge to explain our reliability about a priori domains. In this paper, I argue that the nature of this challenge has not been properly understood. I explicate the challenge (...) both in general and for the particular case of logic. I also argue that two seemingly attractive responses – appealing to a faculty of rational insight or to the nature of concept possession – are incapable of answering the challenge. (shrink)

Is logic, feasibly, a product of natural selection? In this paper we treat this question as dependent upon the prior question of where logic is founded. After excluding other possibilities, we conclude that logic resides in our language, in the shape of inferential rules governing the logical vocabulary of the language. This means that knowledge of (the laws of) logic is inseparable from the possession of the logical constants they govern. In this sense, logic may be seen as a product (...) of natural selection: the emergence of logic requires the development of creatures who can wield structured languages of a specific complexity, and who are capable of putting the languages to use within specific discursive practices. (shrink)

Alberto Coffa used the phrase "the Copernican turn in semantics" to denote a revolutionary transformation of philosophical views about the connection between the meanings of words and the acceptability of sentences and arguments containing those words. According to the new conception resulting from the Copernican turn, here called "the Copernican view", rules of use are constitutive of the meanings of words. This view has been linked with two doctrines: (A) the instances of meaning-constitutive rules are analytically and a priori true (...) or valid; (B) to grasp a meaning is to accept its rules. The pros and cons of different versions of the Copernican view, ascribable to Wittgenstein, Carnap, Gentzen, Dummett, Prawitz, Boghossian and other authors, will be weighed. A new version will be proposed, which implies neither (A) nor (B). (shrink)

In discussions of Fitch’s paradox, it is usually assumed without further argument that knowledge is factive, that if a subject knows that p, then p is true. It is argued that this common assumption is not as well-founded as it should be, and that there in fact are certain reasons to be suspicious of the unrestricted version of the factiveness claim. There are two kinds of reason for this suspicion. One is that unrestricted factiveness leads to paradoxes and unexpected results, (...) the other is that the usual arguments for factiveness are not as compelling as is commonly thought. There may in fact be some kinds of contexts, where factiveness doesn’t hold for knowledge—the usual arguments for factiveness don’t suffice to support the claim that knowledge is unrestrictedly factive. Perhaps all that can be shown is that knowledge is at times factive, or that it is default factive, as it were: this doesn’t show that there can’t be counterexamples, however. Certain aspects of knowledge without unrestricted factiveness are examined briefly. (shrink)

The essay addresses the well‐known idea that there has to be a place for intuition, thought of as a kind of non‐inferential rational insight, in the epistemology of basic logic if our knowledge of its principles is non‐empirical and is to allow of any finite, non‐circular reconstruction. It is argued that the error in this idea consists in its overlooking the possibility that there is, properly speaking, no knowledge of the validity of principles of basic logic. When certain important distinctions (...) are observed, for instance that between recognising that Modus Ponenes is sound and recognising that it is proof against the competent discovery of basic counterexamples, the case for thinking that there is indeed no space for genuine recognition of the validity of Modus Ponens becomes increasingly impressive. It is argued however that, the impossibility of knowledge notwithstanding, we are, in an important sense, entitled to take it that Modus Ponens is sound and that this notion of entitlement can help break the trichotomy ‐ intuition, inference, experience ‐ which imprisons our ordinary thinking about logical knowledge. (shrink)

In virtue of what are we justified in employing the rule of inference Modus Ponens? One tempting approach to answering this question is to claim that we are justified in employing Modus Ponens purely in virtue of facts concerning meaning or concept-possession. In this paper, we argue that such meaning-based accounts cannot be accepted as the fundamental account of our justification.

Michael Dummett and Dag Prawitz have argued that a constructivist theory of meaning depends on explicating the meaning of logical constants in terms of the theory of valid inference, imposing a constraint of harmony on acceptable connectives. They argue further that classical logic, in particular, classical negation, breaks these constraints, so that classical negation, if a cogent notion at all, has a meaning going beyond what can be exhibited in its inferential use. I argue that Dummett gives a mistaken elaboration (...) of the notion of harmony, an idea stemming from a remark of Gerhard Gentzen's. The introduction-rules are autonomous if they are taken fully to specify the meaning of the logical constants, and the rules are harmonious if the elimination-rule draws its conclusion from just the grounds stated in the introduction-rule. The key to harmony in classical logic then lies in strengthening the theory of the conditional so that the positive logic contains the full classical theory of the conditional. This is achieved by allowing parametric formulae in the natural deduction proofs, a form of multiple-conclusion logic. (shrink)

There have been several different and even opposed conceptions of the problem of logical constants, i.e. of the requirements that a good theory of logical constants ought to satisfy. This paper is in the first place a survey of these conceptions and a critique of the theories they have given rise to. A second aim of the paper is to sketch some ideas about what a good theory would look like. A third aim is to draw from these ideas and (...) from the preceding survey the conclusion that most conceptions of the problem of logical constants involve requirements of a philosophically demanding nature which are probably not satisfiable by any minimally adequate theory. (shrink)

In “The Runabout Inference Ticket” AN Prior (1960) examines the idea that logical connectives can be given a meaning solely in virtue of the stipulation of a set of rules governing them, and thus that logical truth/consequence.

In philosophical logic and proof theory, we often find multiple-conclusion systems that induce a conjunctive reading of premises and a disjunctive reading of conclusions. In mathematical logic, in contrast, we often find multiple-conclusion systems that induce a conjunctive reading of both premises and conclusions. This paper studies some technical and philosophical aspects of this latter approach to multiple-conclusion consequence. The takeaway is that, while the importance of disjunctive multiple conclusions is beyond doubt, conjunctive multiple conclusions also have philosophical interest. First, (...) because there is some evidence that there are arguments with conjunctive multiple conclusions in natural language. Second, because conjunctive multiple conclusions are compatible with the reflexivity and transitivity of logical consequence, and this allows them to cohere better with some of our best accounts of what logical consequence is. (shrink)

Bilateral proof systems, which provide rules for both affirming and denying sentences, have been prominent in the development of proof-theoretic semantics for classical logic in recent years. However, such systems provide a substantial amount of freedom in the formulation of the rules, and, as a result, a number of different sets of rules have been put forward as definitive of the meanings of the classical connectives. In this paper, I argue that a single general schema for bilateral proof rules has (...) a reasonable claim to inferentially articulating the core meaning of all of the classical connectives. I propose this schema in the context of a bilateral sequent calculus in which each connective is given exactly two rules: a rule for affirmation and a rule for denial. Positive and negative rules for all of the classical connectives are given by a single rule schema, harmony between these positive and negative rules is established at the schematic level by a pair of elimination theorems, and the truth-conditions for all of the classical connectives are read off at once from the schema itself. (shrink)

The purpose of this introduction is to give a rough overview of the discussion of the formalization of arguments, focusing on deductive arguments. The discussion is structured around four important junctions: i) the notion of support, which captures the relation between the conclusion and premises of an argument, ii) the choice of a formal language into which the argument is translated in order to make it amenable to evaluation via formal methods, iii) the question of quality criteria for such formalizations, (...) and finally iv) the choice of the underlying logic. This introductory discussion is supplemented by a brief description of the genesis of the special issue, acknowledgements, and summaries of each article. (shrink)

Ian Rumfitt (2000) developed a bilateralist account of logic in which the meaning of the connectives is given by conditions on asserted and rejected sentences. An additional set of inference rules, the coordination principles, determines the interaction of assertion and rejection. Fernando Ferreira (2008) found this account defective, as Rumfitt must state the coordination principles for arbitrary complex sentences. Rumfitt (2008) has a reply, but we argue that the problem runs deeper than he acknowledges and is in fact related to (...) the challenge of establishing proof-theoretic harmony. We motivate a distinctively bilateral criterion for harmony and show how the bilateralist can meet it. This also resolves Ferreira's complaint. (shrink)

This paper formulates a bilateral account of harmony that is an alternative to one proposed by Francez. It builds on an account of harmony for unilateral logic proposed by Kürbis and the observation that reading the rules for the connectives of bilateral logic bottom up gives the grounds and consequences of formulas with the opposite speech act. I formulate a process I call 'inversion' which allows the determination of assertive elimination rules from assertive introduction rules, and rejective elimination rules from (...) rejective introduction rules, and conversely. It corresponds to Francez's notion of vertical harmony. I also formulate a process I call 'conversion', which allows the determination of rejective introduction rules from assertive elimination rules and conversely, and the determination of assertive introduction rules from rejective elimination rules and conversely. It corresponds to Francez's notion of horizontal harmony. The account has a number of features that distinguish it from Francez's. (shrink)

There appears to be few, if any, limits on what sorts of logical connectives can be added to a given logic. One source of potential limitations is the motivating ideology associated with a logic. While extraneous to the logic, the motivating ideology is often important for the development of formal and philosophical work on that logic, as is the case with intuitionistic logic. One family of logics for which the philosophical ideology is important is the family of relevant logics. In (...) this paper, I explore the limits of what a relevant connective is, showing how some basic criteria motivated by the ideology of relevant logicians provide robust limits on potential connectives. These criteria provide some plausible necessary conditions on being a relevant connective. (shrink)

Logicians disagree about how validity—the very heart of logic—should be understood. Many different formal systems have been born due to this disagreement. This thesis examines how teachers explain the subject matter of logic to students in introductory logic textbooks, and demonstrates the different explanations teachers use. These differences help explain why logicians have different intuitions about validity.

Inferentialism is a theory in the philosophy of language which claims that the meanings of expressions are constituted by inferential roles or relations. Instead of a traditional model-theoretic semantics, it naturally lends itself to a proof-theoretic semantics, where meaning is understood in terms of inference rules with a proof system. Most work in proof-theoretic semantics has focused on logical constants, with comparatively little work on the semantics of non-logical vocabulary. Drawing on Robert Brandom’s notion of material inference and Greg Restall’s (...) bilateralist interpretation of the multiple conclusion sequent calculus, I present a proof-theoretic semantics for atomic sentences and their constituent names and predicates. The resulting system has several interesting features: (1) the rules are harmonious and stable; (2) the rules create a structure analogous to familiar model-theoretic semantics; and (3) the semantics is compositional, in that the rules for atomic sentences are determined by those for their constituent names and predicates. (shrink)

P.F. Strawson contributed to many philosophical domains, including the philosophy of language, the history of philosophy, metaphysics, moral philosophy and philosophical methodology. Most of his contributions in these areas have influenced contemporary debates, either because his views are still defended or because they are still considered worthy of detailed responses. His views on the philosophy of logic have been only rarely discussed, however. My aim in this paper is threefold. First, I provide a systematic account of Strawson’s philosophy of logic. (...) I argue that Strawson is an important predecessor of logical expressivism, a contemporary position in the philosophy of logic most notably defended by Robert Brandom. My main focus is on Strawson’s largely-neglected 1982 paper ‘Logical Form and Logical Constants’, which contains his most mature ideas on the topic. Second, while Strawson’s position is of historical and independent philosophical interest, I argue that he leaves many points unclear. Finally, I propose several clarifications of Strawson’s position. (shrink)

The article presents a full proof‐theoretic semantics for natural deduction based on an extended inversion principle: the elimination rule for an operator q may invert the introduction rule for q, but also vice versa, the introduction rule for a connective q may invert the elimination rule for q. Such an inversion—extending Prawitz' concept of inversion—gives the following theorem: Inversion for two rules of operator q (intro rule, elim rule) exists iff a reduction of a maximum formula for q exists. The (...) inversion theorem is specified to two logics, Lambek calculus (LC) and intuitionistic linear logic (ILL), with four propositional connectives: two multiplicatives (implication and conjunction) and two additives (conjunction and disjunction), with two quantifiers and two modals. LC is defined by using elimination rules by composition. ILL is defined by using usual general elimination rules. Elimination rules by composition are an exciting alternative to general elimination rules; in some cases, they do not need permutations. (shrink)

Logic is about reasoning, or so the story goes. This thesis looks at the concept of logic, what it is, and what claims of correctness of logics amount to. The concept of logic is not a settled matter, and has not been throughout the history of it as a notion. Tools from conceptual analysis aid in this historical venture. Once the unsettledness of logic is established we see the repercussions in current debates in the philosophy of logic. Much of the (...) battle over the ‘one true logic’ is conceptually talking past each other. The theory of logics-as-formalizations is presented as a conceptually open theory of logic which is Carnapian in flavour and grounding. Rudolf Carnap’s notions surrounding ‘external’ and ‘pseudo-questions’ about linguistic frameworks apply to formalizations, thus logics, as well. An account of what formalizations are, a more structured sub-set of modelling, is given to ground the claim that logics are formalizations. Finally, a novel account of correctness, the COFE framework, is developed which allows the notions of logical monism, pluralism and nihilism to be more precisely formulated than they currently are in the discourse. (shrink)

Bill D'Alessandro talks to Kenny Easwaran about fractal music, Zoom conferences, being a good referee, teaching in math and philosophy, the rationalist community and its relationship to academia, decision-theoretic pluralism, and the city of Manhattan, Kansas.

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk, for which, unlike for tonk, there are reduction steps for the removal of maximal formulas arising from introducing and eliminating formulas with those connectives as main operators. Adding either of them to bilateral classical logic results in an incoherent system. One way around this problem is (...) to count formulas as maximal that are the conclusion of reductio and major premise of an elimination rule and to require their removability from deductions. The main part of the paper consists in a proof of a normalisation theorem for bilateral logic. The closing sections address philosophical concerns whether the proof provides a satisfactory solution to the problem at hand and confronts bilateralists with the dilemma that a bilateral notion of stability sits uneasily with the core bilateral thesis. (shrink)

We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The logical framework developed provides the (...) basis for a novel, proof-theoretic approach to the study of epistemic modality. To demonstrate the fruitfulness of the approach, we show how the framework allows us to reconcile classical logic with the contradictoriness of so-called Yalcin sentences and to distinguish between various inference patterns on the basis of the epistemic properties they preserve. (shrink)

The logic of assertive graphs (AGs) is a modification of Peirce’s logic of existential graphs (EGs), which is intuitionistic and which takes assertions as its explicit object of study. In this paper we extend AGs into a classical graphical logic of assertions (ClAG) whose internal logic is classical. The characteristic feature is that both AGs and ClAG retain deep-inference rules of transformation. Unlike classical EGs, both AGs and ClAG can do so without explicitly introducing polarities of areas in their language. (...) We then compare advantages of these two graphical approaches to the logic of assertions with a reference to a number of topics in philosophy of logic and to their deep-inferential nature of proofs. (shrink)

We present an inferentialist account of the epistemic modal operator might. Our starting point is the bilateralist programme. A bilateralist explains the operator not in terms of the speech act of rejection ; we explain the operator might in terms of weak assertion, a speech act whose existence we argue for on the basis of linguistic evidence. We show that our account of might provides a solution to certain well-known puzzles about the semantics of modal vocabulary whilst retaining classical logic. (...) This demonstrates that an inferentialist approach to meaning can be successfully extended beyond the core logical constants. (shrink)

Hartry Field distinguished two concepts of type‐free truth: scientific truth and disquotational truth. We argue that scientific type‐free truth cannot do justificatory work in the foundations of mathematics. We also present an argument, based on Crispin Wright's theory of cognitive projects and entitlement, that disquotational truth can do justificatory work in the foundations of mathematics. The price to pay for this is that the concept of disquotational truth requires non‐classical logical treatment.

Anti-exceptionalism about logic is the doctrine that logic does not require its own epistemology, for its methods are continuous with those of science. Although most recently urged by Williamson, the idea goes back at least to Lakatos, who wanted to adapt Popper's falsicationism and extend it not only to mathematics but to logic as well. But one needs to be careful here to distinguish the empirical from the a posteriori. Lakatos coined the term 'quasi-empirical' `for the counterinstances to putative mathematical (...) and logical theses. Mathematics and logic may both be a posteriori, but it does not follow that they are empirical. Indeed, as Williamson has demonstrated, what counts as empirical knowledge, and the role of experience in acquiring knowledge, are both unclear. Moreover, knowledge, even of necessary truths, is fallible. Nonetheless, logical consequence holds in virtue of the meaning of the logical terms, just as consequence in general holds in virtue of the meanings of the concepts involved; and so logic is both analytic and necessary. In this respect, it is exceptional. But its methodologyand its epistemology are the same as those of mathematics and science in being fallibilist, and counterexamples to seemingly analytic truths are as likely as those in any scientic endeavour. What is needed is a new account of the evidential basis of knowledge, one which is, perhaps surprisingly, found in Aristotle. (shrink)

Variations on the argument “Inferences are moves from meaningful statements to meaningful statements; hence the meanings cannot be inferential roles” are often used as knock-down argument against inferentialism. In this short paper I indicate that the argument is simply a non sequitur.

We are justified in employing the rule of inference Modus Ponens (or one much like it) as basic in our reasoning. By contrast, we are not justified in employing a rule of inference that permits inferring to some difficult mathematical theorem from the relevant axioms in a single step. Such an inferential step is intuitively “too large” to count as justified. What accounts for this difference? In this paper, I canvass several possible explanations. I argue that the most promising approach (...) is to appeal to features like usefulness or indispensability to important or required cognitive projects. On the resulting view, whether an inferential step counts as large or small depends on the importance of the relevant rule of inference in our thought. (shrink)

This paper responds to recent work in the philosophy of Homotopy Type Theory by James Ladyman and Stuart Presnell. They consider one of the rules for identity, path induction, and justify it along ‘pre-mathematical’ lines. I give an alternate justification based on the philosophical framework of inferentialism. Accordingly, I construct a notion of harmony that allows the inferentialist to say when a connective or concept is meaning-bearing and this conception unifies most of the prominent conceptions of harmony through category theory. (...) This categorical harmony is stated in terms of adjoints and says that any concept definable by iterated adjoints from general categorical operations is harmonious. Moreover, it has been shown that identity in a categorical setting is determined by an adjoint in the relevant way. Furthermore, path induction as a rule comes from this definition. Thus we arrive at an account of how path induction, as a rule of inference governing identity, can be justified on mathematically motivated grounds. (shrink)

Fodor's thinking on modularity has been influential throughout a range of the areas studying cognition, chiefly as a prod for positive work on modularity and domain-specificity. In _The Mind Doesn't Work That Way_, Fodor has developed the dark message of _The Modularity of Mind_ regarding the limits to modularity and computational analyses. This paper offers a critical assessment of Fodor's scepticism with an eye to highlighting some broader issues in play, including the nature of computation and the role of recent (...) empirical developments in the cognitive sciences in assessing Fodor's position. (shrink)

Prior’s Tonk is a famously horrible connective. It is defined by its inference rules. My aim in this article is to compare Tonk with some hitherto unnoticed nasty connectives, which are defined in semantic terms. I first use many-valued truth-tables for classical sentential logic to define a nasty connective, Knot. I then argue that we should refuse to add Knot to our language. And I show that this reverses the standard dialectic surrounding Tonk, and yields a novel solution to the (...) problem of many-valued truth-tables for classical sentential logic. I close by outlining the technicalities surrounding nasty connectives on many-valued truth-tables. (shrink)

The paper proposes an extension of the definition of a canonical proof, central to proof-theoretic semantics, to a definition of a canonical derivation from open assumptions. The impact of the extension on the definition of (reified) proof-theoretic meaning of logical constants is discussed. The extended definition also sheds light on a puzzle regarding the definition of local-completeness of a natural-deduction proof-system, underlying its harmony.

The focus of this paper are Dummett's meaning-theoretical arguments against classical logic based on consideration about the meaning of negation. Using Dummettian principles, I shall outline three such arguments, of increasing strength, and show that they are unsuccessful by giving responses to each argument on behalf of the classical logician. What is crucial is that in responding to these arguments a classicist need not challenge any of the basic assumptions of Dummett's outlook on the theory of meaning. In particular, I (...) shall grant Dummett his general bias towards verificationism, encapsulated in the slogan 'meaning is use'. The second general assumption I see no need to question is Dummett's particular breed of molecularism. Some of Dummett's assumptions will have to be given up, if classical logic is to be vindicated in his meaning-theoretical framework. A major result of this paper will be that the meaning of negation cannot be defined by rules of inference in the Dummettian framework. (shrink)

A comparison is given between two conditions used to define logical constants: Belnap's uniqueness and Hacking's deducibility of identicals. It is shown that, in spite of some surface similarities, there is a deep difference between them. On the one hand, deducibility of identicals turns out to be a weaker and less demanding condition than uniqueness. On the other hand, deducibility of identicals is shown to be more faithful to the inferentialist perspective, permitting definition of genuinely proof-theoretical concepts. This kind of (...) analysis is driven by exploiting the Curry–Howard correspondence. In particular, deducibility of identicals is shown to correspond to the computational property of eta expansion, which is essential in the characterization of propositional identity. (shrink)

At least some of us, at least some of the time—when not in the grip of radical sceptical doubt—are inclined to believe that we know, for example, that if we infer a conclusion from two true premises, one a conditional whose consequent is that conclusion and the other the antecedent of that conditional, then our conclusion must be true, or that we know similar things about other simple patterns of inference. If we do indeed have knowledge of this sort, it (...) is what I mean by logical knowledge. Logical knowledge is, roughly speaking, knowledge about logic—such as knowledge that a certain principle of inference necessarily preserves truth, or that every proposition of a certain form must be true—and so is not the same thing as knowledge that is gained by using logic, i.e. inferential knowledge. That is not to say, of course, that logical knowledge can't be inferential. On the contrary, it is barely open to question that—if there is any logical knowledge at all—there is a lot of inferential logical knowledge. For example, if we know that the introduction and elimination principles for the conditional are truth-preserving, we can surely get to know, by inference, that the principle of hypothetical syllogism is so too, not to mention other, less obvious and more recondite, examples of putative logical knowledge. (shrink)

In this paper I will argue that (principled) attempts to ground a priori knowledge in default reasonable beliefs cannot capture certain common intuitions about what is required for a priori knowledge. I will describe hypothetical creatures who derive complex mathematical truths like Fermat’s last theorem via short and intuitively unconvincing arguments. Many philosophers with foundationalist inclinations will feel that these creatures must lack knowledge because they are unable to justify their mathematical assumptions in terms of the kind of basic facts (...) which can be known without further argument. Yet, I will argue that nothing in the current literature lets us draw a principled distinction between what these creatures are doing and paradigmatic cases of good a priori reasoning (assuming that the latter are to be grounded in default reasonable beliefs). I will consider, in turn, appeals to reliability, coherence, conceptual truth and indispensability and argue that none of these can do the job. (shrink)

We first discuss Michael Dummett’s philosophy of mathematics and Robert Brandom’s philosophy of language to demonstrate that inferentialism entails the falsity of Church’s Thesis and, as a consequence, the Computational Theory of Mind. This amounts to an entirely novel critique of mechanism in the philosophy of mind, one we show to have tremendous advantages over the traditional Lucas-Penrose argument.

Dummett's case against platonism rests on arguments concerning the acquisition and manifestation of knowledge of meaning. Dummett's arguments are here criticized from a viewpoint less Davidsonian than Chomskian. Dummett's case against formalism is obscure because in its prescriptive considerations are not clearly separated from descriptive. Dummett's implicit value judgments are here made explicit and questioned. ?Combat Revisionism!? Chairman Mao.

Semantic indeterminacy is the ether of philosophy of language. It fills the interstices of our intentions and pervades accounts of presupposition, tense, fiction, translation, and especially, vagueness. Yet semantic indeterminacy is as impossible as ectoplasm. Indeed, more so! The demonstration need only borrow a few assumptions used elsewhere in widely accepted impossibility results. Since an impossibility is never a necessary condition for anything actual, semantic indeterminacy must be superfluous. Language is no more explained by semantic indeterminacy than calculus is explained (...) by (pre-Robinsonian) infinitesimals. (shrink)

In this paper I will argue that Boghossian's explanation of how we can acquire a priori knowledge of logical principles through implicit definitions commits a transmission of warrant-failure. To this end, I will briefly outline Boghossian's account, followed by an explanation of what a transmission of warrant-failure consists in. I will also show that this charge is independent of the worry of rule-circularity which has been raised concerning the justification of logical principles and of which Boghossian is fully aware. My (...) argument comes in two steps: firstly, I will argue for the insufficiency of Boghossian's template which is meant to explain how a subject can acquire a warrant for logical principles. I will show however that this insufficiency of his template can be remedied by adopting what I call the Disquotational Step. Secondly, I will argue that incorporating this further step makes his template subject to a transmission of warrant-failure, assuming that certain rather basic and individually motivated principles hold. Thus, Boghossian's account faces a dilemma: either he adopts the Disquotational Step and subjects his account to the charge of a transmission of warrant-failure, or he drops this additional step leaving the account confronted with explaining the gap that has previously been highlighted. I will then suggest various rejoinders that Boghossian might adopt but none of which - I will argue - can resolve the dilemma. Lastly, I will raise and briefly discuss the question whether this worry generalizes to other accounts, such as Hale and Wright's that aim to explain our knowledge of logic and/or mathematics in virtue of implicit definitions. (shrink)