The informal logic movement began as an attempt to develop – and teach – an alternative logic which can account for the real life arguing that surrounds us in our daily lives – in newspapers and the popular media, political and social commentary, advertising, and interpersonal exchange. The movement was rooted in research and discussion in Canada and especially at the University of Windsor, and has become a branch of argumentation theory which intersects with related traditions and approaches (notably formal (...) logic, rhetoric and dialectics in the form of pragma-dialectics). In this volume, some of the best known contributors to the movement discuss their views and the reasoning and argument which is informal logic’s subject matter. Many themes and issues are explored in a way that will fuel the continued evolution of the field. Federico Puppo adds an insightful essay which considers the origins and development of informal logic and whether informal logicians are properly described as a “school” of thought. In considering that proposition, Puppo introduces readers to a diverse range of essays, some of them previously published, others written specifically for this volume. (shrink)

This paper provides finitary jointly necessary and sufficient acceptance and rejection conditions for the logical constants of a first order quantificational language. By introducing the notion of making an assignment as a distinct object level practice—something you do with a sentence—(as opposed to a meta-level semantic notion) and combining this with the practice of (hypothetical and categorical) acceptance and rejection and the practice of making suppositions one gains a structure that is sufficiently rich to fully characterize the class of classical (...) first order theories. The analysis thus provides a way of characterizing classical first order quantification by expressivist means. (shrink)

Philosophers are divided on whether the proof- or truth-theoretic approach to logic is more fruitful. The paper demonstrates the considerable explanatory power of a truth-based approach to logic by showing that and how it can provide (i) an explanatory characterization —both semantic and proof-theoretical—of logical inference, (ii) an explanatory criterion for logical constants and operators, (iii) an explanatory account of logic’s role (function) in knowledge, as well as explanations of (iv) the characteristic features of logic —formality, strong modal force, generality, (...) topic neutrality, basicness, and (quasi-)apriority, (v) the veridicality of logic and its applicability to science, (v) the normativity of logic, (vi) error, revision, and expansion in/of logic, and (vii) the relation between logic and mathematics. The high explanatory power of the truth-theoretic approach does not rule out an equal or even higher explanatory power of the proof-theoretic approach. But to the extent that the truth-theoretic approach is shown to be highly explanatory, it sets a standard for other approaches to logic, including the proof-theoretic approach. (shrink)

Simon Evnine examines various epistemic aspects of what it is to be a person. Persons are defined as finite beings that have beliefs, including second-order beliefs about their own and others' beliefs, and are agents, capable of making long-term plans. It is argued that for any being meeting these conditions, a number of epistemic consequences obtain. First, all such beings must have certain logical concepts and be able to use them in certain ways. Secondly, there are at least two principles (...) governing belief that it is rational for persons to satisfy and are such that nothing can be a person at all unless it satisfies them to a large extent. These principles are that one believe the conjunction of one's beliefs and that one treat one's future beliefs as, by and large, better than one's current beliefs. Thirdly, persons both occupy epistemic points of view on the world and show up within those views. This makes it impossible for them to be completely objective about their own beliefs. Ideals of rationality that require such objectivity, while not necessarily wrong, are intrinsically problematic for persons. This "aspectual dualism" is characteristic of treatments of persons in the Kantian tradition. In sum, these epistemic consequences support a traditional view of the nature of persons, one in opposition to much recent theorizing. (shrink)

On the Dummettian understanding, anti-realism regarding a particular discourse amounts to (or at the very least, involves) a refusal to accept the determinacy of the subject matter of that discourse and a corresponding refusal to assert at least some instances of excluded middle (which can be understood as expressing this determinacy of subject matter). In short: one is an anti-realist about a discourse if and only if one accepts intuitionistic logic as correct for that discourse. On careful examination, the strongest (...) Dummettian arguments for anti-realism of this sort fail to secure intuitionistic logic as the single, correct logic for anti-realist discourses. Instead, antirealists are placed in a situation where they fail to be justified in asserting monism (that intuitionistic logic is the unique correct logic). Thus, antirealists seem forced either to accept pluralism (i.e. one or more intermediate logic is at least as `correct’ as intuitionistic logic–an option I take to be unattractive from the anti-realist perspective), or they must be anti-realists about the realism/anti-realism debate (and, in particular, must refuse to assert the instance of excluded middle equivalent to logical monism or logical pluralism). (shrink)

The principle of tolerance characteristic of vague predicates is sometimes presented as a soft rule, namely as a default which we can use in ordinary reasoning, but which requires care in order to avoid paradoxes. We focus on two ways in which the tolerance principle can be modeled in that spirit, using special consequence relations. The first approach relates tolerant reasoning to nontransitive reasoning; the second relates tolerant reasoning to nonmonotonic reasoning. We compare the two approaches and examine three specific (...) consequence relations in relation to those, which we call: strict-to-tolerant entailment, pragmatic-to-tolerant entailment, and pragmatic-to-pragmatic entailment. The first two are nontransitive, whereas the latter two are nonmonotonic. (shrink)

In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external logic and (...) argue that while ST+’s nonclassicality can be granted, its self-dual character does not tie it to LP+ more closely than to K3+. (shrink)

This paper presents a semantical analysis of the Weak Kleene Logics Kw3 and PWK from the tradition of Bochvar and Halldén. These are three-valued logics in which a formula takes the third value if at least one of its components does. The paper establishes two main results: a characterisation result for the relation of logical con- sequence in PWK – that is, we individuate necessary and sufficient conditions for a set.

We present a construction of a truth class (an interpretation of a compositional truth predicate) in an arbitrary countable recursively saturated model of first-order arithmetic. The construction is fully classical in that it employs nothing more than the classical techniques of formal proof theory.

Suszko’s problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two truth values. Malinowski showed that this number can equal three if some of Tarski’s structural constraints are relaxed. By so doing, Malinowski introduced a case of so-called mixed consequence, allowing the notion of a designated value to vary between the premises and the conclusions of an argument. (...) In this article we give a more systematic perspective on Suszko’s problem and on mixed consequence. First, we prove general representation theorems relating structural properties of a consequence relation to their semantic interpretation, uncovering the semantic counterpart of substitution-invariance, and establishing that mixed consequence is fundamentally the semantic counterpart of the structural property of monotonicity. We use those theorems to derive maximum-rank results proved recently in a different setting by French and Ripley, as well as by Blasio, Marcos, and Wansing, for logics with various structural properties. We strengthen these results into exact rank results for nonpermeable logics. We discuss the underlying notion of rank, and the associated reduction proposed independently by Scott and Suszko. As emphasized by Suszko, that reduction fails to preserve compositionality in general, meaning that the resulting semantics is no longer truth-functional. We propose a modification of that notion of reduction, allowing us to prove that over compact logics with what we call regular connectives, rank results are maintained even if we request the preservation of truth-functionality and additional semantic properties. (shrink)

Given a consequence relation in many-valued logic, what connectives can be defined? For instance, does there always exist a conditional operator internalizing the consequence relation, and which form should it take? In this paper, we pose this question in a multi-premise multi-conclusion setting for the class of so-called intersective mixed consequence relations, which extends the class of Tarskian relations. Using computer-aided methods, we answer extensively for 3-valued and 4-valued logics, focusing not only on conditional operators, but also on what we (...) call Gentzen-regular connectives. For arbitrary N-valued logics, we state necessary and sufficient conditions for the existence of such connectives in a multi-premise multi-conclusion setting. The results show that mixed consequence relations admit all classical connectives, and among them pure consequence relations are those that admit no other Gentzen-regular connectives. Conditionals can also be found for a broader class of intersective mixed consequence relations, but with the exclusion of order-theoretic consequence relations. (shrink)

Proof-theoretic semantics is an inferentialist theory of meaning, usually developed in a multiple-assumption and single-conclusion framework. In that framework, this theory seems unable to justify classical logic, so some authors have proposed a multiple-conclusion reformulation to accomplish this goal. In the first part of this paper, the debate originated by this proposal is briefly exposed and used to defend the diverging opinion that proof-theoretic semantics should always endorse a single-assumption and single-conclusion framework. In order to adopt this approach some of (...) its _criteria_ of validity, especially separability, need to be weakened. This choice is evaluated and defended. The main argument in this direction is based on the circular dependences of meaning between multiple assumptions and conjunctions, and between multiple conclusions and disjunctions. In the second part of this paper, some systems that suit the new requirements are proposed for both intuitionistic and classical logic. A proof that they are valid, according to the weakened _criteria_, is sketched. (shrink)

ellucci, C., Existential instantiation and normalization in sequent natural deduction, Annals of Pure and Applied Logic 58 111–148. A sequent conclusion natural deduction system is introduced in which classical logic is treated per se, not as a special case of intuitionistic logic. The system includes an existential instantiation rule and involves restrictions on the discharge rules. Contrary to the standard formula conclusion natural deduction systems for classical logic, its normal derivations satisfy both the subformula property and the separation property and (...) allow to establish a version of the midsequent theorem and Herbrand's theorem. (shrink)

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express metalogical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the logics of formal inconsistency and by the logics of formal undeterminedness. LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the validity of (...) the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core—in the case studied here, this common core is classical positive propositional logic. The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of LFI and undeterminedness, namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion one at a time. The last sections offer an algebraic account for such logics by adapting the swap structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite nondeterministic matrices. (shrink)

From the technical point of view, philosophically neutral, the duality between a paraconsistent and a paracomplete logic lies in the fact that explosion does not hold in the former and excluded middle does not hold in the latter. From the point of view of the motivations for rejecting explosion and excluded middle, this duality can be interpreted either ontologically or epistemically. An ontological interpretation of intuitionistic logic is Brouwer’s idealism; of paraconsistency is dialetheism. The epistemic interpretation of intuitionistic logic is (...) in terms of preservation of constructive proof; of paraconsistency is in terms of preservation of evidence. In this paper, we explain and defend the epistemic approach to paraconsistency. We argue that it is more plausible than dialetheism and allows a peaceful and fruitful coexistence with classical logic. (shrink)

The purpose of this paper is to present a paraconsistent formal system and a corresponding intended interpretation according to which true contradictions are not tolerated. Contradictions are, instead, epistemically understood as conflicting evidence, where evidence for a proposition A is understood as reasons for believing that A is true. The paper defines a paraconsistent and paracomplete natural deduction system, called the Basic Logic of Evidence, and extends it to the Logic of Evidence and Truth. The latter is a logic of (...) formal inconsistency and undeterminedness that is able to express not only preservation of evidence but also preservation of truth. LETj is anti-dialetheist in the sense that, according to the intuitive interpretation proposed here, its consequence relation is trivial in the presence of any true contradiction. Adequate semantics and a decision method are presented for both BLE and LETj, as well as some technical results that fit the intended interpretation. (shrink)

It is argued that truth value of a sentence containing free variables in a context of use, just as the reference of the free variables concerned, depends on the assumptions and posits given by the context. However, context may under-determine the reference of a free variable and the truth value of sentences in which it occurs. It is argued that in such cases a free variable has indeterminate reference and a sentence in which it occurs may have indeterminate truth value. (...) On letting, say, x be such that \, the sentence ‘Either \ or \’ is true but the sentence ‘\’ has an indeterminate truth value: it is determinate that the variable x refers to either 2 or \, but it is indeterminate which of the two it refers to, as a result ‘\’ has a truth value but its truth value is indeterminate. The semantic indeterminacy is analysed in a ‘radically’ supervaluational semantic framework closely analogous to the treatment of vagueness in McGee and McLaughlin and Smith, which saves bivalence, the T-schema and the truth-functional analysis of the boolean connectives. It is shown that on such an analysis the modality ‘determinately’ is quite clearly not an epistemic modality, avoiding a potential objection raised by Williamson against such ‘radically’ supervaluational treatments of vagueness, and that determinate truth is the semantic value preserved in classically valid arguments. The analysis is contrasted with the epistemicist proposal of Breckenridge and Magidor which implies that ‘\’ has a determinate but unknowable truth value. (shrink)

The connectives of classical propositional logic are given an analysis in terms of necessary and sufficient conditions of acceptance and rejection, i.e. the connectives are analyzed within an expressivist bilateral meaning-is-use framework. It is explained how such a framework differs from standard inferentialist frameworks and it is argued that it is better suited to address the particular issues raised by the expressivist thesis that the meaning of a sentence is determined by the mental state that it is conventionally used to (...) express. Furthermore, it is shown that the classical requirements governing the connectives completely characterize classical logic, are conservative and separable, are in bilateral harmony, are structurally preservative with respect to the classical coordination requirements and resolve the categoricity problem. These results are taken to show that one can give an expressivist bilateral meaning-is-use analysis of the connectives that confer on them a determinate coherent classical interpretation. (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)

A hybrid logic is obtained by adding to an ordinary modal logic further expressive power in the form of a second sort of propositional symbols called nominals and by adding so-called satisfaction operators. In this paper we consider hybridized versions of S5 (“the logic of everywhere”) and the modal logic of inequality (“the logic of elsewhere”). We give natural deduction systems for the logics and we prove functional completeness results.

This is a companion paper to Braüner where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geometric theories. We prove soundness and completeness and we prove a normalisation theorem. Moreover, we give an axiom system first-order hybrid logic.

The main aim of the present paper is to use a proof system for hybrid modal logic to formalize what are called false-belief tasks in cognitive psychology, thereby investigating the interplay between cognition and logical reasoning about belief. We consider two different versions of the Smarties task, involving respectively a shift of perspective to another person and to another time. Our formalizations disclose that despite this difference, the two versions of the Smarties task have exactly the same underlying logical structure. (...) We also consider the Sally-Anne task, having a more complicated logical structure, presupposing a “principle of inertia” saying that a belief is preserved over time, unless there is belief to the contrary. (shrink)

The fixed point combinator (Y) is an important non-proper combinator, which is defhable from a combinatorially complete base. This combinator guarantees that recursive equations have a solution. Structurally free logics (LC) turn combinators into formulas and replace structural rules by combinatory ones. This paper introduces the fixed point and the dual fixed point combinator into structurally free logics. The admissibility of (multiple) cut in the resulting calculus is not provable by a simple adaptation of the similar proof for LC with (...) proper combinators. The novelty of our proof—beyond proving the cut for a newly extended calculus–is that we add a fourth induction to the by-and-large Gentzen-style proof. (shrink)

This paper briefly overviews some of the results and research directions. In the area of substructural logics from the last couple of decades. Substructural logics are understood here to include relevance logics, linear logic, variants of Lambek calculi and some other logics that are motivated by the idea of omitting some structural rules or making other structural changes in LK, the original sequent calculus for classical logic.

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large families of non-classical logics such as modal, relevance, and intuitionistic logics. Our approach is modular and supports uniform proofs of soundness, completeness and (...) proof normalization. We have implemented our work in the Isabelle Logical Framework. (shrink)

Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an (...) improved account of quantificational binding, weak crossover, wh-questions, superiority, and polarity licensing. (shrink)

Hypersequents are finite sets of ordinary sequents. We show that multiple-conclusion sequents and single-conclusion hypersequents represent two different natural methods of switching from a single-conclusion calculus to a multiple-conclusion one. The use of multiple-conclusion sequents corresponds to using a multiplicative disjunction, while the use of single-conclusion hypersequents corresponds to using an additive one. Moreover: each of the two methods is usually based on a different natural semantic idea and accordingly leads to a different class of algebraic structures. In the cases (...) we consider here the use of multiple-conclusion sequents corresponds to focusing the attention on structures in which there is a full symmetry between the sets of designated and antidesignated elements. The use of single-conclusion hypersequents, on the other hand, corresponds to the use of structures in which all elements except one are designated. Not surprisingly, the use of multiple-conclusion hypersequents corresponds to the use of structures which are both symmetrical and with a single nondesignated element. (shrink)

We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks between arguments are represented by sequent elimination rules, and deductions are made according to Dung-style skeptical or credulous semantics. This framework accommodates different languages and logics in which arguments may be represented, allows for a flexible and simple way of expressing and identifying arguments, supports a variety of attack relations, and is faithful to standard methods of drawing conclusions (...) by argumentation frameworks. Altogether, we show that argumentation theory may benefit from incorporating proof theoretical techniques and that different non-classical formalisms may be used for backing up intended argumentation semantics. (shrink)

Many mathematicians and philosophers of mathematics believe some proofs contain elements extraneous to what is being proved. In this paper I discuss extraneousness generally, and then consider a specific proposal for measuring extraneousness syntactically. This specific proposal uses Gentzen's cut-elimination theorem. I argue that the proposal fails, and that we should be skeptical about the usefulness of syntactic extraneousness measures.

This paper offers the Boolean many-valued solution to the Sorites Paradox. According to the precisification-based Boolean many-valued theory, from which this solution arises, sentences have not only two truth values, truth (or 1) and falsity (or 0), but many Boolean values between 0 and 1. The Boolean value of a sentence is identified with the set of precisifications in which the sentence is true. Unlike degrees fuzzy logic assigns to sentences, Boolean many values are not linearly but only partially ordered; (...) so there are values that are incomparable. Despite this fact, the sentences in a sorites series can be taken as having values in a linear order, and losing (or gaining) value as we move from sentence to sentence in the series. So there is no sharp borderline between 0 and 1. Assigning Boolean many values instead of the two truth values to sentences for their vagueness values is analogous to assigning propositions instead of the truth values to sentences for their semantic values, as propositions are, from our viewpoint, also Boolean many values. (shrink)

The Boolean many-valued approach to vagueness is similar to the infinite-valued approach embraced by fuzzy logic in the respect in which both approaches seek to solve the problems of vagueness by assigning to the relevant sentences many values between falsity and truth, but while the fuzzy-logic approach postulates linearly-ordered values between 0 and 1, the Boolean approach assigns to sentences values in a many-element complete Boolean algebra. On the modal-precisificational approach represented by Kit Fine, if a sentence is indeterminate in (...) truth value in some world, it is taken to be true in one precisified world accessible from that world and false in another. This paper points to a way to unify these two approaches to vagueness by showing that Fine’s version of the modal-precisificational approach can be combined with the Boolean many-valued approach instead of supervaluationism, one of the most popular approaches to vagueness. (shrink)

Hypotheticals, conditionals, and their connecting relation, implication, dramatically changed their meanings during the nineteenth and early part of the twentieth century. Modern logicians ordinarily do not distinguish between the terms hypothetical and conditional. Yet in the late nineteenth century their meanings were quite different, their ties to the implication relation either were unclear, or the implication relation was used exclusively as a logical operator. I will trace the development of implication as an inference operator from these earlier notions into the (...) first third of the twentieth century using as the starting point the ideas primarily of R. Whately and W. Hamilton before discussing the work of the transitional logicians, A. De Morgan and G. Boole on these topics. Then we discuss the relevant views of four prominent but relatively unknown nineteenth century British logicians, W.E. Johnson, J.N. Keynes, E.E.C. Jones, and H. MacColl, as well as those of the more influential logicians, W.S. Jevons and J. Venn, closing with a section on ‘implication as inference’ where we explore some key ideas of B. Russell and sketch the work of D. Hilbert, P. Hertz, and G. Gentzen who together are responsible for the development of the modern ideas related to the subjects of this paper. (shrink)

Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working with (...) semantic generalizations – are addressed. Finally, I’ll introduce the case studies that I’ll be dealing with in part II. Chapter 2 is concerned with the origins and development of Jaśkowski’s discussive logic. The main idea of this chapter is to systematize the various stages of the development of discussive logic related researches from two different angles, i.e., its connections to modal logics and its proof theory, by highlighting virtues and vices. Chapter 3 focuses on the Gentzen-style proof theory of discussive logic, by providing a characterization of it in terms of labelled sequent calculi. Chapter 4 deals with the Gentzen-style proof theory of relevant logics, again by employing the methodology of labelled sequent calculi. This time, instead of working with a single logic, I’ll deal with a whole family of them. More precisely, I’ll study in terms of proof systems those relevant logics that can be characterised, at the semantic level, by reduced Routley-Meyer models, i.e., relational structures with a ternary relation between states and a unique base element. Chapter 5 investigates the proof theory of a modal expansion of intuitionistic propositional logic obtained by adding an ‘actuality’ operator to the connectives. This logic was introduced also using Gentzen sequents. Unfortunately, the original proof system is not cut-free. This chapter shows how to solve this problem by moving to hypersequents. Chapter 6 concludes the investigations and discusses the future of the research presented throughout the dissertation. (shrink)

I characterize the deductivist ideal of justification and, following to a great extent Toulmin’s work The Uses of Argument, I try to explain why this ideal is erroneous. Then I offer an alternative model of justification capable of making our claims to knowledge about substantial matters sound and reasonable. This model of justification will be based on a conception of justification as the result of good argumentation, and on a model of argumentation which is a pragmatic linguistic reconstruction of Toulmin’s (...) model of argument. (shrink)

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)

Since 1993, when Hudelmaier developed an O(n log n)-space decision procedure for propositional Intuitionistic Logic, a lot of work has been done to improve the efficiency of the related proof-search algorithms. In this paper a tableau calculus using the signs T, F and Fc with a new set of rules to treat signed formulas of the kind T((A → B) → C) is provided. The main feature of the calculus is the reduction of both the non-determinism in proof-search and the (...) width of proofs with respect to Hudelmaier's one. These improvements have a significant influence on the performances of the implementation. (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)

This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order (...) rules, as opposed to higher-order connectives, and a paper discussing the application of natural deduction rules to dealing with equality in predicate calculus. The volume continues with a key chapter summarizing work on the extension of the Curry-Howard isomorphism, via methods of category theory that have been successfully applied to linear logic, as well as many other contributions from highly regarded authorities. With an illustrious group of contributors addressing a wealth of topics and applications, this volume is a valuable addition to the libraries of academics in the multiple disciplines whose development has been given added scope by the methodologies supplied by natural deduction. The volume is representative of the rich and varied directions that Prawitz work has inspired in the area of natural deduction. (shrink)

The relation between ex falso and disjunctive syllogism, or even the justification of ex falso based on disjunctive syllogism, is an old topic in the history of logic. This old topic reappears in contemporary logic since the introduction of minimal logic by Johansson. The disjunctive syllogism seems to be part of our general non-problematic inferential practices and superficially it does not seem to be related to or to depend on our acceptance of the frequently disputable ex falso rule. We know (...) that the acceptance of the ex falso is a sufficient condition for the acceptance of the disjunctive syllogism, but the interesting question is: is the ex falso a necessary condition for the acceptance of the disjunctive syllogism? The aim of the present paper is to discuss some possible ways to define systems that combines the preservation of the disjunctive syllogism with the rejection of the ex falso. (shrink)

Gentzen’s sequent calculi LK and LJ are landmark proof systems. They identify the structural rules of weakening and contraction as notable inference rules, and they allow for an elegant statement and proof of both cut elimination and consistency for classical and intuitionistic logics. Among the undesirable features of those sequent calculi is that their inferences rules are low-level and frequently permute over each other. As a result, large-scale structures within sequent calculus proofs are hard to identify. In this paper, we (...) present a different approach to designing a sequent calculus for classical logic. Starting with Gentzen’s LK proof system, we examine the proof search meaning of his inference rules and classify those rules as involving either don’t care nondeterminism or don’t know nondeterminism. Based on that classification, we design the focused proof system LKF in which inference rules belong to one of two phases of proof construction depending on which flavor of nondeterminism they involve. We then prove that the cut rule and the general form of the initial rule are admissible in LKF. Finally, by showing that the inference rules for LK are all admissible in LKF, we can give a relative completeness proof for LKF provability with respect to LK provability. We shall also apply these properties of the LKF proof system to establish other meta-theoretic properties of classical logic, including Herbrand’s theorem. (shrink)