A GENTZEN SYSTEM EQUIVALENT TO THE BCK-LOGIC
|
|
- Roxanne Phoebe Anderson
- 5 years ago
- Views:
Transcription
1 Romà J. Adillon Ventura Verdú A GENTZEN SYSTEM EQUIVALENT TO THE BCK-LOGIC Abstract The sequent calculus L BCK is obtained by deleting the contraction rule and the introduction rules of the connectives of meet, join and negation from the sequent calculus for the Intuitionistic Propositional logic, LJ. In this paper we show that the Gentzen system G BCK, naturally associated with L BCK, is equivalent to the Hilbert-style logic BCK, in the sense that G BCK and BCK are interpretable one another, the interpretations being essentially inverse in each other. This result is a strengthening of the one obtained by H. Ono and Y. Komori [8], which concerned only the derivable sequents of L BCK and the theorems of BCK. We obtain, as a corollary of this result, that the quasivariety of BCKalgebras is the equivalent quasivariety semantics of G BCK in the sense of [10]. Let L be the propositional language with a single binary connective,. The logic BCK ( L, BCK, for short) is the 1-dimensional deductive system over L defined by the axioms: (B) (X Y ) ((Y Z) (X Z)) (C) (X (Y Z)) (Y (X Z)) (K) X (Y X) and the modus ponens rule: {X, X Y }, Y, where X, Y, Z F m L. Recall that it is well known that the following formulas are theorems of BCK: (I) (X Y ) ((Z X) (Z Y )) (II) (X 1 (..(X n Y )..)) ((Y Z) (X 1 (..(X n Z)..))), where X 1,..., X n, X, Y, Z F m L. Recall that the quasivariety BCK is the class of algebras of type {2} which satisfy the following equations and quasiequation: (1) (X Y ) ((Y Z) (X Z)) = X X (2) X ((X Y ) Y ) = X X 0 Work partially supported by grant PB from the Spanish DGICYT 73
2 (3) Y (X X) = X X (4) X Y = X X Y X = X X X = Y, where X, Y, Z F m L. It is known that the BCK is not a variety [11]. Next we introduce a Gentzen system G BCK, and we will show in Theorem 7 that it is equivalent to the deductive system BCK. Definition 1. Let L= { } and let Γ, Π be finite sequences of L-formulas and ϕ, ψ, ξ L-formulas. The sequent calculus L BCK is defined by the following axiom and rules: ϕ ϕ (Axiom) Γ ϕ ϕ, Π ξ Γ, Π ξ Γ, ϕ, ψ, Π ξ Γ, ψ, ϕ, Π ξ (cut) (e ) Γ ξ Γ, ϕ ξ (w ) Γ ϕ ψ, Π ξ ϕ ψ, Γ, Π ξ ( ) Γ, ϕ ψ Γ ϕ ψ ( ) This sequent calculus was studied by H. Ono and Y. Komori [8]. They proved the cut elimination theorem and that this sequent calculus is logically equivalent to the BCK-logic, that is, for any formula γ 1,.., γ n, ϕ, the sequent γ 1,.., γ n ϕ is derivable in L BCK if and only if γ 1 (.. (γ n ϕ)..) is a theorem of the BCK-logic. The sequent calculus L BCK allows us to define the consequence relation LBCK on the set of sequents in the following way: Let T be a set of sequents and Γ ϕ a sequent, then T LBCK Γ ϕ iff there is a finite sequence of sequents Γ 0 ϕ 0,..., Γ n 1 ϕ n 1 (which is called a proof of Γ ϕ from T ) such that Γ n 1 ϕ n 1 = Γ ϕ and for each i < n one of the following conditions holds: (i) Γ i ϕ i is an instance of the axiom; (ii) Γ i ϕ i T ; (iii) Γ i ϕ i is obtained from {Γ j ϕ j : j < i} by using a rule of L BCK. 74
3 We define the Gentzen system G BCK as the pair L, LBCK. Definition 2. Let Γ be a finite sequence of L-formulas and ϕ an L- formula. We define a (0, 1)-deductive system S GBCK = L, SGBCK associated to G BCK as the deductive system given by: Γ SGBCK ϕ { γ : γ Γ} LBCK ϕ. Theorem 3. Let τ and ρ be the translations from G BCK to S GBCK and from S GBCK to G BCK respectively, defined by: { p0 (p τ (m,1) (p 0,..., p m 1 q 0 ) = 1 (... (p m 1 q 0 )...)) if m 0 q 0 if m = 0 ρ(p 0 ) = { p 0 }. Then we have: (i) {Γ i γ i : i I} LBCK Γ γ {τ (Γ i γ i ) : i I} SGBCK τ (Γ γ). (ii) ϕ SGBCK τρ(ϕ). Proof. (a) It is easy to check property (i) by using that every sequent is equivalent, modulo G BCK, to a sequent with the empty sequence on the left of the turnstyle. (b) It is easy to check property (ii) by using the definitions of τ and ρ. According to the definition of equivalence between systems given by J. Rebagliato and V. Verdú [10], the theorem shows that this (0, 1)-deductive system S GBCK is equivalent to the Gentzen system G BCK. Now we will show that SGBCK = BCK. To prove this equality we will use the following lemmas. Lemma 4. Let τ be the translation of L-sequents in L-formulas defined in Theorem 3. Then for every rule of L BCK, { j δ j :j 2} δ, we have {τ ( j δ j ) : j 2} BCK τ ( δ) 75
4 Proof. We distinguish cases: Cut rule: we have to show that {τ (Γ ϕ), τ (ϕ, Π ξ)} BCK τ (Γ, Π ξ) (cuth). If Γ = we have to show that {ϕ, ϕ τ (Π ξ)} BCK τ (Π ξ). By using modus ponens, the result follows. If Γ = {γ 1,..., γ n } then τ (Γ, Π ξ) = γ 1 (... (γ n τ (Π ξ))...), τ (ϕ, Π ξ) = ϕ τ (Π ξ), and τ (Γ ϕ) = γ 1 (... (γ n ϕ)...). By applying the property (II) of BCK, we obtain BCK τ (Γ ϕ) (τ (ϕ, Π ξ) τ (Γ, Π ξ)). Now by applying modus ponens {τ (Γ ϕ), τ (ϕ, Π ξ)} BCK τ (Γ, Π ξ). Exchange rule: we have to show that τ (Γ, ϕ, ψ, Π ξ) BCK τ (Γ, ψ, ϕ, Π ξ) (eh). If Γ =, then by using (C) we have: BCK τ(ϕ, ψ, τ(π ξ)) τ(ψ, ϕ, τ(π ξ)) and applying modus ponens, the result follows. If Γ, then from the last expression, the property (I) and modus ponens we obtain τ (Γ, ϕ, ψ, Π ξ) BCK τ (Γ, ψ, ϕ, Π ξ). Weakening rule: we have to show that {τ (Γ ξ)} BCK τ (Γ, ϕ ξ) (wh). If Γ =, then by using (K) we have: BCK ξ (ϕ ξ) and by applying modus ponens, we obtain {τ ( ξ)} BCK τ (ϕ ξ). If Γ, then from the last expression and property (I) we obtain {τ (Γ ξ)} BCK τ (Γ, ϕ ξ). Left introduction rule for : we have to show that {τ (Γ ϕ), τ (ψ, Π ξ)} BCK τ (ϕ ψ, Γ, Π ξ) ( H). From property (I) we have: BCK (ψ τ(π ξ)) ((ϕ ψ) (ϕ τ(π ξ))) and by applying modus ponens, we obtain τ (ψ, Π ξ) BCK τ (ϕ ψ, ϕ, Π ξ). Now by using (eh) we obtain τ (ψ, Π ξ) BCK τ (ϕ, ϕ ψ, Π ξ) and by applying (cuth): {τ (Γ ϕ), τ (ϕ, ϕ ψ, Π ξ)} BCK τ (Γ, ϕ ψ, Π ξ), we obtain {τ (Γ ϕ), τ (ψ, Π ξ)} BCK τ (Γ, ϕ ψ, Π ξ). By using (eh), the result ( H) follows. Right introduction rule for : we have to show that {τ (Γ, ϕ ψ)} BCK τ (Γ ϕ ψ) (H ). And this is true from the definition of τ. 76
5 Lemma 5. Let τ be the translation of L-sequents in L-formulas defined in Theorem 3 and let Σ i, Σ be finite sequences of L-formulas and σ i, σ L-formulas, then {Σ i σ i : i I} LBCK Σ σ {τ (Σ i σ i ) : i I} BCK τ (Σ σ) Proof. We use induction on the length of the proof. n = 1 i. If Σ σ is any of Σ i σ i then it is evident. ii. If Σ σ is the axiom, then we have to prove that BCK τ (ϕ ϕ), that is, BCK ϕ ϕ, and this is true in BCK. n > 1 If Σ σ is obtained by applying a rule { j δ j : j 2} Σ σ of L BCK, then using induction hypothesis we have {τ (Σ i σ i ) : i I} BCK τ ( j δ j ) for all j 2 and applying Lemma 4 we obtain {τ (Σ i σ i ) : i I} BCK τ (Σ σ). Now we are ready to prove the equality mentioned above. Theorem 6. SGBCK = BCK. Proof. ): Suppose Γ BCK ξ. We will prove that Γ SGBCK ξ by induction on the length of the proof. n = 1 i. If ξ Γ then it is trivial. ii. If ξ is an instance of three axioms called B, C and K, then by [7, corollary 2.8.] we obtain that LBCK ξ, and applying the definition of S GBCK we obtain SGBCK ξ, so Γ SGBCK ξ. n > 1 If ξ is obtained by modus ponens from the previous formulas ψ and ψ ξ, we have by the induction hypothesis Γ SGBCK ψ and Γ SGBCK ψ ξ. Finally, from {ψ, ψ ξ} SGBCK ξ, we obtain Γ SGBCK ξ. ): We suppose that Γ SGBCK ξ, that is, { γ : γ Γ} LBCK ξ, then using Lemma 5 we have {τ ( γ) : γ Γ} BCK τ ( ξ), so Γ BCK ξ. Now we are ready to prove the main result of this paper. 77
6 Theorem 7. G BCK and BCK are equivalent, that is, the translations τ from G BCK to BCK and ρ from BCK to G BCK defined in Theorem 3 satisfy the following properties: (i) {Γ i γ i : i I} LBCK Γ γ {τ (Γ i γ i ) : i I} BCK τ (Γ γ). (ii) ϕ BCK τρ(ϕ). Proof. It is straightforward to check these properties from Theorems 3 and 6. Corollary 8. G BCK is algebraizable with equivalent quasivariety semantics BCK, with the translations τ from G BCK in BCK and ρ from BCK in G BCK defined by: { p0 (.. (p τ (m,1) (p 0,.., p m 1 q 0 ) = m 1 q 0 )..) q 0 q 0 if m 0 q 0 q 0 q 0 if m = 0 ρ(p 0 p 1 ) = {p 0 p 1, p 1 p 0 }. Proof. It follows from the theorem and the fact that the quasivariety BCK is an equivalent algebraic semantics of BCK, with defining equation X = X X and equivalence formulas {X Y, Y X} (see [3, theorem 5.11]). Corollary 9. G BCK does not have the deduction-detachment theorem (DDT). Proof. Suppose that G BCK has the DDT. Then, as G BCK is equivalent to BCK, it is easy to see that BCK has the DDT, contradicting the already known fact [4, example 7.3] that BCK does not have the DDT. G BCK has the following local deduction-detachment the- Corollary 10. orem (LDDT) T ; (Γ ϕ) LBCK Π ξ T LBCK E i (τ (Γ ϕ), τ (Π ξ)) for some i < ω, where E i (τ (Γ ϕ), τ (Π ξ)) = τ (Γ ϕ),..., τ (Γ ϕ) τ (Π ξ). }{{} i Proof. It is easy to see from the theorem and the fact that BCK has the LDDT [6, example 2.1], that G BCK has this LDDT. 78
7 References [1] R. J. Adillon and V. Verdú, Sistema de Gentzen algebrizables para las lógicas de Lambek, Girard, Relevancia y BCK, [in:] E. Bustos, J. Echeverría, E. Pérez Sedeño, M. I. Sánchez Balmaseda,(eds) Actas del I Congreso de la Sociedad de Lógica, Metodología y Filosofia de la Ciencia (Madrid 1993), pp [2] A. Avron, Gentzen-type system, resolution and tableaux, Journal of Automated Reasoning 10, (1993), pp [3] W. J. Blok and D. Pigozzi, Algebraizable logics, Memoirs of the American Mathematical Society 396 (1989). [4] W. J. Blok and D. Pigozzi, The Deduction Theorem in Algebraic Logics. Preprint, [5] W. J. Blok and D. Pigozzi, Abstract Algebraic Logic, A course given at the Summer School on Algebraic Logic and the Methodology of Applying it, Budapest, July Preprint, October 5, [6] W. J. Blok and D. Pigozzi, Local Deduction Theorems in Algebraic Logics, [in:] H. Andréka, J. D. Monk and I. Németi (eds) Algebraic Logic, Colloq. Math. Soc. János Bolyai, vol. 54, North-Holland (1991), pp [7] K. Iséki and S. Tanaka, An introduction to the theory of BCKalgebras, Math. Japonica 23 (1978), pp [8] H. Ono and Y. Komori, Logics without the contraction rule, The Journal of Symbolic Logic 50 (1985), pp [9] J. Rebagliato and V. Verdú, On the algebraization of some Gentzen systems, Fundamenta Informaticae, Special Issue: Algebraic Logic and its Applications 18 (1993), pp [10] J. Rebagliato and V. Verdú, Algebraizable Gentzen Systems and the Deduction Theorem for Gentzen Systems, Mathematics Preprint Series No. 175, University of Barcelona, [11] A. Wroński, BCK-algebras do not form a variety, Math. Japonica 28 (1983), pp
8 E.U.Estudis Empresarials Facultat de Matemàtiques Universitat de Barcelona Universitat de Barcelona Diagonal 696 Gran Via Barcelona, Spain Barcelona, Spain riscd2.eco.ub.es cerber.mat.ub.es 80
ON A SUBSTRUCTURAL LOGIC WITH MINIMAL NEGATION. Abstract
Bulletin of the Section of Logic Volume 33/3 (2004), pp. 143 156 Roberto Arpaia ON A SUBSTRUCTURAL LOGIC WITH MINIMAL NEGATION Abstract In [3] and [1], Adillon and Verdú studied the intuitionistic contraction-less
More informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
More informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More informationFONT * AND GONZALO RODRÍGUEZ PÉREZ*
Publicacions Matemátiques, Vol 36 (1992), 591-599. A NOTE ON SUGIHARA ALGEBRAS JOSEP M. FONT * AND GONZALO RODRÍGUEZ PÉREZ* Abstract In [41 Blok and Pigozzi prove syntactically that RM, the propositional
More informationHypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Agata Ciabattoni Mauro Ferrari Abstract In this paper we define cut-free hypersequent calculi for some intermediate logics semantically
More informationIn memory of Wim Blok
In memory of Wim Blok This Special Issue of Reports on Mathematical Logic is dedicated to the memory of the Dutch logician Willem Johannes Blok, who died in an accident on November 30, 2003. This was an
More informationSIMPLE LOGICS FOR BASIC ALGEBRAS
Bulletin of the Section of Logic Volume 44:3/4 (2015), pp. 95 110 http://dx.doi.org/10.18778/0138-0680.44.3.4.01 Jānis Cīrulis SIMPLE LOGICS FOR BASIC ALGEBRAS Abstract An MV-algebra is an algebra (A,,,
More informationNon-classical Logics: Theory, Applications and Tools
Non-classical Logics: Theory, Applications and Tools Agata Ciabattoni Vienna University of Technology (TUV) Joint work with (TUV): M. Baaz, P. Baldi, B. Lellmann, R. Ramanayake,... N. Galatos (US), G.
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More informationA simple proof that super-consistency implies cut elimination
A simple proof that super-consistency implies cut elimination Gilles Dowek 1 and Olivier Hermant 2 1 École polytechnique and INRIA, LIX, École polytechnique, 91128 Palaiseau Cedex, France gilles.dowek@polytechnique.edu
More informationInterpolation via translations
Interpolation via translations Walter Carnielli 2,3 João Rasga 1,3 Cristina Sernadas 1,3 1 DM, IST, TU Lisbon, Portugal 2 CLE and IFCH, UNICAMP, Brazil 3 SQIG - Instituto de Telecomunicações, Portugal
More informationDisplay calculi in non-classical logics
Display calculi in non-classical logics Revantha Ramanayake Vienna University of Technology (TU Wien) Prague seminar of substructural logics March 28 29, 2014 Revantha Ramanayake (TU Wien) Display calculi
More informationSLANEY S LOGIC F IS CONSTRUCTIVE LOGIC WITH STRONG NEGATION
Bulletin of the Section of Logic Volume 39:3/4 2010, pp. 161 173 M. Spinks and R. Veroff SLANEY S LOGIC F IS CONSTRUCTIVE LOGIC WITH STRONG NEGATION Abstract In [19] Slaney et al. introduced a little known
More informationON THE LOGIC OF DISTRIBUTIVE LATTICES
Bulletin of the Section of Logic Volume 18/2 (1989), pp. 79 85 reedition 2006 [original edition, pp. 79 86] Josep M. Font and Ventura Verdú ON THE LOGIC OF DISTRIBUTIVE LATTICES This note is a summary
More informationAN ALTERNATIVE NATURAL DEDUCTION FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC
Bulletin of the Section of Logic Volume 45/1 (2016), pp 33 51 http://dxdoiorg/1018778/0138-068045103 Mirjana Ilić 1 AN ALTERNATIVE NATURAL DEDUCTION FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC Abstract
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationLogics preserving degrees of truth and the hierarchies of abstract algebraic logic
Logics preserving degrees of truth and the hierarchies of abstract algebraic logic Josep Maria Font Department of Probability, Logic and Statistics Faculty of Mathematics University of Barcelona XV Simposio
More informationAn Introduction to Modal Logic III
An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami
More informationOn weakening the Deduction Theorem and strengthening Modus Ponens
Math. Log. Quart. 50, No. 3, 303 324 (2004) / DOI 10.1002/malq.200410001 / www.mlq-journal.org On weakening the Deduction Theorem and strengthening Modus Ponens Félix Bou 1,2, Josep Maria Font 1, and JoséLuisGarcía
More informationCanonical Calculi: Invertibility, Axiom expansion and (Non)-determinism
Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism A. Avron 1, A. Ciabattoni 2, and A. Zamansky 1 1 Tel-Aviv University 2 Vienna University of Technology Abstract. We apply the semantic
More informationAn Algebraic Proof of the Disjunction Property
An Algebraic Proof of the Disjunction Property Rostislav Horčík joint work with Kazushige Terui Institute of Computer Science Academy of Sciences of the Czech Republic Algebra & Coalgebra meet Proof Theory
More informationProof Theoretical Reasoning Lecture 3 Modal Logic S5 and Hypersequents
Proof Theoretical Reasoning Lecture 3 Modal Logic S5 and Hypersequents Revantha Ramanayake and Björn Lellmann TU Wien TRS Reasoning School 2015 Natal, Brasil Outline Modal Logic S5 Sequents for S5 Hypersequents
More informationModal Logic XX. Yanjing Wang
Modal Logic XX Yanjing Wang Department of Philosophy, Peking University May 6th, 2016 Advanced Modal Logic (2016 Spring) 1 Completeness A traditional view of Logic A logic Λ is a collection of formulas
More informationA Schütte-Tait style cut-elimination proof for first-order Gödel logic
A Schütte-Tait style cut-elimination proof for first-order Gödel logic Matthias Baaz and Agata Ciabattoni Technische Universität Wien, A-1040 Vienna, Austria {agata,baaz}@logic.at Abstract. We present
More informationChapter 11: Automated Proof Systems
Chapter 11: Automated Proof Systems SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems are
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationAlgebraic Logic. Hiroakira Ono Research Center for Integrated Science Japan Advanced Institute of Science and Technology
Algebraic Logic Hiroakira Ono Research Center for Integrated Science Japan Advanced Institute of Science and Technology ono@jaist.ac.jp 1 Introduction Algebraic methods have been important tools in the
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
More informationProof Theoretical Studies on Semilattice Relevant Logics
Proof Theoretical Studies on Semilattice Relevant Logics Ryo Kashima Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro, Tokyo 152-8552, Japan. e-mail: kashima@is.titech.ac.jp
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationOutline. Overview. Syntax Semantics. Introduction Hilbert Calculus Natural Deduction. 1 Introduction. 2 Language: Syntax and Semantics
Introduction Arnd Poetzsch-Heffter Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern Sommersemester 2010 Arnd Poetzsch-Heffter ( Software Technology Group Fachbereich
More informationTHE EQUATIONAL THEORIES OF REPRESENTABLE RESIDUATED SEMIGROUPS
TH QUATIONAL THORIS OF RPRSNTABL RSIDUATD SMIGROUPS SZABOLCS MIKULÁS Abstract. We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More informationEvaluation Driven Proof-Search in Natural Deduction Calculi for Intuitionistic Propositional Logic
Evaluation Driven Proof-Search in Natural Deduction Calculi for Intuitionistic Propositional Logic Mauro Ferrari 1, Camillo Fiorentini 2 1 DiSTA, Univ. degli Studi dell Insubria, Varese, Italy 2 DI, Univ.
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More information5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci
5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci Arnon Avron School of Computer Science, Tel-Aviv University http://www.math.tau.ac.il/ aa/ March 7, 2008 Abstract One of the
More informationREPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES
Wojciech Buszkowski REPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES Professor Rasiowa [HR49] considers implication algebras (A,, V ) such that is a binary operation on the universe A and V A. In particular,
More informationGödel s Completeness Theorem
A.Miller M571 Spring 2002 Gödel s Completeness Theorem We only consider countable languages L for first order logic with equality which have only predicate symbols and constant symbols. We regard the symbols
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More information(Algebraic) Proof Theory for Substructural Logics and Applications
(Algebraic) Proof Theory for Substructural Logics and Applications Agata Ciabattoni Vienna University of Technology agata@logic.at (Algebraic) Proof Theory for Substructural Logics and Applications p.1/59
More informationU-Sets as a probabilistic set theory
U-Sets as a probabilistic set theory Claudio Sossai ISIB-CNR, Corso Stati Uniti 4, 35127 Padova, Italy sossai@isib.cnr.it Technical Report 05/03 ISIB-CNR, October 2005 Abstract A topos of presheaves can
More informationThiago Nascimento, Programa de Pós-Graduação em Sistemas e Computação, Universidade Federal do Rio Grande do Norte, Natal, Brazil
Nelson s Logic S arxiv:803.085v [math.lo] 8 Mar 08 Thiago Nascimento, Programa de Pós-Graduação em Sistemas e Computação, Universidade Federal do Rio Grande do Norte, Natal, Brazil Umberto Rivieccio, Departamento
More informationUndefinability of standard sequent calculi for Paraconsistent logics
Undefinability of standard sequent calculi for Paraconsistent logics Michele Pra Baldi (with S.Bonzio) University of Padua m.prabaldi@gmail.com Topology, Algebra and Categories in Logic. Prague, June 6,
More informationMultiplicative Conjunction and an Algebraic. Meaning of Contraction and Weakening. A. Avron. School of Mathematical Sciences
Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening A. Avron School of Mathematical Sciences Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv 69978, Israel Abstract
More informationLogic for Computer Science - Week 5 Natural Deduction
Logic for Computer Science - Week 5 Natural Deduction Ștefan Ciobâcă November 30, 2017 1 An Alternative View of Implication and Double Implication So far, we have understood as a shorthand of However,
More informationKazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R +
REPORTS ON MATHEMATICAL LOGIC 40 (2006), 3 13 Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R + A b s t r a c t. In this paper it is proved that the interval
More informationForcing in Lukasiewicz logic
Forcing in Lukasiewicz logic a joint work with Antonio Di Nola and George Georgescu Luca Spada lspada@unisa.it Department of Mathematics University of Salerno 3 rd MATHLOGAPS Workshop Aussois, 24 th 30
More informationCUT ELIMINATION AND STRONG SEPARATION FOR SUBSTRUCTURAL LOGICS: AN ALGEBRAIC APPROACH.
CUT ELIMINATION AND STRONG SEPARATION FOR SUBSTRUCTURAL LOGICS: AN ALGEBRAIC APPROACH. NIOLAOS GALATOS AND HIROAIRA ONO Abstract. We develop a general algebraic and proof-theoretic study of substructural
More informationSubstructural Logics and Residuated Lattices an Introduction
Hiroakira Ono Substructural Logics and Residuated Lattices an Introduction Abstract. This is an introductory survey of substructural logics and of residuated lattices which are algebraic structures for
More informationCyclic Proofs for Linear Temporal Logic
Cyclic Proofs for Linear Temporal Logic Ioannis Kokkinis Thomas Studer Abstract Annotated sequents provide an elegant approach for the design of deductive systems for temporal logics. Their proof theory,
More informationPropositional Logic: Syntax
4 Propositional Logic: Syntax Reading: Metalogic Part II, 22-26 Contents 4.1 The System PS: Syntax....................... 49 4.1.1 Axioms and Rules of Inference................ 49 4.1.2 Definitions.................................
More informationChapter 11: Automated Proof Systems (1)
Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems
More informationAn Introduction to Proof Theory
An Introduction to Proof Theory Class 1: Foundations Agata Ciabattoni and Shawn Standefer anu lss december 2016 anu Our Aim To introduce proof theory, with a focus on its applications in philosophy, linguistics
More informationOn interpolation in existence logics
On interpolation in existence logics Matthias Baaz and Rosalie Iemhoff Technical University Vienna, Wiedner Hauptstrasse 8-10, A-1040 Vienna, Austria baaz@logicat, iemhoff@logicat, http://wwwlogicat/people/baaz,
More informationPropositional Logic: Deductive Proof & Natural Deduction Part 1
Propositional Logic: Deductive Proof & Natural Deduction Part 1 CS402, Spring 2016 Shin Yoo Deductive Proof In propositional logic, a valid formula is a tautology. So far, we could show the validity of
More informationFROM AXIOMS TO STRUCTURAL RULES, THEN ADD QUANTIFIERS.
FROM AXIOMS TO STRUCTURAL RULES, THEN ADD QUANTIFIERS. REVANTHA RAMANAYAKE We survey recent developments in the program of generating proof calculi for large classes of axiomatic extensions of a non-classical
More informationA Deep Inference System for the Modal Logic S5
A Deep Inference System for the Modal Logic S5 Phiniki Stouppa March 1, 2006 Abstract We present a cut-admissible system for the modal logic S5 in a formalism that makes explicit and intensive use of deep
More informationRelational semantics for a fragment of linear logic
Relational semantics for a fragment of linear logic Dion Coumans March 4, 2011 Abstract Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic.
More informationAssertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic
Assertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic Published as a chapter (pp. 53 80) of: Don Pigozzi on abstract algebraic logic, universal algebra and computer
More informationINTERPOLATION THEOREM FOR NONCOMMUTATIVE STANDARD EXTENSIONS OF LOGIC BB I
JURNAL MATEMATIKA DAN KOMPUTER Vol. 7. No., 36-4, Agustus 004, ISSN : 40-858 INTERPOLATION THEOREM FOR NONCOMMUTATIVE STANDARD EXTENSIONS OF LOGIC BB I Bayu Surarso Department of Mathematics Faculty of
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More information3.17 Semantic Tableaux for First-Order Logic
3.17 Semantic Tableaux for First-Order Logic There are two ways to extend the tableau calculus to quantified formulas: using ground instantiation using free variables Tableaux with Ground Instantiation
More informationInquisitive Logic. Ivano Ciardelli.
Inquisitive Logic Ivano Ciardelli www.illc.uva.nl/inquisitive-semantics Information states A state is a set of valuations. Support Let s be a state. The system InqB 1. s = p iff w s : w(p) = 1 2. s = iff
More informationA CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
THE REVIEW OF SYMBOLIC LOGIC Volume 1, Number 1, June 2008 3 A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5 FRANCESCA POGGIOLESI University of Florence and University of Paris 1 Abstract In this
More informationBounded Lukasiewicz Logics
Bounded Lukasiewicz Logics Agata Ciabattoni 1 and George Metcalfe 2 1 Institut für Algebra und Computermathematik, Technische Universität Wien Wiedner Haupstrasse 8-10/118, A-1040 Wien, Austria agata@logic.at
More informationLogic for Computer Science - Week 4 Natural Deduction
Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a
More informationPropositional Logic: Gentzen System, G
CS402, Spring 2017 Quiz on Thursday, 6th April: 15 minutes, two questions. Sequent Calculus in G In Natural Deduction, each line in the proof consists of exactly one proposition. That is, A 1, A 2,...,
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More informationBoolean bunched logic: its semantics and completeness
Boolean bunched logic: its semantics and completeness James Brotherston Programming Principles, Logic and Verification Group Dept. of Computer Science University College London, UK J.Brotherston@ucl.ac.uk
More informationPartially commutative linear logic: sequent calculus and phase semantics
Partially commutative linear logic: sequent calculus and phase semantics Philippe de Groote Projet Calligramme INRIA-Lorraine & CRIN CNRS 615 rue du Jardin Botanique - B.P. 101 F 54602 Villers-lès-Nancy
More informationTRANSLATING A SUPPES-LEMMON STYLE NATURAL DEDUCTION INTO A SEQUENT CALCULUS
EuJAP VOL. 11 No. 2 2015 ORIGINAL SCIENTIFIC PAPER TRANSLATING A SUPPES-LEMMON STYLE NATURAL DEDUCTION INTO A SEQUENT CALCULUS UDK: 161/162 164:23 EDI PAVLOVIĆ Central European University Budapest ABSTRACT
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationSystem Description: ara An Automatic Theorem Prover for Relation Algebras
System Description: ara An Automatic Theorem Prover for Relation Algebras Carsten Sinz Symbolic Computation Group, WSI for Computer Science, Universität Tübingen, D-72076 Tübingen, Germany sinz@informatik.uni-tuebingen.de
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationON A PROBLEM IN ALGEBRAIC MODEL THEORY
Bulletin of the Section of Logic Volume 11:3/4 (1982), pp. 103 107 reedition 2009 [original edition, pp. 103 108] Bui Huy Hien ON A PROBLEM IN ALGEBRAIC MODEL THEORY In Andréka-Németi [1] the class ST
More informationLecture 11: Measuring the Complexity of Proofs
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July
More informationLOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC
Logic and Logical Philosophy Volume 9 (2001), 91 107 S. P. Odintsov LOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC Introduction This article continues the investigation of paraconsistent
More informationDual-Intuitionistic Logic and Some Other Logics
Dual-Intuitionistic Logic and Some Other Logics Hiroshi Aoyama 1 Introduction This paper is a sequel to Aoyama(2003) and Aoyama(2004). In this paper, we will study various proof-theoretic and model-theoretic
More informationIntroduction to Intuitionistic Logic
Introduction to Intuitionistic Logic August 31, 2016 We deal exclusively with propositional intuitionistic logic. The language is defined as follows. φ := p φ ψ φ ψ φ ψ φ := φ and φ ψ := (φ ψ) (ψ φ). A
More informationProofs with monotone cuts
Proofs with monotone cuts Emil Jeřábek jerabek@math.cas.cz http://math.cas.cz/ jerabek/ Institute of Mathematics of the Academy of Sciences, Prague Logic Colloquium 2010, Paris Propositional proof complexity
More informationNotation for Logical Operators:
Notation for Logical Operators: always true always false... and...... or... if... then...... if-and-only-if... x:x p(x) x:x p(x) for all x of type X, p(x) there exists an x of type X, s.t. p(x) = is equal
More informationRasiowa-Sikorski proof system for the non-fregean sentential logic SCI
Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI Joanna Golińska-Pilarek National Institute of Telecommunications, Warsaw, J.Golinska-Pilarek@itl.waw.pl We will present complete and
More informationAdmissible Rules of (Fragments of) R-Mingle. Admissible Rules of (Fragments of) R-Mingle. Laura Janina Schnüriger
Admissible Rules of (Fragments of) R-Mingle Admissible Rules of (Fragments of) R-Mingle joint work with George Metcalfe Universität Bern Novi Sad 5 June 2015 Table of contents 1. What and why? 1.1 What
More informationThe quest for the basic fuzzy logic
Petr Cintula 1 Rostislav Horčík 1 Carles Noguera 1,2 1 Institute of Computer Science, Academy of Sciences of the Czech Republic Pod vodárenskou věží 2, 182 07 Prague, Czech Republic 2 Institute of Information
More informationDynamic Epistemic Logic Displayed
1 / 43 Dynamic Epistemic Logic Displayed Giuseppe Greco & Alexander Kurz & Alessandra Palmigiano April 19, 2013 ALCOP 2 / 43 1 Motivation Proof-theory meets coalgebra 2 From global- to local-rules calculi
More informationFrom pre-models to models
From pre-models to models normalization by Heyting algebras Olivier HERMANT 18 Mars 2008 Deduction System : natural deduction (NJ) first-order logic: function and predicate symbols, logical connectors:,,,,
More informationLecture Notes on Sequent Calculus
Lecture Notes on Sequent Calculus 15-816: Modal Logic Frank Pfenning Lecture 8 February 9, 2010 1 Introduction In this lecture we present the sequent calculus and its theory. The sequent calculus was originally
More informationApplied Logic for Computer Scientists. Answers to Some Exercises
Applied Logic for Computer Scientists Computational Deduction and Formal Proofs Springer, 2017 doi: http://link.springer.com/book/10.1007%2f978-3-319-51653-0 Answers to Some Exercises Mauricio Ayala-Rincón
More informationCS 512, Spring 2016, Handout 02 Natural Deduction, and Examples of Natural Deduction, in Propositional Logic
CS 512, Spring 2016, Handout 02 Natural Deduction, and Examples of Natural Deduction, in Propositional Logic Assaf Kfoury January 19, 2017 Assaf Kfoury, CS 512, Spring 2017, Handout 02 page 1 of 41 from
More informationMONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC
Bulletin of the Section of Logic Volume 45:3/4 (2016), pp. 143 153 http://dx.doi.org/10.18778/0138-0680.45.3.4.01 Anna Glenszczyk MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC Abstract We investigate
More informationOn the Construction of Analytic Sequent Calculi for Sub-classical Logics
On the Construction of Analytic Sequent Calculi for Sub-classical Logics Ori Lahav Yoni Zohar Tel Aviv University WoLLIC 2014 On the Construction of Analytic Sequent Calculi for Sub-classical Logics A
More informationGeneral methods in proof theory for modal logic - Lecture 1
General methods in proof theory for modal logic - Lecture 1 Björn Lellmann and Revantha Ramanayake TU Wien Tutorial co-located with TABLEAUX 2017, FroCoS 2017 and ITP 2017 September 24, 2017. Brasilia.
More informationcse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018
cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationKleene realizability and negative translations
Q E I U G I C Kleene realizability and negative translations Alexandre Miquel O P. D E. L Ō A U D E L A R April 21th, IMERL Plan 1 Kleene realizability 2 Gödel-Gentzen negative translation 3 Lafont-Reus-Streicher
More informationProper multi-type display calculi for classical and intuitionistic inquisitive logic
1/18 Proper multi-type display calculi for classical and intuitionistic inquisitive logic Giuseppe Greco Delft University of Technology, The Netherlands www.appliedlogictudelft.nl TACL 2017, Prague Joint
More informationFirst Part: Basic Algebraic Logic
First Part: Basic Algebraic Logic Francesco Paoli TACL 2013 Francesco Paoli (Univ. of Cagliari) Tutorial on algebraic logic TACL 2013 1 / 33 Outline of this tutorial 1 The basics of algebraic logic 2 Residuated
More informationOn sequent calculi vs natural deductions in logic and computer science
On sequent calculi vs natural deductions in logic and computer science L. Gordeev Uni-Tübingen, Uni-Ghent, PUC-Rio PUC-Rio, Rio de Janeiro, October 13, 2015 1. Sequent calculus (SC): Basics -1- 1. Sequent
More information