Displaying similar documents to “Empirical Negation, Co-Negation and the Contraposition Rule II: Proof-Theoretical Investigations”

Empirical Negation, Co-negation and Contraposition Rule I: Semantical Investigations

Satoru Niki (2020)

Bulletin of the Section of Logic

Similarity:

We investigate the relationship between M. De's empirical negation in Kripke and Beth Semantics. It turns out empirical negation, as well as co-negation, corresponds to different logics under different semantics. We then establish the relationship between logics related to these negations under unified syntax and semantics based on R. Sylvan's CCω.

A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs

George Tourlakis (2016)

Bulletin of the Section of Logic

Similarity:

Reference [12] introduced a novel formula to formula translation tool (“formula-tors”) that enables syntactic metatheoretical investigations of first-order modallogics, bypassing a need to convert them first into Gentzen style logics in order torely on cut elimination and the subformula property. In fact, the formulator tool,as was already demonstrated in loc. cit., is applicable even to the metatheoreticalstudy of logics such as QGL, where cut elimination is (provably, [2]) unavailable....

Super-strict Implications

Guido Gherardi, Eugenio Orlandelli (2021)

Bulletin of the Section of Logic

Similarity:

This paper introduces the logics of super-strict implications, where a super-strict implication is a strengthening of C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication. The semantics of super-strict implications is obtained by strengthening the (normal) relational semantics for strict implication. We consider all logics of super-strict implications that are based on relational frames for modal logics in the...

A Modified Subformula Property for the Modal Logic S4.2

Mitio Takano (2019)

Bulletin of the Section of Logic

Similarity:

The modal logic S4.2 is S4 with the additional axiom ◊□A ⊃ □◊A. In this article, the sequent calculus GS4.2 for this logic is presented, and by imposing an appropriate restriction on the application of the cut-rule, it is shown that, every GS4.2-provable sequent S has a GS4.2-proof such that every formula occurring in it is either a subformula of some formula in S, or the formula □¬□B or ¬□B, where □B occurs in the scope of some occurrence of □ in some formula of S. These are just the...

Involutive Nonassociative Lambek Calculus: Sequent Systems and Complexity

Wojciech Buszkowski (2017)

Bulletin of the Section of Logic

Similarity:

In [5] we study Nonassociative Lambek Calculus (NL) augmented with De Morgan negation, satisfying the double negation and contraposition laws. This logic, introduced by de Grooté and Lamarche [10], is called Classical Non-Associative Lambek Calculus (CNL). Here we study a weaker logic InNL, i.e. NL with two involutive negations. We present a one-sided sequent system for InNL, admitting cut elimination. We also prove that InNL is PTIME.

An Alternative Natural Deduction for the Intuitionistic Propositional Logic

Mirjana Ilić (2016)

Bulletin of the Section of Logic

Similarity:

A natural deduction system NI, for the full propositional intuitionistic logic, is proposed. The operational rules of NI are obtained by the translation from Gentzen’s calculus LJ and the normalization is proved, via translations from sequent calculus derivations to natural deduction derivations and back.

The Method of Socratic Proofs Meets Correspondence Analysis

Dorota Leszczyńska-Jasion, Yaroslav Petrukhin, Vasilyi Shangin (2019)

Bulletin of the Section of Logic

Similarity:

The goal of this paper is to propose correspondence analysis as a technique for generating the so-called erotetic (i.e. pertaining to the logic of questions) calculi which constitute the method of Socratic proofs by Andrzej Wiśniewski. As we explain in the paper, in order to successfully design an erotetic calculus one needs invertible sequent-calculus-style rules. For this reason, the proposed correspondence analysis resulting in invertible rules can constitute a new foundation for...

Grzegorczyk’s Logics. Part I

Taneli Huuskonen (2015)

Formalized Mathematics

Similarity:

This article is the second in a series formalizing some results in my joint work with Prof. Joanna Golinska-Pilarek ([9] and [10]) concerning a logic proposed by Prof. Andrzej Grzegorczyk ([11]). This part presents the syntax and axioms of Grzegorczyk’s Logic of Descriptions (LD) as originally proposed by him, as well as some theorems not depending on any semantic constructions. There are both some clear similarities and fundamental differences between LD and the non-Fregean logics introduced...

Axiomatization of a Basic Logic of Logical Bilattices

Mitio Takano (2016)

Bulletin of the Section of Logic

Similarity:

A sequential axiomatization is given for the 16-valued logic that has been proposed by Shramko-Wansing (J Philos Logic 34:121–153, 2005) as a candidate for the basic logic of logical bilattices.

Intuitionistic logic considered as an extension of classical logic : some critical remarks

Javier Legris, Jorge A. Molina (2001)

Philosophia Scientiae

Similarity:

In this paper we analyze the consideration of intuitionistic logic as an extension of classical logic. This — at first sight surprising — point of view has been sustained explicitly by Jan Łukasiewicz on the basis of a mapping of classical propositional logic into intuitionistic propositional logic by Kurt Gödel in 1933. Simultaneously with Gödel, Gerhard Gentzen had proposed another mapping of Peano´s arithmetic into Heyting´s arithmetic. We shall discuss these mappings in connection...

New Modification of the Subformula Property for a Modal Logic

Mitio Takano (2020)

Bulletin of the Section of Logic

Similarity:

A modified subformula property for the modal logic KD with the additionalaxiom □ ◊(A ∨ B) ⊃ □ ◊ A ∨ □ ◊B is shown. A new modification of the notion of subformula is proposed for this purpose. This modification forms a natural extension of our former one on which modified subformula property for the modal logics K5, K5D and S4.2 has been shown ([2] and [4]). The finite model property as well as decidability for the logic follows from this.

An Investigation into Intuitionistic Logic with Identity

Szymon Chlebowski, Dorota Leszczyńska-Jasion (2019)

Bulletin of the Section of Logic

Similarity:

We define Kripke semantics for propositional intuitionistic logic with Suszko’s identity (ISCI). We propose sequent calculus for ISCI along with cut-elimination theorem. We sketch a constructive interpretation of Suszko’s propositional identity connective.

Labeled Sequent Calculus for Orthologic

Tomoaki Kawano (2018)

Bulletin of the Section of Logic

Similarity:

Orthologic (OL) is non-classical logic and has been studied as a part of quantumlogic. OL is based on an ortholattice and is also called minimal quantum logic. Sequent calculus is used as a tool for proof in logic and has been examinedfor several decades. Although there are many studies on sequent calculus forOL, these sequent calculi have some problems. In particular, they do not includeimplication connective and they are mostly incompatible with the cut-eliminationtheorem. In this...

Logics that are both paraconsistent and paracomplete

Newton C.A. da Costa (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

The Author describes new systems of logic (called "nonalethic") which are both paraconsistent and paracomplete. These systems are connected with the logic of vagueness and with certain philosophical problems (e.g. with some aspects of Hegel's logic).