Some extensions of the Belnap-Dunn logic

Size: px
Start display at page:

Download "Some extensions of the Belnap-Dunn logic"

Transcription

1 Some extensions of the Belnap-Dunn logic Umberto Rivieccio Università di Genova November 11th, 2010 Barcelona U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

2 The Belnap-Dunn logic Introduction The Belnap-Dunn four-valued logic (a.k.a. first degree entailment) is a well-known system related to relevant and paraconsistent logics, widely known and applied in computer science. In recent years it has also been studied algebraically (Font, Pynko) and in connection with more general structures such as bilattices and generalized Kleene logics (Fitting, Arieli & Avron, Shramko & Wansing). U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

3 The Belnap-Dunn logic Semantic definition of B (Dunn 1966, Belnap 1977) The Belnap-Dunn logic (that we denote by B) is the logic determined by the matrix xm 4, tt, Juy, where M 4 is the four-element diamond De Morgan lattice shown below. K t J f t f K J f t K J U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

4 The Belnap-Dunn logic Miscellaneous facts (Pynko 1995, Font 1997) B is: a theoremless (a.k.a. purely inferential ) logic paraconsistent, in the sense that ϕ ^ ϕ * B ψ relevant, in the sense that if ϕ ( B ψ, then varpϕq X varpψq H the logic of the lattice order of De Morgan lattices, i.e. Γ ( B ϕ iff DMLat ( Γ ϕ finitely axiomatized by Hilbert- or Gentzen-style calculi U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

5 The Belnap-Dunn logic Miscellaneous facts (Pynko 1995, Font 1997) Moreover B is non-protoalgebraic, self-extensional and non-fregean B has an associated fully adequate Gentzen calculus that is algebraizable w.r.t. the variety DMLat of De Morgan lattices Alg B ˆ AlgB DMLat. Remark DMLat is not the equivalent algebraic semantics of any algebraizable logic; the same holds for any sub-quasi-variety of DMLat (except Boolean algebras). U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

6 The Belnap-Dunn logic Algebraic models of B (Font 1997) Any matrix xa, Dy such that A P DMLat and D A is a lattice filter (or is empty) is a model of B. xa, Cy is a reduced full model of B iff A P DMLat and C is the set of all lattice filters of A plus the empty set. xa, Dy is a reduced matrix for B iff A P DMLat and D is a lattice filter satisfying that for all a, b P A with a b, at least one of the following conditions holds: (i) there is c P A such that a _ c R D and b _ c P D (ii) there is c P A such that a _ c P D and b _ c P D. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

7 Extensions of B Well-known ones Priest s (1979) logic of paradox LP Kleene s logic of order K (a.k.a. the implicationless fragment of the relevant logic RM) the strong three-valued (assertional) Kleene logic K classical logic CPC. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

8 Extensions of B Inclusions CPC LP K K B U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

9 Extensions of B Axiomatizations (Hilbert-style) LP B plus $ p _ p (Pynko 1995) K B plus pp ^ pq _ r $ q _ q _ r K K plus p ^ p p _ qq $ q CPC K plus $ p _ p. Algebraic models AlgLP AlgK AlgK KLat xa, Dy P Matr L iff xa, Dy P Matr B and D is closed under the corresponding additional rule(s) of L listed above. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

10 Extensions of B Semantical presentations LP is defined by xk 3, tt, Kuy K by txk 3, tt, Kuy, xk 3, ttuu K by xk 3, ttuy CPC by xb 2, ttuy. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

11 There are more... Some more extensions of B Any (set of) matrices belonging to Matr B defines an extension of B. For instance: xm 4, ttuy xk 6, tt, auy xm 8, tt, auy txm 4, ttuy, xk 3, tt, Kuyu... U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

12 There are more... Some more extensions of B We are going to consider the following new basic logics : B 4 defined by xm 4, ttuy B 6 defined by xk 6, tt, auy B 8 defined by xm 8, tt, auy together with the known ones: K defined by xk 3, ttuy LP defined by xk 3, tt, Kuy. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

13 There are more... Some more extensions of B The above-mentioned basic logics generate the following: B 36 B 6 X K B 46 B 36 X B 4 K B 36 X LP B 38 K X B 8 B 48 B 8 X B 46 B 34 K X B 46 B 348 B 34 X B 38. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

14 A hierarchy LP CPC B 6 K B 36 B 4 K B 8 B 46 B 38 B 34 B 48 B 348 U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

15 What we do (not) know Miscellaneous facts The above logics are obtained from B by adding some form of excluded middle and/or ex contradictione quodlibet. B 4 has no axiomatic extensions of except CPC. K has no finitary extensions of except CPC. The only logics with theorems are LP and B 6. All the logics (except K ) are non-selfextensional. All the logics are non-protoalgebraic. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

16 What we do (not) know Relations with the order For any ϕ, ψ P Fm, it holds that ϕ ( L ψ if and only if: DMLat ( ϕ ψ for L B KLat ( ϕ ψ for L K DMLat ( ϕ _ ψ ϕ _ ψ for L B 34 DMLat ( ϕ ϕ _ ψ for L B 4 KLat ( ϕ ϕ _ ψ for L K KLat ( ϕ _ ψ ϕ _ ψ for L LP QpK 6 q ( ϕ ϕ ñ ψ ψ for L B 6. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

17 What we do (not) know Axiomatizations (Hilbert-style) The previous results allow to prove that B 4 B 6 B plus p ^ p p _ qq $ q LP plus p ^ p $ q K B plus pp ^ pq _ r $ q _ q _ r K K plus p ^ p p _ qq $ q U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

18 What we do (not) know: algebraic models Algebraic reducts of educed g-models AlgB 34 AlgB 4 AlgB 46 AlgB 48 AlgB 348 DMLat AlgB 8, AlgB 38 DMLat (?) AlgB 6, AlgB 36 KLat (?) U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

19 What we do (not) know: algebraic models Reduced models For A P DMLat, let A : ta P A : a au. Let xa, Dy be a reduced matrix: if xa, Dy is a model of B, then D A B 34 or B 48 and D X A H, then D A LP, then D A B 4 or K, then A is bounded and D t1u. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

20 What we do (not) know: algebraic models Reduced models So, a matrix xa, Dy P Matr B is a reduced model of B 34 iff A P DMLat and D is a lattice filter such that b P D whenever a P D and a _ b a _ b B 4 iff A is bounded De Morgan lattice and D t1u K iff A P KLat and D is a lattice filter K iff A is a bounded Kleene lattice and D t1u LP iff A P KLat and D ta P A : a au. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

21 What there is to know Open problems Complete the picture of all (?) the extensions of B (for instance: is there some logic between B and B 348?). Axiomatize B 34, B 48, B 8 etc. and characterize their reduced models. Characterize the extensions of B in terms of their metalogical properties. Introduce and study Gentzen calculi associated with these logics (study their algebraizability etc.). U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

22 References J. M. Font (1997): Belnap s four-valued logic and De Morgan lattices. Logic Journal of the I.G.P.L., 5(3): A. Pynko (1995a): On Priest s logic of paradox. Journal of Applied Non-Classical Logics, 5(2): A. P. Pynko (1995b): Characterizing Belnap s logic via De Morgan s laws. Mathematical Logic Quarterly, 41(4): A. P. Pynko (1999): Implicational classes of De Morgan lattices. Discrete Math., 205(1-3): U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

23 DMLat and KLat De Morgan lattices A De Morgan lattice is an algebra A xa, ^, _, y such that xa, ^, _y is a distributive lattice and the following equations are satisfied: (i) px ^ yq x _ y (ii) px _ yq x ^ y (iii) x x A Kleene lattice is a De Morgan lattice satisfying: (iv) x ^ x y _ y. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

24 Some De Morgan lattices f K J t f K t f a a t M 4 K 3 K 4 U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

25 Some De Morgan lattices f b a t b a f a c t c a b b K 6 M 8 U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

26 Sub-quasi-varieties of DMLat Some facts The class DMLat is a variety, generated by M 4. Besides M 4, the the only subdirectly irreducible De Morgan lattices are K 3 and B 2. VpK 3 q KLat and VpB 2 q are the only subvarieties of DMLat. (Pynko 1999): DMLat has four sub-quasi-varieties (that are not varieties), i.e. 1 regular Kleene lattices QpK 4 q 2 non-idempotent Kleene lattices QpK 6 q 3 non-idempotent De Morgan lattices QpM 8 q 4 KLat Y non-idempotent De Morgan lattices QpM 8, K 3 q. U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28 Back

27 De Morgan matrices b a f t a xk 6, tt, auy b a t b a b c f xm 8, tt, auy c Back U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

28 A Hilbert calculus for B (Font, 1997) p ^ q (R1) p p (R4) p _ q p _ pq _ r q (R7) pp _ qq _ r (R10) p _ r p _ r p ^ q (R2) q p _ q (R5) q _ p p _ pq ^ r q (R8) pp _ qq ^ pp _ r q (R11) p _ r p _ r (R9) (R3) p q p ^ q (R6) p _ p p pp _ qq ^ pp _ r q p _ pq ^ r q pp _ qq _ r (R12) p p ^ qq _ r (R13) p p ^ qq _ r pp _ qq _ r pp ^ qq _ r p p _ qq _ r (R14) (R15) p p _ qq _ r pp ^ qq _ r Back U. Rivieccio (Università di Genova) Some extensions of the Belnap-Dunn logic November 11th, / 28

Logics preserving degrees of truth and the hierarchies of abstract algebraic logic

Logics 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 information

Undefinability of standard sequent calculi for Paraconsistent logics

Undefinability 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 information

An Algebraic Study of Bilattice-based Logics

An Algebraic Study of Bilattice-based Logics An Algebraic Study of Bilattice-based Logics arxiv:1010.2552v1 [math.lo] 13 Oct 2010 Umberto Rivieccio Tesi discussa per il conseguimento del titolo di Dottore di ricerca in Filosofia svolta presso la

More information

In memory of Wim Blok

In 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 information

FONT * AND GONZALO RODRÍGUEZ PÉREZ*

FONT * 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 information

ON THE LOGIC OF DISTRIBUTIVE LATTICES

ON 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 information

Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic

Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic E. Turunen Tampere Univ. of Technology, P.O. Box 553, 33101 Tampere, Finland, M. Öztürk CRIL, Univ. d Artois, F 62307 Lens, France, A.

More information

Implicational classes ofde Morgan Boolean algebras

Implicational classes ofde Morgan Boolean algebras Discrete Mathematics 232 (2001) 59 66 www.elsevier.com/locate/disc Implicational classes ofde Morgan Boolean algebras Alexej P. Pynko Department of Digital Automata Theory, V.M. Glushkov Institute of Cybernetics,

More information

Thiago Nascimento, Programa de Pós-Graduação em Sistemas e Computação, Universidade Federal do Rio Grande do Norte, Natal, Brazil

Thiago 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 information

A Survey of Abstract Algebraic Logic

A Survey of Abstract Algebraic Logic J. M. Font R. Jansana D. Pigozzi A Survey of Abstract Algebraic Logic Contents Introduction 14 1. The First Steps 16 1.1. Consequence operations and logics................ 17 1.2. Logical matrices..........................

More information

Assertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic

Assertional 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 information

Non-classical Logics: Theory, Applications and Tools

Non-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 information

Logic and Implication

Logic and Implication Logic and Implication Carles Noguera (Joint work with Petr Cintula and Tomáš Lávička) Institute of Information Theory and Automation Czech Academy of Sciences Congreso Dr. Antonio Monteiro Carles Noguera

More information

arxiv: v1 [math.lo] 10 Mar 2018

arxiv: v1 [math.lo] 10 Mar 2018 arxiv:1803.03822v1 [math.lo] 10 Mar 2018 Cut elimination, identity elimination, and interpolation in super-belnap logics Adam Přenosil Abstract We develop a Gentzen-style proof theory for super-belnap

More information

What is an Ideal Logic for Reasoning with Inconsistency?

What is an Ideal Logic for Reasoning with Inconsistency? What is an Ideal Logic for Reasoning with Inconsistency? Ofer Arieli School of Computer Science The Academic College of Tel-Aviv Israel Arnon Avron School of Computer Science Tel-Aviv University Israel

More information

Characterizing finite-valuedness

Characterizing finite-valuedness Characterizing finite-valuedness Carlos Caleiro, Sérgio Marcelino {smarcel,ccal}@math.tecnico.ulisboa.pt SQIG - Instituto de Telecomunicações Dep. Matemática - Instituto Superior Técnico Universidade de

More information

Priestley Duality for Bilattices

Priestley Duality for Bilattices A. Jung U. Rivieccio Priestley Duality for Bilattices In memoriam Leo Esakia Abstract. We develop a Priestley-style duality theory for different classes of algebras having a bilattice reduct. A similar

More information

SIMPLE LOGICS FOR BASIC ALGEBRAS

SIMPLE 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 information

Admissible 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. 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 information

Propositional logic (revision) & semantic entailment. p. 1/34

Propositional logic (revision) & semantic entailment. p. 1/34 Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)

More information

LOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION

LOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION LOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION JOSEP MARIA FONT AND TOMMASO MORASCHINI Abstract. This paper starts with a general analysis of the problem of how to associate a logic with

More information

On weakening the Deduction Theorem and strengthening Modus Ponens

On 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 information

On the Construction of Analytic Sequent Calculi for Sub-classical Logics

On 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 information

Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic

Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic 1 1 Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic E. Turunen, P.O. Box 553, 33101 Tampere, Finland M. Öztürk Artois, F 62307 Lens, France, A. Tsoukias 75775, Paris, France. May 26,

More information

Nonclassical logics (Nichtklassische Logiken)

Nonclassical logics (Nichtklassische Logiken) Nonclassical logics (Nichtklassische Logiken) VU 185.249 (lecture + exercises) http://www.logic.at/lvas/ncl/ Chris Fermüller Technische Universität Wien www.logic.at/people/chrisf/ chrisf@logic.at Winter

More information

Tableau Systems for Logics of Formal Inconsistency

Tableau Systems for Logics of Formal Inconsistency Tableau Systems for Logics of Formal Inconsistency Walter A. Carnielli Centre for Logic and Epistemology, and Department of Philosophy State University of Campinas CLE/Unicamp, Campinas, Brazil João Marcos

More information

Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results

Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results Francesc Esteva, Lluís Godo, Carles Noguera Institut d Investigació en Intel ligència Artificial - CSIC Catalonia,

More information

IDEMPOTENT RESIDUATED STRUCTURES: SOME CATEGORY EQUIVALENCES AND THEIR APPLICATIONS

IDEMPOTENT RESIDUATED STRUCTURES: SOME CATEGORY EQUIVALENCES AND THEIR APPLICATIONS IDEMPOTENT RESIDUATED STRUCTURES: SOME CATEGORY EQUIVALENCES AND THEIR APPLICATIONS N. GALATOS AND J.G. RAFTERY Abstract. This paper concerns residuated lattice-ordered idempotent commutative monoids that

More information

VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS

VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS TOMMASO MORASCHINI Abstract. Positive modal algebras are the,,,, 0, 1 -subreducts of modal algebras. We show that the variety of positive

More information

On the set of intermediate logics between the truth and degree preserving Lukasiewicz logics

On the set of intermediate logics between the truth and degree preserving Lukasiewicz logics On the set of intermediate logics between the truth and degree preserving Lukasiewicz logics Marcelo Coniglio 1 Francesc Esteva 2 Lluís Godo 2 1 CLE and Department of Philosophy State University of Campinas

More information

Implicational F -Structures and Implicational Relevance. Logics. A. Avron. Sackler Faculty of Exact Sciences. School of Mathematical Sciences

Implicational F -Structures and Implicational Relevance. Logics. A. Avron. Sackler Faculty of Exact Sciences. School of Mathematical Sciences Implicational F -Structures and Implicational Relevance Logics A. Avron Sackler Faculty of Exact Sciences School of Mathematical Sciences Tel Aviv University Ramat Aviv 69978, Israel Abstract We describe

More information

Bivalent Semantics for De Morgan Logic (The Uselessness of Four-valuedness)

Bivalent Semantics for De Morgan Logic (The Uselessness of Four-valuedness) Bivalent Semantics for De Morgan Logic (The Uselessness of Four-valuedness) Jean-Yves Béziau Dedicated to Newton da Costa for his 79th birthday abstract. In this paper we present a bivalent semantics for

More information

185.A09 Advanced Mathematical Logic

185.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 information

Equivalents of Mingle and Positive Paradox

Equivalents of Mingle and Positive Paradox Eric Schechter Equivalents of Mingle and Positive Paradox Abstract. Relevant logic is a proper subset of classical logic. It does not include among itstheoremsanyof positive paradox A (B A) mingle A (A

More information

On the algebra of relevance logics

On the algebra of relevance logics On the algebra of relevance logics by Johann Joubert Wannenburg Submitted in partial fulfilment of the requirements for the degree Master of Science in the Faculty of Natural & Agricultural Sciences University

More information

Finite-valued Logics for Information Processing

Finite-valued Logics for Information Processing Fundamenta Informaticae XXI (2001) 1001 1028 1001 IOS Press Finite-valued Logics for Information Processing Arnon Avron School of Computer Science, Tel-Aviv University Tel-Aviv, Israel aa@tau.ac.il Beata

More information

Multiplicative Conjunction as an. ARNON AVRON, School of Mathematical Sciences, Sackler Faculty of

Multiplicative Conjunction as an. ARNON AVRON, School of Mathematical Sciences, Sackler Faculty of Multiplicative Conjunction as an Extensional Conjunction ARNON AVRON, School of Mathematical Sciences, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel. E-mail: aa@math.tau.ac.il

More information

Discrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams

Discrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams Contents : basic definitions and notation A set is an unordered collection of its elements (or members). The set is fully specified by its elements. Usually capital letters are used to name sets and lowercase

More information

Classical Gentzen-type Methods in Propositional Many-Valued Logics

Classical Gentzen-type Methods in Propositional Many-Valued Logics Classical Gentzen-type Methods in Propositional Many-Valued Logics Arnon Avron School of Computer Science Tel-Aviv University Ramat Aviv 69978, Israel email: aa@math.tau.ac.il Abstract A classical Gentzen-type

More information

RAMON JANSANA, ALESSANDRA PALMIGIANO UNIVERSITAT DE BARCELONA. 1. Introduction

RAMON JANSANA, ALESSANDRA PALMIGIANO UNIVERSITAT DE BARCELONA. 1. Introduction REFERENTIAL SEMANTICS : DUALITY AND APPLICATIONS RAMON JANSANA, ALESSANDRA PALMIGIANO UNIVERSITAT DE BARCELONA 1. Introduction Substitution-invariant consequence relations between sets of formulas and

More information

5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci

5-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 information

Ramon JANSANA, Alessandra PALMIGIANO REFERENTIAL SEMANTICS: DUALITY AND APPLICATIONS

Ramon JANSANA, Alessandra PALMIGIANO REFERENTIAL SEMANTICS: DUALITY AND APPLICATIONS REPORTS ON MATHEMATICAL LOGIC 41 (2006), 63 93 Ramon JANSANA, Alessandra PALMIGIANO REFERENTIAL SEMANTICS: DUALITY AND APPLICATIONS In memory of Willem Blok A b s t r a c t. In this paper, Wójcicki s characterization

More information

Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R +

Kazimierz 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 information

Propositional Logic Language

Propositional 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 information

From Bi-facial Truth to Bi-facial Proofs

From Bi-facial Truth to Bi-facial Proofs S. Wintein R. A. Muskens From Bi-facial Truth to Bi-facial Proofs Abstract. In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological

More information

Rules of Inference. Lecture 1 Tuesday, September 24. Rosalie Iemhoff Utrecht University, The Netherlands

Rules of Inference. Lecture 1 Tuesday, September 24. Rosalie Iemhoff Utrecht University, The Netherlands Rules of Inference Lecture 1 Tuesday, September 24 Rosalie Iemhoff Utrecht University, The Netherlands TbiLLC 2013 Gudauri, Georgia, September 23-27, 2013 1 / 26 Questions Given a theorem, what are the

More information

Monadic GMV -algebras

Monadic GMV -algebras Department of Algebra and Geometry Faculty of Sciences Palacký University of Olomouc Czech Republic TANCL 07, Oxford 2007 monadic structures = algebras with quantifiers = algebraic models for one-variable

More information

Multiset Consequence Relations

Multiset Consequence Relations Multiset Consequence Relations Francesco Paoli Gargnano, 27.08.15 Francesco Paoli (Univ. Cagliari) Multiset Gargnano, 27.08.15 1 / 71 Outline of this talk 1 The basics of algebraic logic 2 Substructural

More information

On the Craig interpolation and the fixed point

On the Craig interpolation and the fixed point On the Craig interpolation and the fixed point property for GLP Lev D. Beklemishev December 11, 2007 Abstract We prove the Craig interpolation and the fixed point property for GLP by finitary methods.

More information

Chapter I: Introduction to Mathematical Fuzzy Logic

Chapter I: Introduction to Mathematical Fuzzy Logic Chapter I: Introduction to Mathematical Fuzzy Logic LIBOR BĚHOUNEK, PETR CINTULA, AND PETR HÁJEK This chapter provides an introduction to the field of mathematical fuzzy logic, giving an overview of its

More information

DUALITIES, NATURAL AND OTHERWISE GAIA With acknowledgements, in particular, to Brian Davey and Leonardo Cabrer

DUALITIES, NATURAL AND OTHERWISE GAIA With acknowledgements, in particular, to Brian Davey and Leonardo Cabrer DUALITIES, NATURAL AND OTHERWISE Hilary Priestley Mathematical Institute, University of Oxford GAIA 2013 With acknowledgements, in particular, to Brian Davey and Leonardo Cabrer From Brian Davey s La Trobe

More information

Dynamic Epistemic Logic Displayed

Dynamic 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 information

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1 Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of

More information

Positive provability logic

Positive provability logic Positive provability logic Lev Beklemishev Steklov Mathematical Institute Russian Academy of Sciences, Moscow November 12, 2013 Strictly positive modal formulas The language of modal logic extends that

More information

REPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES

REPRESENTATION 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 information

NON-DETERMINISTIC SEMANTICS FOR LOGICAL SYSTEMS

NON-DETERMINISTIC SEMANTICS FOR LOGICAL SYSTEMS ARNON AVRON AND ANNA ZAMANSKY NON-DETERMINISTIC SEMANTICS FOR LOGICAL SYSTEMS 1.1 The Key Idea 1 INTRODUCTION The principle of truth-functionality (or compositionality) is a basic principle in many-valued

More information

A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS

A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS TOMMASO MORASCHINI Abstract. Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics.

More information

The model companion of the class of pseudo-complemented semilattices is finitely axiomatizable

The model companion of the class of pseudo-complemented semilattices is finitely axiomatizable The model companion of the class of pseudo-complemented semilattices is finitely axiomatizable (joint work with Regula Rupp and Jürg Schmid) Joel Adler joel.adler@phbern.ch Institut S1 Pädagogische Hochschule

More information

General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations

General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations OFER ARIELI AND ARNON AVRON, Department of Computer Science, School of Mathematical Sciences, Tel-Aviv University,

More information

With Question/Answer Animations. Chapter 2

With Question/Answer Animations. Chapter 2 With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of

More information

Two sources of explosion

Two sources of explosion Two sources of explosion Eric Kao Computer Science Department Stanford University Stanford, CA 94305 United States of America Abstract. In pursuit of enhancing the deductive power of Direct Logic while

More information

An Algebraic Proof of the Disjunction Property

An 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 information

Introduction to Kleene Algebras

Introduction to Kleene Algebras Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)

More information

Natural Implication and Modus Ponens Principle 1

Natural Implication and Modus Ponens Principle 1 УДК 164.043 + 510.644 N.E. Tomova Natural Implication and Modus Ponens Principle 1 Tomova Natalya Evgenyevna Department of Logic, Institute of Philosophy, Russian Academy of Sciences. Volkhonka 14/5, Moscow,

More information

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models

Hypersequent 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 information

SLANEY S LOGIC F IS CONSTRUCTIVE LOGIC WITH STRONG NEGATION

SLANEY 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 information

Part II Logic and Set Theory

Part II Logic and Set Theory Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

First-Degree Entailment

First-Degree Entailment March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?

More information

(Algebraic) Proof Theory for Substructural Logics and Applications

(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 information

Embedding from multilattice logic into classical logic and vice versa

Embedding from multilattice logic into classical logic and vice versa Journal of Logic and Computation Advance Access published June 18, 2016 Nonclassical logics corner Embedding from multilattice logic into classical logic and vice versa NORIHIRO KAMIDE, Department of Information

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Propositional Logic [1] Boolean algebras by examples U X U U = {a} U = {a, b} U = {a, b, c} {a} {b} {a, b} {a, c} {b, c}... {a} {b} {c} {a, b} {a} The arrows represents proper inclusion

More information

Arnon Avron. School of Mathematical Sciences. Sackler Faculty of Exact Sciences. Tel Aviv University. Tel Aviv 69978, Israel.

Arnon Avron. School of Mathematical Sciences. Sackler Faculty of Exact Sciences. Tel Aviv University. Tel Aviv 69978, Israel. Multiplicative Conjunction as an Extensional Conjunction Arnon Avron School of Mathematical Sciences Sackler Faculty of Exact Sciences Tel Aviv University Tel Aviv 69978, Israel Abstract We show that the

More information

Set Theory. p p (COMP) Manuel Bremer Centre for Logic, Language and Information

Set Theory. p p (COMP) Manuel Bremer Centre for Logic, Language and Information Set Theory Apart from semantic closure set theory is one of the main motivations for the strong paraconsistent approach. As well as we take convention (T) to be basic for truth so do we take the naive

More information

The overlap algebra of regular opens

The overlap algebra of regular opens The overlap algebra of regular opens Francesco Ciraulo Giovanni Sambin Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called overlap. The new notion of overlap

More information

LOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC

LOGIC 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 information

NEGATION: TWO POINTS OF VIEW. Arnon Avron. Department of Computer Science. Sackler Faculty of Exact Sciences

NEGATION: TWO POINTS OF VIEW. Arnon Avron. Department of Computer Science. Sackler Faculty of Exact Sciences NEGATION: TWO POINTS OF VIEW Arnon Avron Department of Computer Science Sackler Faculty of Exact Sciences Tel Aviv University, Ramat Aviv, Israel 69978 1 Introduction In this paper we look at negation

More information

Sequent calculi of quantum logic with strict implication

Sequent calculi of quantum logic with strict implication CTFM 2015 9/7 Sequent calculi of quantum logic with strict implication Tokyo Institute of Technology Graduate School of Information Science and Engineering Tomoaki Kawano About quantum logic Sequent calculi

More information

Equivalent Types in Lambek Calculus and Linear Logic

Equivalent Types in Lambek Calculus and Linear Logic Equivalent Types in Lambek Calculus and Linear Logic Mati Pentus Steklov Mathematical Institute, Vavilov str. 42, Russia 117966, Moscow GSP-1 MIAN Prepublication Series for Logic and Computer Science LCS-92-02

More information

More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic

More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences Computability and Logic Equivalences Involving Conditionals Some Important Equivalences Involving Conditionals

More information

ON A SUBSTRUCTURAL LOGIC WITH MINIMAL NEGATION. Abstract

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 information

which correspond to bilattices in an essential way. For this goal we introduce the notion of logical

which correspond to bilattices in an essential way. For this goal we introduce the notion of logical Reasoning with Logical Bilattices Ofer Arieli and Arnon Avron Department of Computer Science, School of Mathematical Sciences Tel-Aviv University Ramat-Aviv 69978, Israel. Email: fofera,aag@math.tau.ac.il

More information

On Urquhart s C Logic

On 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 information

Vague and Uncertain Entailment: Some Conceptual Clarifications

Vague and Uncertain Entailment: Some Conceptual Clarifications Conditionals, Counterfactuals, and Causes in Uncertain Environments Düsseldorf, May 2011 Vague and Uncertain Entailment: Some Conceptual Clarifications Chris Fermüller TU Wien, Austria Overview How does

More information

Multiplicative 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 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 information

Semantical Analysis of Weak Kleene Logics

Semantical Analysis of Weak Kleene Logics Semantical Analysis of Weak Kleene Logics Roberto Ciuni Massimiliano Carrara Department FISPPA, Section of Philosophy, University of Padova Abstract This paper presents a semantical analysis of the Weak

More information

The Method of Socratic Proofs for Normal Modal Propositional Logics

The Method of Socratic Proofs for Normal Modal Propositional Logics Dorota Leszczyńska The Method of Socratic Proofs for Normal Modal Propositional Logics Instytut Filozofii Uniwersytetu Zielonogórskiego w Zielonej Górze Rozprawa doktorska napisana pod kierunkiem prof.

More information

Meaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have

Meaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have INTENSIONAL AND MODAL LOGIC Meaning and Reference Why do we consider extensions to the standard logical language(s)? Requirements of knowledge representation / domain modelling Intensional expressions:

More information

Propositional Logic: Models and Proofs

Propositional Logic: Models and Proofs Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505

More information

The quest for the basic fuzzy logic

The 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 information

ADMISSIBILITY OF ACKERMANN S RULE δ IN RELEVANT LOGICS

ADMISSIBILITY OF ACKERMANN S RULE δ IN RELEVANT LOGICS Logic and Logical Philosophy Volume 22 (2013), 411 427 DOI: 10.12775/LLP.2013.018 Gemma Robles ADMISSIBILITY OF ACKERMANN S RULE δ IN RELEVANT LOGICS Abstract. It is proved that Ackermann s rule δ is admissible

More information

Proof Theoretical Studies on Semilattice Relevant Logics

Proof 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 information

A Sequent-Based Representation of Logical Argumentation

A Sequent-Based Representation of Logical Argumentation A Sequent-Based Representation of Logical Argumentation Ofer Arieli School of Computer Science, The Academic College of Tel-Aviv, Israel. oarieli@mta.ac.il Abstract. In this paper we propose a new presentation

More information

SUPERPRODUCTS, HYPERIDENTITIES, AND ALGEBRAIC STRUCTURES OF LOGIC PROGRAMMING

SUPERPRODUCTS, HYPERIDENTITIES, AND ALGEBRAIC STRUCTURES OF LOGIC PROGRAMMING SUPERPRODUCTS, HYPERIDENTITIES, AND ALGEBRAIC STRUCTURES OF LOGIC PROGRAMMING YU.M.MOVSISYAN 1, A.B.ROMANOWSKA 2, AND J.D.H.SMITH 3 Abstract. Recent developments in logic programming are based on bilattices

More information

Classical Propositional Logic

Classical Propositional Logic The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,

More information

Characterizing Logical Consequence in Paraconsistent Weak Kleene

Characterizing Logical Consequence in Paraconsistent Weak Kleene Characterizing Logical Consequence in Paraconsistent Weak Kleene Roberto Ciuni Massimiliano Carrara Abstract. In this paper we present Parconsistent Weak Kleene (PWK), a logic that first appeared in the

More information

REL EVANT DERIVABIL ITY A ND CLASSICAL DERIVABILITY IN FITCH-STYLE AND AXIOMATIC FORMULATIONS OF RELEVANT LOGICS

REL EVANT DERIVABIL ITY A ND CLASSICAL DERIVABILITY IN FITCH-STYLE AND AXIOMATIC FORMULATIONS OF RELEVANT LOGICS REL EVANT DERIVABIL ITY A ND CLASSICAL DERIVABILITY IN FITCH-STYLE AND AXIOMATIC FORMULATIONS OF RELEVANT LOGICS Diderik BATENS and Jean Paul VAN BENDEGEM I. I t is well-known that Alan Ross Anderson and

More information

arxiv: v1 [math.lo] 3 Dec 2018

arxiv: v1 [math.lo] 3 Dec 2018 arxiv:181200983v1 [mathlo] 3 Dec 2018 A General Axiomatization for the logics of the Hierarchy I n P k Víctor Fernández Basic Sciences Institute (Mathematical Area) Philosophy College National University

More information

Vanderbilt University

Vanderbilt University Vanderbilt University Department of Mathematics Shanks Workshop on Ordered Groups in Logic Booklet of Abstracts Editor George Metcalfe March 21 22, 2009 Table of contents Semilinear logics Petr Cintula

More information

A Tableau Style Proof System for Two Paraconsistent Logics

A Tableau Style Proof System for Two Paraconsistent Logics Notre Dame Journal of Formal Logic Volume 34, Number 2, Spring 1993 295 A Tableau Style Proof System for Two Paraconsistent Logics ANTHONY BLOESCH Abstract This paper presents a tableau based proof technique

More information

KLEENE LOGIC AND INFERENCE

KLEENE LOGIC AND INFERENCE Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. The

More information