Sequent Calculi for Some Strict Implication Logics

We introduce various sequent systems for propositional logicshaving strict implication, and prove the completeness theoremsand the finite model properties of these systems.The cut-eliminationtheorems or the (modified) subformula properties are provedsemantically.     

Natural Deduction for Non-Classical Logics

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.     

Substructural Logics in Natural Deduction

Extensions of Natural Deduction to Substructural Logics of IntuitionisticLogic are shown: Fragments of Intuitionistic Linear, Relevantand BCK Logic. Rules for implication, conjunction, disjunctionand falsum are defined, where conjunction and disjunction respectcontexts of assumptions. So, conjunction and disjunction areadditive in the terminology of linear logic. Explicit contractionand weakening rules are given. It is shown that conversionsand permutations can be adapted to all these rules, and thatweak normalisation and subformula property holds. The resultsgeneralise to quantification.     

Marginalia on Sequent Calculi

The paper discusses the relationship between normal natural deductions and cutfree proofs in Gentzen (sequent) calculi in the absence of term labeling. For Gentzen calculi this is the usual version; for natural deduction this is the version under the complete discharge convention, where open assumptions are always discharged as soon as possible. The paper supplements work by Mints, Pinto, Dyckhoff, and Schwichtenberg on the labeled calculi.     

Falsification-Aware Semantics and Sequent Calculi for Classical Logic

Journal of Philosophical Logic - In this study, falsification-aware semantics and sequent calculi for first-order classical logic are introduced and investigated. These semantics and sequent...     

Sequent Calculi and Decision Procedures for Weak Modal Systems

We investigate sequent calculi for the weak modal (propositional) system reduced to the equivalence rule and extensions of it up to the full Kripke system containing monotonicity, conjunction and necessitation rules. The calculi have cut elimination and we concentrate on the inversion of rules to give in each case an effective procedure which for every sequent either furnishes a proof or a finite countermodel of it. Applications to the cardinality of countermodels, the inversion of rules and the derivability of Löb rules are given.     

通过演绎方式得概称句推理的逻辑

基于[4]中的逻辑系统G,本文通过删减和增加公理及规则给出3个逻辑G0,GD和Gs,同时,我们通过对正常主项选择函数添加不同的条件给出与三个逻辑相应的不同的模型定义。其中,G0是GD和Gs的基础。这些逻辑的给出是为了刻画通过演绎方式得概称句的推理的局部推理。     

Sequent Calculi for $${\mathsf {}}$$

In this paper we are applying certain strategy described by Negri and Von Plato (Bull Symb Log 4(04):418–435, 1998), allowing construction of sequent calculi for axiomatic theories, to Suszko’s Sentential calculus with identity. We describe two calculi obtained in this way, prove that the cut rule, as well as the other structural rules, are admissible in one of them, and we also present an example which suggests that the cut rule is not admissible in the other.     

Sequent Calculi for Semi-De Morgan and De Morgan Algebras

A contraction-free and cut-free sequent calculus \(\mathsf {G3SDM}\) for semi-De Morgan algebras, and a structural-rule-free and single-succedent sequent calculus \(\mathsf {G3DM}\) for De Morgan algebras are developed. The cut rule is admissible in both sequent calculi. Both calculi enjoy the decidability and Craig interpolation. The sequent calculi are applied to prove some embedding theorems: \(\mathsf {G3DM}\) is embedded into \(\mathsf {G3SDM}\) via Gödel–Gentzen translation. \(\mathsf {G3DM}\) is embedded into a sequent calculus for classical propositional logic. \(\mathsf {G3SDM}\) is embedded into the sequent calculus \(\mathsf {G3ip}\) for intuitionistic propositional logic.     

Labeled Calculi and Finite-Valued Logics

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite-valued logic if the labels are interpreted as sets of truth values (sets-as-signs). Furthermore, it is shown that any finite-valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the number of truth values, and it is shown that this bound is tight.     

Cut-Free Tableau Calculi for some Intuitionistic Modal Logics

In this paper we provide cut-free tableau calculi for the intuitionistic modal logics IK, ID, IT, i.e. the intuitionistic analogues of the classical modal systems K, D and T. Further, we analyse the necessity of duplicating formulas to which rules are applied. In order to develop these calculi we extend to the modal case some ideas presented by Miglioli, Moscato and Ornaghi for intuitionistic logic. Specifically, we enlarge the language with the new signs Fc and CR near to the usual signs T and F. In this work we establish the soundness and completeness theorems for these calculi with respect to the Kripke semantics proposed by Fischer Servi.     

Natural Deduction for Dual-intuitionistic Logic

We present a natural deduction system for dual-intuitionistic logic. Its distinctive feature is that it is a single-premise multiple-conclusions system. Its relationships with the natural deduction systems for intuitionistic and classical logic are discussed.     

Semantic Values for Natural Deduction Derivations

Drawing upon Martin-Löf’s semantic framework for his constructive type theory, semantic values are assigned also to natural-deduction derivations, while observing the crucial distinction between (logical) consequence among propositions and inference among judgements. Derivations in Gentzen’s (1934–5) format with derivable formulae dependent upon open assumptions, stand, it is suggested, for proof-objects (of propositions), whereas derivations in Gentzen’s (1936) sequential format are (blue-prints for) proof-acts.     

A Double Deduction System for Quantum Logic Based On Natural Deduction

The author presents a deduction system for Quantum Logic. This system is a combination of a natural deduction system and rules based on the relation of compatibility. This relation is the logical correspondant of the commutativity of observables in Quantum Mechanics or perpendicularity in Hilbert spaces.Contrary to the system proposed by Gibbins and Cutland, the natural deduction part of the system is pure: no algebraic artefact is added. The rules of the system are the rules of Classical Natural Deduction in which is added a control of contexts using the compatibility relation.The author uses his system to prove the following theorem: if propositions of a quantum logical propositional calculus system are mutually compatible, they form a classical subsystem.