Perspectives for proof unwinding by programming languages techniques

In this chapter, we propose some future directions of work, potentially beneficial to Mathematics and its foundations, based on the recent import of methodology from the theory of programming languages into proof theory. This scientific essay, written for the audience of proof theorists as well as the working mathematician, is not a survey of the field, but rather a personal view of the author who hopes that it may inspire future and fellow researchers

Logical Pluralism: Where the Conflict Really Lies

Recent years have seen a surge of attention to the problem of logical pluralism; most of which has been a reaction to Beall and Restall’s account of logical pluralism as the existence of more than one equally correct semantic relation of logical consequence. The underlying thesis is that the indeterminacy of the notion of validity goes beyond what the inductive-deductive distinction can precisify. The notion of deductive validity itself is indeterminate as well and this indeterminacy has its roots in the indeterminacy of the more fundamental notion of case. Cases are what make the premisses and the conclusion of an argument true; the most notable example being Tarskian models for classical logic. Deductive validity is the preservation of truth across all cases. This paper argues that unless this account of logical pluralism is supplemented with an argument in favor of the equal legitimacy of the purported cases it becomes merely a semi-controversial exposition of how different logics can be generated

Inferentialism

This article offers an overview of inferential role semantics. We aim to provide a map of the terrain as well as challenging some of the inferentialist’s standard commitments. We begin by introducing inferentialism and placing it into the wider context of contemporary philosophy of language. §2 focuses on what is standardly considered both the most important test case for and the most natural application of inferential role semantics: the case of the logical constants. We discuss some of the (alleged) benefits of logical inferentialism, chiefly with regards to the epistemology of logic, and consider a number of objections. §3 introduces and critically examines the most influential and most fully developed form of global inferentialism: Robert Brandom’s inferentialism about linguistic and conceptual content in general. Finally, in §4 we consider a number of general objections to IRS and consider possible responses on the inferentialist’s behalf

Dialogue Games for Minimal Logic

In this paper, we define a class of dialogue games for Johansson’s minimal logic and prove that it corresponds to the validity of minimal logic. Many authors have stated similar results for intuitionistic and classical logic either with or without actually proving the correspondence. Rahman, Clerbout and Keiff [17] have already specified dialogues for minimal logic; however, they transformed it into Fitch-style natural deduction only. We propose a different specification for minimal logic with the proof of correspondence between the existence of winning strategies for the Proponent in this class of games and the sequent calculus for minimal logic

Abstract Argumentation and Answer Set Programming: Two Faces of Nelson’s Logic

In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson’s constructive logic N4. We do so by formalising, in this logic, two principles that we call noncontradictory inference and strengthened closed world assumption: the first states that no belief can be held based on contradictory evidence while the latter forces both unknown and contradictory evidence to be regarded as false. Using these principles, both logic programming and abstract argumentation frameworks are translated into constructive logic in a modular way and using the object language. Logic programming implication and abstract argumentation supports become, in the translation, a new implication connective following the noncontradictory inference principle. Attacks are then represented by combining this new implication with strong negation. Under consideration in Theory and Practice of Logic Programming (TPLP)

A Curious Dialogical Logic and Its Composition Problem

Dialogue semantics for logic are two-player logic games between a Proponent who puts forward a logical formula φ as valid or true and an Opponent who disputes this. An advantage of the dialogical approach is that it is a uniform framework from which different logics can be obtained through only small variations of the basic rules. We introduce the composition problem for dialogue games as the problem of resolving, for a set S of rules for dialogue games, whether the set of S-dialogically valid formulas is closed under modus ponens. Solving the composition problem is fundamental for the dialogical approach to logic; despite its simplicity, it often requires an indirect solution with the help of significant logical machinery such as cut-elimination. Direct solutions to the composition problem can, however, sometimes be had. As an example, we give a set N of dialogue rules which is well-justified from the dialogical point of view, but whose set N of dialogically valid formulas is both non-trivial and non-standard. We prove that the composition problem for N can be solved directly, and introduce a tableaux system for N

Necessity, a Leibnizian Thesis, and a Dialogical Semantics

In this paper, an interpretation of "necessity", inspired by a Leibnizian idea and based on the method of dialogical logic, is introduced. The semantic rules corresponding to such an account of necessity are developed, and then some peculiarities, and some potential advantages, of the introduced dialogical explanation, in comparison with the customary explanation offered by the possible worlds semantics, are briefly discussed