This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.

Anti-realism is a doctrine about logic, language, and meaning that is based on the work of Wittgenstein and Frege. In this book, Professor Tennant clarifies and develops Dummett's arguments for anti-realism and ultimately advocates a radical reform of our logical practices.

The principle of semantic compositionality, as Jerry Fodor and Ernie Lepore have emphasized, imposes constraints on theories of meaning that it is hard to meet with psychological or epistemic accounts. Here, I argue that this general tendency is exemplified in Michael Dummett's account of meaning. On that account, the so-called manifestability requirement has the effect that the speaker who understands a sentence s must be able to tell whether or not s satisfies central semantic conditions. This requirement is not met (...) by truth-conditional accounts of meaning. On Dummett's view, it is met by a proof conditional account: understanding amounts to knowledge of what counts as a proof of a sentence. A speaker is supposed always to be capable of deciding whether or not a given object is a proof of a given sentence she understands. This requirement comes into conflict with compositionality. If meaning is compositionally determined, then all you need for understanding a sentence is what you get from combining your understanding of the parts according to the mode of composition. But that knowledge is not always sufficient for recognizing any proof at all of a given sentence. Dummett's proof-theoretic argument to the contrary is mistaken. (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)

The idea of an ?inversion principle?, and the name itself, originated in the work of Paul Lorenzen in the 1950s, as a method to generate new admissible rules within a certain syntactic context. Some fifteen years later, the idea was taken up by Dag Prawitz to devise a strategy of normalization for natural deduction calculi (this being an analogue of Gentzen's cut-elimination theorem for sequent calculi). Later, Prawitz used the inversion principle again, attributing it with a semantic role. Still working (...) in natural deduction calculi, he formulated a general type of schematic introduction rules to be matched ? thanks to the idea supporting the inversion principle ? by a corresponding general schematic Elimination rule. This was an attempt to provide a solution to the problem suggested by the often quoted note of Gentzen. According to Gentzen ?it should be possible to display the elimination rules as unique functions of the corresponding introduction rules on the basis of certain requirements?. Many people have since worked on this topic, which can be appropriately seen as the birthplace of what are now referred to as ?general elimination rules?, recently studied thoroughly by Sara Negri and Jan von Plato. In this study, we retrace the main threads of this chapter of proof-theoretical investigation, using Lorenzen's original framework as a general guide. (shrink)

Logicism is, roughly speaking, the doctrine that mathematics is fancy logic. So getting clear about the nature of logic is a necessary step in an assessment of logicism. Logic is the study of logical concepts, how they are expressed in languages, their semantic values, and the relationships between these things and the rest of our concepts, linguistic expressions, and their semantic values. A logical concept is what can be expressed by a logical constant in a language. So the question “What (...) is logic?” drives us to the question “What is a logical constant?” Though what follows contains some argument, limitations of space constrain me in large part to express my Credo on this topic with the broad brush of bold assertion and some promissory gestures. (shrink)

Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such systems from logic (...) to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated. (shrink)

We investigate introduction and elimination rules for truth-functional connectives, focusing on the general questions of the existence, for a given connective, of at least one such rule that it satisfies, and the uniqueness of a connective with respect to the set of all of them. The answers are straightforward in the context of rules using general set/set sequents of formulae, but rather complex and asymmetric in the restricted (but more often used) context of set/formula sequents, as also in the intermediate (...) set/formula-or-empty context. (shrink)

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)

The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results about intuitionistic propositional logic that bear on that perspective, and discuss their significance.

The notion of harmony has played a pivotal role in a number of debates in the philosophy of logic. Yet there is little agreement as to how the requirement of harmony should be spelled out in detail or even what purpose it is to serve. Most, if not all, conceptions of harmony can already be found in Michael Dummett's seminal discussion of the matter in The Logical Basis of Metaphysics. Hence, if we wish to gain a better understanding of the (...) notion of harmony, we do well to start here. Unfortunately, however, Dummett's discussion is not always easy to follow. The following is an attempt to disentangle the main strands of Dummett's treatment of harmony. The different variants of harmony as well as their interrelations are clarified and their individual shortcomings qua interpretations of harmony are demonstrated. Though no attempt is made to give a detailed alternative account of harmony here, it is hoped that our discussion will lay the ground for an adequate rigorous treatment of this central notion. (shrink)

The framework of natural deduction is extended by permitting rules as assumptions which may be discharged in the course of a derivation. this leads to the concept of rules of higher levels and to a general schema for introduction and elimination rules for arbitrary n-ary sentential operators. with respect to this schema, (functional) completeness "or", "if..then" and absurdity is proved.