This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...) subject from a rich variety of angles, including the history of logic, the proper interpretation of logical validity, natural deduction rules, the notions of harmony and of synonymy, the structure of proofs, the logical status of equality, intentional phenomena, and the proof theory of second-order arithmetic. All chapters relate directly to questions that have driven Schroeder-Heister's own research agenda and to which he has made seminal contributions. The extensive autobiographical chapter not only provides a fascinating overview of Schroeder-Heister's career and the evolution of his academic interests but also constitutes a contribution to the recent history of logic in its own right, painting an intriguing picture of the philosophical, logical, and mathematical institutional landscape in Germany and elsewhere since the early 1970s. The papers collected in this book are illuminatingly put into a unified perspective by Schroeder-Heister's comments at the end of the book. Both graduate students and established researchers in the field will find this book an excellent resource for future work in proof-theoretic semantics and related areas. (shrink)

We are reliable about logic in the sense that we by-and-large believe logical truths and disbelieve logical falsehoods. Given that logic is an objective subject matter, it is difficult to provide a satisfying explanation of our reliability. This generates a significant epistemological challenge, analogous to the well-known Benacerraf-Field problem for mathematical Platonism. One initially plausible way to answer the challenge is to appeal to evolution by natural selection. The central idea is that being able to correctly deductively reason conferred a (...) heritable survival advantage upon our ancestors. However, there are several arguments that purport to show that evolutionary accounts cannot even in principle explain how it is that we are reliable about logic. In this paper, I address these arguments. I show that there is no general reason to think that evolutionary accounts are incapable of explaining our reliability about logic. (shrink)

Starting from certain metalogical results, I argue that first-order logical truths of classical logic are a priori and necessary. Afterwards, I formulate two arguments for the idea that first-order logical truths are also analytic, namely, I first argue that there is a conceptual connection between aprioricity, necessity, and analyticity, such that aprioricity together with necessity entails analyticity; then, I argue that the structure of natural deduction systems for FOL displays the analyticity of its truths. Consequently, each philosophical approach to these (...) truths should account for this evidence, i.e., that first-order logical truths are a priori, necessary, and analytic, and it is my contention that the semantic account is a better candidate. (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)

Charles Sanders Peirce was one of the United States’ most original and profound thinkers, and a prolific writer. Peirce’s game theory-based approaches to the semantics and pragmatics of signs and language, to the theory of communication, and to the evolutionary emergence of signs, provide a toolkit for contemporary scholars and philosophers. Drawing on unpublished manuscripts, the book offers a rich, fresh picture of the achievements of a remarkable man.

In this study two strands of inferentialism are brought together: the philosophical doctrine of Brandom, according to which meanings are generally inferential roles, and the logical doctrine prioritizing proof-theory over model theory and approaching meaning in logical, especially proof-theoretical terms.

What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...) argues that our conventions, in the form of syntactic rules of language use, are perfectly suited to explain the truth, necessity, and a priority of logical and mathematical claims, as well as our logical and mathematical knowledge. (shrink)

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)

The status of the equality predicate as a logical constant is problematic. In the paper we look at the problem from the proof-theoretic standpoint and survey several ways of treating equality in formal systems of different sorts. In particular, we focus on the framework of sequent calculus and examine equality in the light of criteria of logicality proposed by Hacking and Došen. Both attempts were formulated in terms of sequent calculus rules, although in the case of Došen it has a (...) nonstandard character. It will be shown that equality can be characterised in a way which satisfies Došen’s criteria of logicality. In the case of Hacking’s approach the fully satisfying result can be obtained only for languages with a nonempty, finite set of predicate constants other than equality. Otherwise, cut elimination theorem fails to hold. (shrink)

Resumo: Pedro Hispano define os sincategoremas como expressões que revelam de que maneira os sujeitos e os predicados estão de fato relacionados nas proposições, contribuindo assim para o estabelecer o que elas significam e fixar as condições de verdade e as formas lógicas correspondentes. Entre as expressões que ele julga serem sincategoremáticas, ‘não’, ‘e’, ‘ou’, ‘se’, ‘todo’ e ‘necessário’ se destacam atualmente como constantes lógicas. Todavia, opondo-se a grande parte dos lógicos contemporâneos para quem tais expressões possuem um significado fixo (...) na medida em que integram as formas lógicas das respectivas proposições, Pedro Hispano admite que seu significado pode ser modificado quando a expressões do mesmo tipo credita a capacidade de atuarem em determinados contextos como categoremas. Além disso, ao defender que as expressões ora em questão explicitam as formas lógicas das proposições mediante a articulação dos categoremas a elas associados, ele também demonstra divergir dos principais critérios de demarcação das constantes lógicas atualmente vigentes que não preveem a atribuição de tal comportamento a expressões desse tipo. Portanto, não resta dúvida de que a teoria de Pedro Hispano sobre os sincategoremas enriquece a nossa compreensão ainda insuficiente da natureza das constantes lógicas e contribui para a resolução do problema da demarcação de tais expressões.: According to Petrus Hispanus, syncategoremata are expressions that determine how subjects and predicates are actually related in propositions. They contribute to establishing what the categoremata mean and to specifying the truth conditions of the corresponding logical forms. Among the expressions Peter of Spain thinks of as syncategorematic, ‘not’, ‘and’, ‘or’, ‘if’, ‘all, and ‘necessary’ are nowadays considered to be logical operators. But unlike the contemporary logicians who argue that these expressions have fixed meanings because they belong to the logical forms of the corresponding propositions, Peter of Spain allows that their meanings can be modified, attributing to them the ability to act in certain contexts as categoremata. In addition, he argues that these expressions make explicit the logical forms through the articulation of corresponding propositions’ categoremata; thus he also diverges from the main contemporary criteria of demarcation of logical constants, which does not allow that these expressions have such behavior. Therefore, there is no doubt that Hispanus’ theory of the syncategoremata enriches our still insufficient understanding of the logical constants and contributes to the resolution of the problem of the demarcation of such expressions. (shrink)

True to the spirit of Topoi’s Untimely Reviews section, the present essay is a work of the counterfactual imagination. Suppose that Quine’s “Two Dogmas” had been written and published in the late 1990s rather than the early 1950s. What, in those circumstances, would philosophical commentary look like, especially against the marked developments in Quine’s philosophy in that same period? In short, how would Quine’s “Two Dogmas” stand up as a late 1990s paper rather than an early 1950s paper? Answering that (...) question is my task here. (shrink)

MacColl a été récemment l’objet de trois intéressantes thèses. D’abord, il serait le probable père du pluralisme en logique. Ensuite, son pluralisme porterait un instrumentalisme sous-jacent. Enfin, les deux thèses précédentes expliqueraient l’oubli dans lequel il serait tombé après 1909. Bien qu’il soit à la fois pluraliste et instrumentaliste à certains égards, je suggèrerai qu’il est difficile de trouver dans les écrits de MacColl un pluralisme qui puisse satisfaire les trois thèses précédentes en apparaissant pour la première fois chez MacColl, (...) en trouvant ses sources dans un instrumentalisme adapté à la logique, et en étant l’explication à l’oubli dans lequel était tombé son auteur. (shrink)

MacColl a été récemment l’objet de trois intéressantes thèses. D’abord, il serait le probable père du pluralisme en logique. Ensuite, son pluralisme porterait un instrumentalisme sous-jacent. Enfin, les deux thèses précédentes expliqueraient l’oubli dans lequel il serait tombé après 1909. Bien qu’il soit à la fois pluraliste et instrumentaliste à certains égards, je suggèrerai qu’il est difficile de trouver dans les écrits de MacColl un pluralisme qui puisse satisfaire les trois thèses précédentes en apparaissant pour la première fois chez MacColl, (...) en trouvant ses sources dans un instrumentalisme adapté à la logique, et en étant l’explication à l’oubli dans lequel était tombé son auteur. (shrink)

MacColl a été récemment l’objet de trois intéressantes thèses. D’abord, il serait le probable père du pluralisme en logique. Ensuite, son pluralisme porterait un instrumentalisme sous-jacent. Enfin, les deux thèses précédentes expliqueraient l’oubli dans lequel il serait tombé après 1909. Bien qu’il soit à la fois pluraliste et instrumentaliste à certains égards, je suggèrerai qu’il est difficile de trouver dans les écrits de MacColl un pluralisme qui puisse satisfaire les trois thèses précédentes en apparaissant pour la première fois chez MacColl, (...) en trouvant ses sources dans un instrumentalisme adapté à la logique, et en étant l’explication à l’oubli dans lequel était tombé son auteur. (shrink)

Since at least the 1938 publication of Hans Reichenbach’s Experience and Predication , there has been widespread agreement that, when discussing the beliefs that people have, it is important to distinguish contexts of discovery and contexts of justification. Traditionally, when one conflates the two contexts, the result is a “genetic fallacy”. This paper examines genealogical critiques and addresses the question of whether such critiques are fallacious and, if so, whether this vitiates their usefulness. The paper concludes that while there may (...) be one or more senses in which genealogical critiques are fallacious, this does not vitiate their value. (shrink)

In “Truth by Convention” W.V. Quine gave an influential argument against logical conventionalism. Even today his argument is often taken to decisively refute logical conventionalism. Here I break Quine’s arguments into two— the super-task argument and the regress argument—and argue that while these arguments together refute implausible explicit versions of conventionalism, they cannot be successfully mounted against a more plausible implicit version of conventionalism. Unlike some of his modern followers, Quine himself recognized this, but argued that implicit conventionalism was explanatorily (...) idle. Against this I show that pace Quine’s claim that implicit conventionalism has no content beyond the claim that logic is firmly accepted, implicit rules of inference can be used to distinguish the firmly accepted from the conventional. As part of my case, I argue that positing syntactic rules of inference as part of our linguistic competence follows from the same methodology that leads contemporary linguists and cognitive scientists to posit rules of phonology, morphology, and grammar. The upshot of my discussion is a diagnosis of the fallacy in Quine’s master critique of logical conventionalism and a re-opening of possibilities for an attractive conventionalist theory of logic. (shrink)

This is a purely conceptual paper. It aims at presenting and putting into perspective the idea of a proof-theoretic semantics of the logical operations. The first section briefly surveys various semantic paradigms, and Section 2 focuses on one particular paradigm, namely the proof-theoretic semantics of the logical operations.

Model-theoretic proofs of functional completenes along the lines of [McCullough 1971, Journal of Symbolic Logic 36, 15–20] are given for various constructive modal propositional logics with strong negation.

A theory of definitions which places the eliminability and conservativeness requirements on definitions is usually called the standard theory. We examine a persistent myth which credits this theory to Leśniewski, a Polish logician. After a brief survey of its origins, we show that the myth is highly dubious. First, no place in Leśniewski's published or unpublished work is known where the standard conditions are discussed. Second, Leśniewski's own logical theories allow for creative definitions. Third, Leśniewski's celebrated ‘rules of definition’ lay (...) merely syntactical restrictions on the form of definitions: they do not provide definitions with such meta-theoretical requirements as eliminability or conservativeness. On the positive side, we point out that among the Polish logicians, in the 1920s and 1930s, a study of these meta-theoretical conditions is more readily found in the works of Łukasiewicz and Ajdukiewicz. (shrink)

This paper argues that logical inferentialists should reject multiple-conclusion logics. Logical inferentialism is the position that the meanings of the logical constants are determined by the rules of inference they obey. As such, logical inferentialism requires a proof-theoretic framework within which to operate. However, in order to fulfil its semantic duties, a deductive system has to be suitably connected to our inferential practices. I argue that, contrary to an established tradition, multiple-conclusion systems are ill-suited for this purpose because they fail (...) to provide a 'natural' representation of our ordinary modes of inference. Moreover, the two most plausible attempts at bringing multiple conclusions into line with our ordinary forms of reasoning, the disjunctive reading and the bilateralist denial interpretation, are unacceptable by inferentialist standards. (shrink)

It is argued, on the basis of ideas derived from Wittgenstein's Tractatus and Husserl's Logical Investigations, that the formal comprehends more than the logical. More specifically: that there exist certain formal-ontological constants (part, whole, overlapping, etc.) which do not fall within the province of logic. A two-dimensional directly depicting language is developed for the representation of the constants of formal ontology, and means are provided for the extension of this language to enable the representation of certain materially necessary relations. The (...) paper concludes with a discussion of the relationship between formal logic, formal ontology, and mathematics. (shrink)

The discussions which follow rest on a distinction, first expounded by Husserl, between formal logic and formal ontology. The former concerns itself with (formal) meaning-structures; the latter with formal structures amongst objects and their parts. The paper attempts to show how, when formal ontological considerations are brought into play, contemporary extensionalist theories of part and whole, and above all the mereology of Leniewski, can be generalised to embrace not only relations between concrete objects and object-pieces, but also relations between what (...) we shall call dependent parts or moments. A two-dimensional formal language is canvassed for the resultant ontological theory, a language which owes more to the tradition of Euler, Boole and Venn than to the quantifier-centred languages which have predominated amongst analytic philosophers since the time of Frege and Russell. Analytic philosophical arguments against moments, and against the entire project of a formal ontology, are considered and rejected. The paper concludes with a brief account of some applications of the theory presented. (shrink)

In this paper we elaborate a conception of entailment based on what we call the Ackermann principle, which explicates valid entailment through a logical connection between sentences depending on their informational content. We reconstruct Dunn’s informational semantics for entailment on the basis of Restall’s approach, with assertion and denial as two independent speech acts, by introducing the notion of a ‘position description’. We show how the machinery of position descriptions can effectively be used to define the positive and the negative (...) information carried by sentences of a given language and to present a formalized version of the Ackermann principle as an inclusion relationship between the informational contents of the conclusions and the premises of a valid entailment. Being so interpreted, the entailment relation exhibits certain properties, including the property of transitivity. Whereas properties such as Anderson and Belnap’s variable sharing property or Parry’s proscriptive principle are normally presented as imposing a relevance requirement on valid entailment, the suggested formalization of the Ackermann principle supports all of Gentzen’s structural rules, including weakening, a rule that is normally given up in sequent-style proof systems for relevance logics. In this way we propose an Ackermann-inspired explication of the nature of entailment as a relation between the informational contents of sentences. (shrink)

Cet ouvrage de Pascal Engel doit être fortement recommandé pour plusieurs raisons. On est d'abord frappé par l'ampleur du travail accompli et l'étendue du domaine couvert. La documentation est fouillée, l'exposé est clair et un équilibre est toujours maintenu entre les questions générales et les questions de détail. Engel ne perd jamais de vue la perspective d'ensemble qu'il s'est donnée et qui concerne la nature de la logique, y compris lorsqu'il s'emploie à faire certaines nuances ou à proposer une distinction (...) subtile. Il aurait été facile en pareille matière de proposer un mauvais choix de thèmes. Là encore, Engel s'est bien acquitté de sa tâche. On a affaire à un ouvrage dans lequel l'auteur va toujours droit à l'essentiel. Plusieurs sujets sont à peine effleurés, mais cette décision est très souvent heureuse puisqu'elle permet à l'auteur d'établir des liens entre des problématiques qui, de prime abord, semblent très éloignées les unes des autres. L'auteur fait montre d'un étonnant esprit de synthèse et plusieurs thèmes font, à ma connaissance, une première apparition dans la littérature philosophique francophone. Il s'agit donc d'une contribution à la philosophie de la logique qui mérite d'être signalée. On regrettera peut-être la présence d'un assez grand nombre d'erreurs typographiques. Dans la plupart des cas, il ne s'agit que de coquilles mais, dans d'autres cas, elles risquent de nuire à la compréhension du texte surtout lorsqu'elles interviennent dans des formules ou des définitions. (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.

It is often claimed that nominalistic programmes to reconstruct mathematics fail, since they will at some point involve the notion of logical consequence which is unavailable to the nominalist. In this paper we use an idea of Goodman and Quine to develop a nominalistically acceptable explication of logical consequence.

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)

Since Kaplan : 81–98, 1979) first provided a logic for context-sensitive expressions, it has been thought that the only way to construct a logic for indexicals is to restrict it to arguments which take place in a single context— that is, instantaneous arguments, uttered by a single speaker, in a single place, etc. In this paper, I propose a logic which does away with these restrictions, and thus places arguments where they belong, in real world conversations. The central innovation is (...) that validity depends not just on the sentences in the argument, but also on certain abstract relations between contexts. This enrichment of the notion of logical form leads to some seemingly counter-intuitive results: a sequence of sentences may make up a valid argument in one sequence of contexts, and an invalid one in another such sequence. I argue that this is an unavoidable result of context sensitivity in general, and of the nature of indexicals in particular, and that reflection on such examples will lead us to a better understanding of the idea of applying logic to context sensitive expressions, and thus to natural language in general. (shrink)

The intention here is that of giving a formal underpinning to the idea of 'meaning-is-use' which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett-Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i. e. the so-called reduction rules. For that we suggest an (...) extension to the Curry-Howard interpretation which draws on the idea of labelled deduction, and brings back Frege's device of variable-abstraction to operate on the labels (i. e., proof-terms) alongside formulas of predicate logic. (shrink)

Wittgenstein’s language games can be put into a wider service by virtue of elements they share with some contemporary opinions concerning logic and the semantics of computation. I will give two examples: manifestations of language games and their possible variations in logical studies, and their role in some of the recent developments in computer science. It turns out that the current paradigm of computation that Girard termed Ludics bears a striking resemblance to members of language games. Moreover, the kind of (...) interrelations that are emerging could be scrutinised from the viewpoint of logic that virtually necessitates game-theoretic conceptualisations, demonstrating the fact that the meaning of utterances may, in many situations, be understood as Wittgenstein’s language games of ‘showing or telling what one sees’. This provides motivation for the use of games in relation to logic and formal semantics that some commentators have called for. Many of the ideas can be traced to C.S. Peirce, for whom signs were vehicles of strategic communication. The conclusion about Wittgenstein is that the notions of saying and showing converge in his late philosophy. (shrink)

This paper deals with Popper's little-known work on deductive logic, published between 1947 and 1949. According to his theory of deductive inference, the meaning of logical signs is determined by certain rules derived from ?inferential definitions? of those signs. Although strong arguments have been presented against Popper's claims (e.g. by Curry, Kleene, Lejewski and McKinsey), his theory can be reconstructed when it is viewed primarily as an attempt to demarcate logical from non-logical constants rather than as a semantic foundation for (...) logic. A criterion of logicality is obtained which is based on conjunction, implication and universal quantification as fundamental logical operations. (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)

Doing Worlds with Words throws light on the problem of meaning as the meeting point of linguistics, logic and philosophy, and critically assesses the possibilities and limitations of elucidating the nature of meaning by means of formal logic, model theory and model-theoretical semantics. The main thrust of the book is to show that it is misguided to understand model theory metaphysically and so to try to base formal semantics on something like formal metaphysics; rather, the book states that model theory (...) and similar tools of the analysis of language should be understood as capturing the semantically relevant, especially inferential, structure of language. From this vantage point, the reader gains a new light on many of the traditional concepts and problems of logic and philosophy of language, such as meaning, reference, truth and the nature of formal logic. (shrink)

The perennial question – What is meaning? – receives many answers. In this paper I present and discuss inferentialism – a recent approach to semantics based on the thesis that to have ( such and such ) a meaning is to be governed by ( such and such ) a cluster of inferential rules . I point out that this thesis presupposes that looking for meaning requires seeing language as a social institution (rather than, say, a psychological reality). I also (...) indicate that this approach may be seen as a new embodiment of the old ideas of structuralism. (shrink)

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence relation (...) to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)

I discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. I argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads me to select as a plausible candidate LL, a fragment of linear logic that differs from R in that it rejects both contraction and distribution.

http://dx.doi.org/10.5007/1808-1711.2009v13n3p357 Neste trabalho concorda-se com a tese de I. Hacking segundo a qual o significado das constantes lógicas é dado pelas Regras de Introdução e Eliminação do cálculo de sequentes de Gentzen que caracterizam a concepção da noção de consequência lógica abstrata. Perguntamos quais são as regras mínimas que um conectivo deve satisfazer para que seja considerado uma negação genuína. Tomaremos como referência para tratar dessa questão os C-sistemas de Newton da Costa e o sistema LP de Graham Priest. Finalmente, (...) analisaremos esses sistemas na lógica de sequentes a fim de mostrar que a negação paraconsistente ou bem carece das regras puras de eliminação e negação da negação ou ela envolve outros conectivos, o que torna difícil atribuir um significado unívoco à negação paraconsistente. (shrink)

Two different kinds of multiple-conclusion consequence relations taken from Shoesmith and Smiley and Galatos and Tsinakis or Nowak, called here disjunctive and conjunctive, respectively, defined on a formal language, are considered. They are transferred into a bounded lattice and a complete lattice, respectively. The properties of such abstract consequence relations are presented.

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)

According to logical inferentialists, the meanings of logical expressions are fully determined by the rules for their correct use. Two key proof-theoretic requirements on admissible logical rules, harmony and separability, directly stem from this thesis—requirements, however, that standard single-conclusion and assertion-based formalizations of classical logic provably fail to satisfy :1035–1051, 2011). On the plausible assumption that our logical practice is both single-conclusion and assertion-based, it seemingly follows that classical logic, unlike intuitionistic logic, can’t be accounted for in inferentialist terms. In (...) this paper, I challenge orthodoxy and introduce an assertion-based and single-conclusion formalization of classical propositional logic that is both harmonious and separable. In the framework I propose, classicality emerges as a structural feature of the logic. (shrink)

This article begins by exploring a lost topic in the philosophy of science:the properties of the relations evidence confirming h confirmsh'' and, more generally, evidence confirming each ofh1, h2, ..., hm confirms at least one of h1, h2,ldots;, hn''.The Bayesian understanding of confirmation as positive evidential relevanceis employed throughout. The resulting formal system is, to say the least, oddlybehaved. Some aspects of this odd behaviour the system has in common withsome of the non-classical logics developed in the twentieth century. Oneaspect (...) – its ``parasitism'''' on classical logic – it does not, and it is this featurethat makes the system an interesting focus for discussion of questions in thephilosophy of logic. We gain some purchase on an answer to a recently prominentquestion, namely, what is a logical system? More exactly, we ask whether satisfaction of formal constraints is sufficient for a relation to be considered a (logical) consequence relation. The question whether confirmation transfer yields a logical system is answered in the negative, despite confirmation transfer having the standard properties of a consequence relation, on the grounds that validity of sequents in the system is not determined by the meanings of the connectives that occur in formulas. Developing the system in a different direction, we find it bears on the project of ``proof-theoretic semantics'''': conferring meaning on connectives by means of introduction (and possibly elimination) rules is not an autonomous activity, rather it presupposes a prior, non-formal,notion of consequence. Some historical ramifications are alsoaddressed briefly. (shrink)

I finished my undergraduate degree at Monash University and joined Charles Hamblin’s seminar at the University of NSW in March, 1968. Phil Staines from the University of Newcastle joined at the same time, and Vic Dudman was an established member. Hamblin’s book Fallacies would be published in 1970, but the seminar discussions rarely concerned fallacies. This may have been because Hamblin had been working for so long and so closely with those ideas that he was now ready to turn elsewhere. (...) But I shall argue that the book was only part of a much broader program, other parts of which occupied us in the seminars. Hamblin never explicitly discussed the writing of Fallacies with me, and what follows is an attempt to explain how the book fitted into his overall project as a logician, drawn from his published works and from what I remember of his contributions to the seminar. (shrink)