We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22]. In the present paper a so-called free description theory is examined in the context of different kinds of free logic, including systems applied in computer science and constructive mathematics for dealing with partial functions. It is shown that the same theory in different logics may be formalised by means of different rules and gives results of varying strength. For all presented calculi a constructive cut elimination is provided.

/pdf/free-definite-description-theory-sequent-calculi-and-cut-18o29yx553.pdf

Free Definite Description Theory – Sequent Calculi and Cut Elimination

The paper presents a uniform proof-theoretic treatment of several kinds of free logic, including the logics of existence and definedness applied in constructive mathematics and computer science, and called here quasi-free logics. All free and quasi-free logics considered are formalised in the framework of sequent calculus, the latter for the first time. It is shown that in all cases remarkable simplifications of the starting systems are possible due to the special rule dealing with identity and existence predicate. Cut elimination is proved in a constructive way for sequent calculi adequate for all logics under consideration.

/pdf/free-logics-are-cut-free-1j16uel42l.pdf

Free Logics are Cut-Free

The Collected Papers of Gerhard Gentzen, edited by M. E. Szabo

The goal of this paper is to present a new reconstruction of Aristotle's assertoric logic as he develops it in Prior Analytics, A1-7. This reconstruction will be much closer to Aristotle's original text than other such reconstructions brought forward up to now. To accomplish this, we will not use classical logic, but a novel system developed by Ben-Yami [2014. 'The quantified argument calculus', The Review of Symbolic Logic, 7, 120-46] called 'QUARC'. This system is apt for a more adequate reconstruction since it does not need first-order variables ('x', 'y', ...) on which the usual quantifiers acta feature also not to be found in Aristotle. Further, in the classical reconstruction, there is also need for binary connectives ('boolean AND', '->') that don't have a counterpart in Aristotle. QUARC, again, does not need them either to represent the Aristotelian sentence types. However, the full QUARC is also not called for so that I develop a subsystem thereof ('QUARC(AR)') which closely resembles Aristotle's way of developing his logic. I show that we can prove all of Aristotle's claims within this systems and, lastly, how it relates to classical logic.

Aristotle, Logic, and QUARC

Free logics is a family of first-order logics which came about as a result of examining the existence assumptions of classical logic. What those assumptions are varies, but the central ones are that (i) the domain of interpretation is not empty, (ii) every name denotes exactly one object in the domain and (iii) the quantifiers have existential import. Free logics usually reject the claim that names need to denote in (ii), and of the systems considered in this paper, the positive free logic concedes that some atomic formulas containing non-denoting names (namely self-identity) are true, while negative free logic rejects even the latter claim. Inclusive logics, which reject (i), are likewise considered. These logics have complex and varied axiomatizations and semantics, and the goal of this paper is to present an orderly examination of the various systems and their mutual relations. This is done by first offering a formalization, using sequent calculi which possess all the desired structural properties of a good proof system, including admissibility of contraction and cut, while streamlining free logics in a way no other approach has. We then present a simple and unified system of abstract semantics, which allows for a straightforward demonstration of the meta-theoretical properties, and offers insights into the relationship between different logics (free and classical). The final part of this paper is dedicated to extending the system with modalities by using a labeled sequent calculus, and here we are again able to map out the different approaches and their mutual relations using the same framework.

/pdf/a-more-unified-approach-to-free-logics-3930dswhgj.pdf

A More Unified Approach to Free Logics

This article investigates the proof theory of the Quantified Argument Calculus (Quarc) as developed and systematically studied by Hanoch Ben-Yami [3, 4]. Ben-Yami makes use of natural deduction (Suppes-Lemmon style), we, however, have chosen a sequent calculus presentation, which allows for the proofs of a multitude of significant meta-theoretic results with minor modifications to the Gentzen’s original framework, i.e., LK. As will be made clear in course of the article LK-Quarc will enjoy cut elimination and its corollaries (including subformula property and thus consistency).

/pdf/proof-theoretic-analysis-of-the-quantified-argument-calculus-2y080t7uhx.pdf

Proof-Theoretic Analysis of the Quantified Argument Calculus

Free Logic and the Quantified Argument Calculus

A sequent calculus methodology for systems of agency based on branching-time frames with agents and choices is proposed, starting with a complete and cut-free system for multi-agent deliberative STIT; the methodology allows a transparent justification of the rules, good structural properties, analyticity, direct completeness and decidability proofs.

/pdf/proof-theoretic-analysis-of-the-logics-of-agency-the-4m7crxzujq.pdf

Proof-Theoretic Analysis of the Logics of Agency: The Deliberative STIT

\n The Quantified argument calculus (Quarc) has received a lot of attention recently as an interesting system of quantified logic which eschews the use of variables and unrestricted quantification, but nonetheless achieves results similar to the Predicate calculus (PC) by employing quantifiers applied directly to predicates instead. Despite this noted similarity, the issue of the relationship between Quarc and PC has so far not been definitively resolved. We address this question in the present paper, and then expand upon that result.\n Utilizing recent developments in structural proof theory, we develop a G3-style sequent calculus for Quarc and briefly demonstrate its structural properties. We put these properties to use immediately to construct direct proofs of the meta-theoretical properties of the system. We then incorporate an abstract (and, as we shall see, logical) predicate into the system in a way that preserves all the structural properties. This allows us to identify a system of Quarc which is deductively equivalent to PC, and also yields a constructive method of demonstrating the Craig interpolation theorem (which speaks in favor of the aforementioned predicate being logical). We further generalize this extension to develop a bivalent system of Quarc with defining clauses that still maintains all the desirable properties of a good proof system.

Edi Pavlovic

Papers

Proof-Theoretic Analysis of the Quantified Argument Calculus

A More Unified Approach to Free Logics

Free Logic and the Quantified Argument Calculus

Proof-Theoretic Analysis of the Logics of Agency: The Deliberative STIT

Abstract Forms of Quantification in the Quantified Argument Calculus