Dave Ripley has recently argued against the plausibility of multiset consequence relations and of contraction-free approaches to paradox. For Ripley, who endorses a nontransitive theory, the best arguments that buttress transitivity also push for contraction—whence it is wiser for the substructural logician to go nontransitive from the start. One of Ripley’s allegations is especially insidious, since it assumes the form of a trivialisation result: it is shown that if a multiset consequence relation can be associated to a closure operator in (...) the expected way, then it necessarily contracts. We counter Ripley’s objection by presenting an approach to multiset consequence that escapes this trap. This approach is multiple-conclusioned in a heterodox way, for multiple succedents are given a conjunctive, rather than a disjunctive reading. Finally, we address a further objection by French and Ripley to the effect that the informational interpretation of sequents in linear logic does not motivate cut. (shrink)

I discuss Greg Restall’s attempt to generate an account of logical consequence from the incoherence of certain packages of assertions and denials. I take up his justification of the cut rule and argue that, in order to avoid counterexamples to cut, he needs, at least, to introduce a notion of logical form. I then suggest a few problems that will arise for his account if a notion of logical form is assumed. I close by sketching what I take to be (...) the most natural minimal way of distinguishing content and form and suggest further problems arising for this route. (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)

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)

I discuss Greg Restall’s attempt to generate an account of logical consequence from the incoherence of certain packages of assertions and denials. I take up his justification of the cut rule and argue that, in order to avoid counterexamples to cut, he needs, at least, to introduce a notion of logical form. I then suggest a few problems that will arise for his account if a notion of logical form is assumed. I close by sketching what I take to be (...) the most natural minimal way of distinguishing content and form and suggest further problems arising for this route. (shrink)

I argue that we can and should extend Tarski's model-theoretic criterion of logicality to cover indefinite expressions like Hilbert's ɛ operator, Russell's indefinite description operator η, and abstraction operators like 'the number of'. I draw on this extension to discuss the logical status of both abstraction operators and abstraction principles.

The Linda paradox is a key topic in current debates on the rationality of human reasoning and its limitations. We present a novel analysis of this paradox, based on the notion of verisimilitude as studied in the philosophy of science. The comparison with an alternative analysis based on probabilistic confirmation suggests how to overcome some problems of our account by introducing an adequately defined notion of verisimilitudinarian confirmation.

What is a logical constant? The question is addressed in the tradition of Tarski's definition of logical operations as operations which are invariant under permutation. The paper introduces a general setting in which invariance criteria for logical operations can be compared and argues for invariance under potential isomorphism as the most natural characterization of logical operations.

This is a lightly edited version of my comments on Brandom’s Lecture 2, as delivered in Prague at the “Prague Locke Lectures” in April, 2007. I try to say why Brandom’s proposed demarcation is significant, by placing it in a broader context of demarcation proposals from Kant to the twentieth century. I then raise some questions about the basic ingredients of Brandom’s demarcation—the notions of PP-sufficiency and VP-sufficiency—and question whether the vocabulary of conditionals, Brandom’s paradigm for logical vocabulary, can be (...) universal-LX. (shrink)

This chapter focuses on alternative logics. It discusses a hierarchy of logical reform. It presents case studies that illustrate particular aspects of the logical revisionism discussed in the chapter. The first case study is of intuitionistic logic. The second case study turns to quantum logic, a system proposed on empirical grounds as a resolution of the antinomies of quantum mechanics. The third case study is concerned with systems of relevance logic, which have been the subject of an especially detailed reform (...) program. Finally, the fourth case study is paraconsistent logic, perhaps the most controversial of serious proposals. (shrink)

The paper starts with an examination and critique of Tarski’s wellknown proposed explication of the notion of logical operation in the type structure over a given domain of individuals as one which is invariant with respect to arbitrary permutations of the domain. The class of such operations has been characterized by McGee as exactly those definable in the language L∞,∞. Also characterized similarly is a natural generalization of Tarski’s thesis, due to Sher, in terms of bijections between domains. My main (...) objections are that on the one hand, the Tarski-Sher thesis thus assimilates logic to mathematics, and on the other hand fails to explain the notion of same logical operation across domains of different sizes. A new notion of homomorphism invariant operation over functional type structures (with domains M0 of individuals and {T, F} at their base) is introduced to accomplish the latter. The main result is that an operation is definable from.. (shrink)

Logic is usually thought to concern itself only with features that sentences and arguments possess in virtue of their logical structures or forms. The logical form of a sentence or argument is determined by its syntactic or semantic structure and by the placement of certain expressions called “logical constants.”[1] Thus, for example, the sentences Every boy loves some girl. and Some boy loves every girl. are thought to differ in logical form, even though they share a common syntactic and semantic (...) structure, because they differ in the placement of the logical constants “every” and “some”. By contrast, the sentences Every girl loves some boy. and Every boy loves some girl. are thought to have the same logical form, because “girl” and “boy” are not logical constants. Thus, in order to settle questions about logical form, and ultimately about which arguments are logically valid and which sentences logically true, we must distinguish the “logical constants” of a language from its nonlogical expressions. (shrink)

We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterize B positively: reflection, symmetry and visibility. A logical constant obeys to the principle of reflection if it is characterized semantically by an equation binding it with (...) a metalinguistic link between assertions, and if its syntactic inference rules are obtained by solving that equation. All connectives of basic logic satisfy reflection. To the control of weakening and contraction of linear logic, basic logic adds a strict control of contexts, by requiring that all active formulae in all rules are isolated, that is visible. From visibility, cut-elimination follows. The full, geometric symmetry of basic logic induces known symmetries of its extensions, and adds a symmetry among them, producing the structure of a cube. (shrink)

In a famous and controversial paper, B. H. Slater has argued against the possibility of paraconsistent logics. Our reply is centred on the distinction between two aspects of the meaning of a logical constant *c* in a given logic: its operational meaning, given by the operational rules for *c* in a cut-free sequent calculus for the logic at issue, and its global meaning, specified by the sequents containing *c* which can be proved in the same calculus. Subsequently, we use the (...) same strategy to counter Quine's meaning variance argument against deviant logics. In a nutshell, we claim that genuine rivalry between (similar) logics *L* and *L'* is possible whenever each constant in *L* has the same operational meaning as its counterpart in *L'* although differences in global meaning arise in at least one case. (shrink)

Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz's, based on reduction to cut-free form in sequent systems, but he also suggested understanding identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally (...) the rules involved in them they yield the same premises and conclusions up to a renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it did not fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to low-dimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic. (shrink)

Up to now theories of semantic information have implicitly relied on logical monism, or the view that there is one true logic. The latter position has been explicitly challenged by logical pluralists. Adopting an unbiased attitude in the philosophy of information, we take a suggestion from Beall and Restall at heart and exploit logical pluralism to recognise another kind of pluralism. The latter is called informational pluralism, a thesis whose implications for a theory of semantic information we explore.

In this autobiographical sketch, which is followed by a bibliography of my writings, I try to relate my intellectual development to problems, ideas and results in proof-theoretic semantics on which I have worked and to which I have contributed.

The contributions to this volume represent a broad range of aspects of proof-theoretic semantics. Some do so in the narrower, and some in the wider sense of the term. Some deal with issues I have been concerned with directly, and some tackle further problems. All of them open interesting new perspectives and develop the field in different directions. I will briefly comment on the significance of each contribution here.

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)

The past decades have seen remarkable progress in the study of substructural logics, be it mathematically or philosophically oriented. This progress has a somewhat perplexing effect: the more subst...

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)

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)

What is the relation of logic to thinking? My dissertation offers a new argument for the claim that logic is constitutive of thinking in the following sense: representational activity counts as thinking only if it manifests sensitivity to logical rules. In short, thinking has to be minimally logical. An account of thinking has to allow for our freedom to question or revise our commitments – even seemingly obvious conceptual connections – without loss of understanding. This freedom, I argue, requires that (...) thinkers have general abilities to respond to support and tension among their thoughts. And these abilities are constituted by following logical rules. So thinkers have to follow logical rules. But there isn’t just one correct logic for thinking. I show that my view is consistent with logical pluralism: there are a range of correct logics, any one of which a thinker might follow. A logic for thinking does, however, have to contain certain minimal principles: Modus Ponens and Non-Contradiction, and perhaps others. We follow logical rules by exercising logical capacities, which display a distinctive first-person/third-person asymmetry: a subject can find the instances of a rule compelling without seeing them as instances of a rule. As a result, there are two limits on illogical thinking. First, thinkers have to tend to find instances of logical rules compelling. Second, thinkers can’t think in obviously illogical ways. So thinking has to be logical – but not perfectly so. When we try to think, but fail, we produce nonsense. But our failures to think are often subjectively indistinguishable from thinking. To explain how this occurs, I offer an account of nonsense. To be under the illusion that some nonsense makes sense is to enter a pretence that the nonsense is meaningful. Our use of nonsense within the pretence relies on the role of logical form in understanding. Finally, while the normativity of logic doesn’t fall directly out of logical constitutivism, it’s possible to build an attractive account of logical normativity which has logical constitutivism as an integral part. I argue that thinking is necessary for human flourishing, and that this is the source of logical normativity. (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)

Invariance criteria are widely accepted as a means to demarcate the logical vocabulary of a language. In previous work, I proposed a framework of “semantic constraints” for model theoretic consequence which does not rely on a strict distinction between logical and nonlogical terms, but rather on a range of constraints on models restricting the interpretations of terms in the language in different ways. In this paper I show how invariance criteria can be generalized so as to apply to semantic constraints (...) on models. Some obviously unpalatable semantic constraints turn out to be invariant under isomorphisms. I shall connect our discussion to known counterexamples to invariance criteria for logical terms, and so the generalization will also shed light on the current existing debate on logicality. I analyse the failure of invariance to fulfil its role as a criterion for logicality, and argue that invariance conditions should best be thought of as merely methodological meta-constraints restricting the ways the model-theoretic apparatus should be used. (shrink)

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.

A new type of formalization of classical first-order logic with equality is introduced on the basis of the sequent calculus. It serves to justify the claim that equality is a logical constant characterised by well-behaved rules satisfying properties usually regarded as essential. The main feature of this approach is the application of sequents built not only from formulae but also from terms. Two variants of sequent calculus are examined, a structural and a logical one. The former is defined in accordance (...) with Dos̆en’s criteria for logical constants. The latter is a standard Gentzen’s sequent calculus and satisfies Hacking’s criteria for logicality, including cut elimination. It is also shown that provided rules are harmonious in the sense advocated by Gratzl and Orlandelli. (shrink)

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)

Logical pluralism as a thesis that more than one logic is correct seems very plausible for two basic reasons. First, there are so many logical systems on the market today. And it is unclear how we should decide which of them gets the logical rules right. On the other hand, logical monism as the opposite thesis still seems plausible, as well, because of normativity of logic. An approach which would manage to bring a synthesis of both logical pluralism and logical (...) monism is called for. I review the possible forms of logical pluralism and render them more plausible. I thus arrive at logical dynamism, a synthesis of various pluralisms and monism focused on how logic develops. (shrink)

The logic of assertive graphs is a modification of Peirce’s logic of existential graphs, 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 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)

Work on the nature and scope of formal logic has focused unduly on the distinction between logical and extra-logical vocabulary; which argument forms a logical theory countenances depends not only on its stock of logical terms, but also on its range of grammatical categories and modes of composition. Furthermore, there is a sense in which logical terms are unnecessary. Alexandra Zinke has recently pointed out that propositional logic can be done without logical terms. By defining a logical-term-free language with the (...) full expressive power of first-order logic with identity, I show that this is true of logic more generally. Furthermore, having, in a logical theory, non-trivial valid forms that do not involve logical terms is not merely a technical possibility. As the case of adverbs shows, issues about the range of argument forms logic should countenance can quite naturally arise in such a way that they do not turn on whether we countenance certain terms as logical. (shrink)

Kooi and Tamminga's correspondence analysis is a technique for designing proof systems, mostly, natural deduction and sequent systems. In this paper it is used to generate sequent calculi with invertible rules, whose only branching rule is the rule of cut. The calculi pertain to classical propositional logic and any of its fragments that may be obtained from adding a set of rules characterizing a two-argument Boolean function to the negation fragment of classical propositional logic. The properties of soundness and completeness (...) of the calculi are demonstrated. The proof of completeness is conducted by Kalmár's method. Most of the presented sequent-calculus rules have been obtained automatically, by a rule-generating algorithm implemented in Python. Correctness of the algorithm is demonstrated. This automated approach allowed us to analyse thousands of possible rules' schemes, hundreds of rules corresponding to Boolean functions, and to nd dozens of those invertible. Interestingly, the analysis revealed that the presented proof-theoretic framework provides a syntactic characteristics of such an important semantic property as functional completeness. (shrink)

Starting from a proof-theoretic perspective, where meaning is determined by the inference rules governing logical operators, in this paper we primarily aim at developing a proof-theoretic alternative to the model-theoretic meaning-invariant logical pluralism discussed in Beall and Restall. We will also outline how this framework can be easily extended to include a form of meaning-variant logical pluralism. In this respect, the framework developed in this paper—which we label two-level proof-theoretic pluralism—is much broader in scope than the one discussed in Beall (...) and Restall’s book. (shrink)

Arguments, the story goes, have one or more premises and only one conclusion. A contentious generalisation allows arguments with several disjunctively connected conclusions. Contentious as this generalisation may be, I will argue nevertheless that it is justified. My main claim is that multiple conclusions are epiphenomena of the logical connectives: some connectives determine, in a certain sense, multiple-conclusion derivations. Therefore, such derivations are completely natural and can safely be used in proof-theoretic semantics.

This paper deals with the question of the logicality of modal logics from a proof-theoretic perspective. It is argued that if Dos̆en’s analysis of logical constants as punctuation marks is embraced, it is possible to show that all the modalities in the cube of normal modal logics are indeed logical constants. It will be proved that the display calculus for each displayable modality admits a purely structural presentation based on double-line rules which, following Dos̆en’s analysis, allows us to claim that (...) the corresponding modal operators are logical constants. (shrink)

This paper concentrates on how to capture harmony in sequent calculi. It starts by considering a proposal made by Tennant and some objections to it which have been presented by Steinberger. Then it proposes a different analysis which makes use of a double-line presentation of sequent calculi in the style of Dosen and it shows that this proposal is able to dismiss disharmonious operators without thereby adopting any global criterion.

In the recent literature on proof-theoretic semantics, there is mention of a generality condition on defining rules. According to this condition, the schematic formulation of the defining rules must be maximally general, in the sense that no restrictions should be placed on the contexts of these rules. In particular, context variables must always be present in the schematic rules and they should range over arbitrary collections of formulae. I argue against imposing such a condition, by showing that it has undesirable (...) results and that it is ill-supported by the arguments brought in its favour. (shrink)

Various attempts at demarcating logic were undertaken, many of them based on specific understanding of how logical knowledge is formal and not material. MacFarlane has persuasively shown that general idea of formality of logic can be understood in various ways. I take two of the accounts of formality, namely the requirement of conservativity and the requirement of schematicity of logical vocabulary, into consideration as promising candidates to make the all too unclear notion of formality more precise and study to what (...) degree they could be considered as either necessary or sufficient conditions for logicality of some piece of vocabulary. Finding both notion unsatisfactory, as they stand, I propose combining them and envisage a hierarchy of logicality of expressions of a given language. Such a hierarchy is complicated and not linear, yet still offers a valuable explication of both the range and pragmatic significance of logic, if we combine it with logical expressivism. (shrink)

We introduce a sequent calculusBfor a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic. quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterizeBpositively: reflection, symmetry and visibility.A logical constant obeys to the principle of reflection if it is characterized semantically by an equation binding it with a metalinguistic link between assertions, (...) and if its syntactic inference rules are obtained by solving that equation. All connectives of basic logic satisfy reflection.To the control of weakening and contraction of linear logic, basic logic adds a strict control of contexts, by requiring that all active formulae in all rules are isolated, that is visible. From visibility, cut-elimination follows. The full, geometric symmetry of basic logic induces known symmetries of its extensions, and adds a symmetry among them, producing the structure of a cube. (shrink)

La classification des systèmes philosophiques de Jules Vuillemin fonde les relations entre science et philosophie en éliminant la possibilité d’une philosophie scientifique. Elle éclaire la pratique de la philosophie, en explicitant les choix possibles tout en rejetant le relativisme. Elle se fonde sur ce que Vuillemin appelle une sémiologie générale, qui convoque toutefois l’analyse logique. L’article propose une ébauche d’analyse structurale de la déduction permettant de fonder la classification sur des moyens exclusivement logiques.

A logical constant is weakly disharmonious if its elimination rules are weaker than its introduction rules. Substructural weak disharmony is the weak disharmony generated by structural restrictions on the eliminations. I argue that substructural weak disharmony is not a defect of the constants which exhibit it. To the extent that it is problematic, it calls into question the structural properties of the derivability relation. This prompts us to rethink the issue of controlling the structural properties of a logic by means (...) of harmony. I argue that such a control is possible and desirable. Moreover, it is best achieved by global tests of harmony. (shrink)

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

In standard model theory, deductions are not the things one models. But in general proof theory, in particular in categorial proof theory, one finds models of deductions, and the purpose here is to motivate a simple example of such models. This will be a model of deductions performed within an abstract context, where we do not have any particular logical constant, but something underlying all logical constants. In this context, deductions are represented by arrows in categories involved in a general (...) adjoint situation. To motivate the notion of adjointness, one of the central notions of category theory, and of mathematics in general, it is first considered how some features of it occur in set-theoretical axioms and in the axioms of the lambda calculus. Next, it is explained how this notion arises in the context of deduction, where it characterizes logical constants. It is shown also how the categorial point of view suggests an analysis of propositional identity. The problem of propositional identity, i.e., the problem of identity of meaning for propositions, is no doubt a philosophical problem, but the spirit of the analysis proposed here will be rather mathematical. Finally, it is considered whether models of deductions can pretend to be a semantics. This question, which as so many questions having to do with meaning brings us to that wall that blocked linguists and philosophers during the whole of the twentieth century, is merely posed. At the very end, there is the example of a geometrical model of adjunction. Without pretending that it is a semantics, it is hoped that this model may prove illuminating and useful. (shrink)

Dans cet article, j'analyse le problème des significations des constantes logiques. Ces significations sont-elles fixées conventionnellement comme le suggèrent Carnap et Wittgenstein, ou bien doivent-elles s'imposer à tous et ne pas dépendre de décisions préalables? Après avoir examiné le conventionnalisme de Wittgenstein et Carnap et l'anti-conventionnalisme de Peacocke selon lequel les sens des constantes logiques reposent sur des conceptions implicites, je montre que les deux thèses sont également critiquables. La première ne résiste pas à l'incohérence du connecteur « tonk », (...) inventé par Prior, dont les règles montrent que la convention ne peut pas déterminer à elle seule les significations des constantes logiques, la deuxième ne tient pas assez compte des divergences importantes entre les logiques. En me basant sur différents systèmes logiques, je présente de nouveaux arguments pour défendre une position intermédiaire selon laquelle chaque constante logique se déploie en diverses variantes qui forment un spectre allant de la version la plus forte à la version la plus faible. Dans ce cadre, le concept de décision joue un rôle en logique, mais les décisions sont prises en amont, en fonction de certaines conceptions touchant la vérité, la déduction et les critères de logicité adoptés par les logiciens, et tiennent compte des intuitions fondamentales liéesà chaque constante. (shrink)

Dans cet article, j'analyse le problème des significations des constantes logiques. Ces significations sont-elles fixées conventionnellement comme le suggèrent Carnap et Wittgenstein, ou bien doivent-elles s'imposer à tous et ne pas dépendre de décisions préalables ? Après avoir examiné le conventionnalisme de Wittgenstein et Carnap et l'anti-conventionnalisme de Peacocke selon lequel les sens des constantes logiques reposent sur des conceptions implicites, je montre que les deux thèses sont également critiquables. La première ne résiste pas à l'incohérence du connecteur « tonk (...) », inventé par Prior, dont les règles montrent que la convention ne peut pas déterminer à elle seule les significations des constantes logiques, la deuxième ne tient pas assez compte des divergences importantes entre les logiques. En me basant sur différents systèmes logiques, je présente de nouveaux arguments pour défendre une position intermédiaire selon laquelle chaque constante logique se déploie en diverses variantes qui forment un spectre allant de la version la plus forte à la version la plus faible. Dans ce cadre, le concept de décision joue un rôle en logique, mais les décisions sont prises en amont, en fonction de certaines conceptions touchant la vérité, la déduction et les critères de logicité adoptés par les logiciens, et tiennent compte des intuitions fondamentales liéesà chaque constante. (shrink)

The paper is a brief survey of some sequent calculi which do not follow strictly the shape of sequent calculus introduced by Gentzen. We propose the following rough classification of all SC: Systems which are based on some deviations from the ordinary notion of a sequent are called generalised; remaining ones are called ordinary. Among the latter we distinguish three types according to the proportion between the number of primitive sequents and rules. In particular, in one of these types, called (...) Gentzen’s type, we have a subtype of standard SC due to Gentzen. Hence by nonstandard ones we mean all these ordinary SC where other kinds of rules are applied than those admitted in standard Gentzen’s sequent calculi. We describe briefly some of the most interesting or important nonstandard SC belonging to the three abovementioned types. (shrink)

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.

According to the realist, the meaning of a declarative, non-indexical sentence is the condition under which it is true and the truth-condition of an undecidable sentence can obtain or fail to obtain independently of our capacity, even in principle, to recognize that it obtains or that fails to do so.1 In a series of papers, beginning with “Truth” in 1959, Michael Dummett challenged the position that the classical notion of truth-condition occupied as the central notion of a theory of meaning, (...) and proposed that it should be replaced by the anti-realist (and intuitionistic) notion of assertability-condition. Taken together with normalization results obtained by Dag Prawitz, Dummett’s work truly opened up the anti-realist challenge at the level of proof-theoretical semantics.2 There has been since numerous rejoinders from partisans of classical logic, which were at times met with by attempts at watering down the anti-realist challenge, e.g., by arguing that anti-realism does not necessarily entail the adoption of intuitionistic logic. Only a few anti-realists, such as Crispin Wright and Neil Tennant, tried to look instead in the other direction, towards a more radical version of anti-realism which would entail deeper revisions of classical logic than those recommended by intuitionists.3 In this paper, which is largely programmatic, we shall also argue in favour of a radical anti-realism which would be a genuine alternative to the traditional anti-realism of Dummett and Prawitz. The debate about anti-realism has by now more or less run out of breath and we wish to provide it with a new lease on life, by taking into account the profound changes that took place in proof theory during the intervening years. We have in mind in particular the considerable development within Gentzen-style proof theory of non-classical, substructural logics other than intuitionistic logic, which seriously opens up the possibility that anti-realism, when properly understood, might end up justifying another logic, and the development of closer links between proof theory and computational complexity theory that has renewed interest in a radical form of anti-realism, namely strict finitism. (shrink)