A four-valued frame semantics for relevant logic

Size: px
Start display at page:

Download "A four-valued frame semantics for relevant logic"

Transcription

1 A four-valued frame semantics for relevant logic Takuro Onishi (Kyoto University) Kyoto Workshop on Dialetheism and Paraconsistency October

2 Background Negation as negative modal operator Do sen 1986; Dunn 1999; Restall 1999; Berto 2015 etc. Dualist view of negation (2015) Negation as impossibility and unnecessity: defined by binary relations of compatibility and exhaustiveness Definition of Routley star in terms of twin binary relations Implicationalization of relevant negation (2016) Definition of twin binary relations in terms of twin ternary relations Application to four-valued semantics for relevant logic

3 1 Two plans in the semantics of relevant logic 2 Routley s American plan 3 Making sense of star

4 Fallacies of relevance B A B A B B A A B A A B (A B) (B A) A B B Classically valid even if there is no connection between the content of A and B

5 Australian plan Routley-Meyer semantics (1972) Implication: ternary relation R on a frame. x = A B y, z : Rxyz & y = A z = B. Negation: the Routley star. x = A x = A. Criticized for lack of intuitive interpretation (Copeland 1979; van Benthem 1979, etc.)

6 American plan Four-valued semantics (Dunn 1966, 1976; Belnap 1977) A B is true A is true and B is true A B is false A is false or B is false A B is true A is true or B is true A B is false A is false and B is false A is true A is false A is false A is true Classical semantic clauses (esp. for negation) Truth and falsity are independent Weak in treatment of implication

7 Four-valued frame semantics Integration of two plans: Elegant explanation of implication by ternary relation Classical semantic clause for negation (avoiding Routley star) Routley 1984; Priest and Sylvan 1992; Restall 1995; Mares Based on Routley s version, I present a simpler and conceptually less problematic one.

8 1 Two plans in the semantics of relevant logic 2 Routley s American plan 3 Making sense of star

9 Four-valued frame semantics In American plan completed (Routley 1984). x = + A B x = + A and x = + B x = A B x = A or x = B x = + A B x = + A or x = + B x = A B x = A and x = B x = + A x = A x = A x = + A Truth and falsehood relativized to states. Classical clause for negation preserved.

10 Truth and falsity of implication Twin ternary relations for truth and falsehood of implication: x = + A B y, z : Rxyz & y = + A z = + B x = A B y, z : Syxz & y = B & z = A (the order of arguments in Syxz changed from Routley s)

11 Frame for the basic relevant logic B Definition A B-frame is a structure 0, 0, U, V, K, R, S such that: K: set of states 0 U K: set of regular states 0 V K: set of coregular states R, S K 3 with a few conditions. A B-model is a B-frame equipped with a twin valuation = +, =.

12 Validity A is 2-valid in a frame if 0 = + A and 0 = A for any valuation = +, =. Theorem (Routley 1984) A is 2-valid in all frames if and only if A is provable in B.

13 Positive extensions A B.B C.A C { u : Rxyu & Ruwz v : Ryvz & Rxwv corresponds u : Sxuy & Suwz v : Sxzv & Svwy A.A B B { Rxyz Ryxz corresponds Sxyz Sxzy etc. Axioms defines or corresponds to structural constraints on ternary relations.

14 Negative extensions A B. B A (If A is true then B is true) implies (if B is false then A is false)? Structural constraints on ternary relations are not enough. Cross-over between truth and falsity is required.

15 Options (1) Doubling of -rules: x = + A B y, z :Rxyz (similarly for the falsity condition.) (2) Star imitation x : (3) Mixture of (1) and (2) x = + p x = p { y = + A z = + B y = B z = A

16 Doubling alone is not sufficient to model Reductio (A A A), Assertion (A (A B).A B), etc. Star imitation required. But their mixture causes nightmarish complication. Star imitation without doubling looks promising. But the point of four-valued setting was to avoid the use of star-like operation. Let us make sense of star operation in terms of ternary relations.

17 1 Two plans in the semantics of relevant logic 2 Routley s American plan 3 Making sense of star

18 Compatibility and exhaustiveness x = + p x = p (1) x = + p x = p: x and x are compatible. (2) x = + p x = p: x and x are jointly exhaustive

19 Negation as impossibility and the star postulate x = A y : xcy y = A. A is impossible at x iff it is not true at any state y that is compatible with x. Under symmetry of C and the star postulate x y : xcy & z : xcz z y, Routley star is definable and is de Morgan negation (Mares 1995, 2004; Restall 2000).

20 Negation as unnecessity x = A y : xey & y = A. A is unnecessary at x iff it is not true at some state that is jointly exhaustive with x. The axiom A A makes and de Morgan negation (under the assumption of symmetry of C and E). This corresponds to the dualist star postulate.

21 Dualist star postulate (Onishi 2015) The star state x is characterized as the maximally compatible and minimally exhaustive mate state of x. E x E C x C x y : xcy & xey & ( z : xcz z y & xez y z).

22 Routley star can be understood as a special case of the twin binary relations What is it that two states are compatible with each other or jointly exhaustive?

23 Regular and coregular state Recall the complete theorem: A is provable 0 = + A and 0 = A in any frame. Regular state 0 supports every logical truth Coregular state 0 never makes a logical error

24 Information-theoretic interpretation +A B x +A y R z +B [T]he combination of the pieces of information in x and y... is a piece of information in z. (Dunn and Restall 2002)

25 Fusion (intensional conjunction) +A x +B y R z +A B z = + A B x, y : Rxyz & x = + A & y = + B

26 Defining compatibility x y R 0 Any combination of information from x and y is not a logical error / does not cause any logical clash. x and y are (logically) compatible. xcy def = Rxy0 (or u V : Rxyu)

27 Fission (intensional disjunction) A B := ( A B) +A B x y S z +A or +B ( x = A B y, z : Sxyz y = + A or z = + B )

28 Defining exhaustiveness +A B 0 +A y S or z +B Suppose A B is a logical truth, i.e., logically A or B. In S0yz, y and z jointly exhaust the logical possibilities. yez def = S0yz (or u U : Suyz)

29 Constraint on valuation xcy def = Rxy0 xey def = S0xy We assume C and E are symmetric (for simplicity): (Sym) xcy ycx xey yex The following constraint on valuation should be natural: (C) (E) xcy & x = + p y = p xey & x = + p y = p

30 Extension of (C) and (E) Proposition Suppose that a B-frame F satisfies: (GS1) (GS2) (GS3) (GS4) Sxyz & ycw = Rxwz; Rxwz = y : ycw & Sxyz; Rxyz & xew = Syzw; Syzw = x : xew & Rxyz. Then the constraints (C) and (E) on a valuation on F extend to arbitrary formulas. (GS for Generalized Star postulate)

31 Star is definable Lemma (dualist star postulate) In a frame satisfying (Sym) and (GS1,2) or (GS3,4), the dualist star postulate holds: E x E C y C x y : xcy & xey & ( z : xcz z y & xez y z).

32 Define x to be that y. Then, Moreover, x y y x and x = x. Syzx Rxyz Sxy z. Extendability of (C) and (E) is immediately proved by these equivalences. And they are summarized as: x = + A x = A, because x is compatible and jointly exhaustive with x.

33 Negative extensions A B. B A corresponds Rxyz Rxz y and Sxyz Syz x A A A corresponds Rxx x and Sxxx etc.

34 What is the logic with GS? Definition A GS-frame is a B-frame that satisfies (GS1-4) and (Sym). A GS-model is a GS-frame equipped with a twin valuation = +, = that satisfies (C) and (E). Proposition The logic defined by the class of GS-models is equivalent to the one defined by the class of two-valued B-models that satisfies Rxyz Ryz x.

35 What GS is We say that A 2-entails B (A B) if x = + A x = + B and x = B x = A for any x in any model. GS1-4 corresponds to the two-way rule: A B C A B f C (GS) where f is the false constant such that 0 = f and 0 = + f. A B + C A + B f C (GS1) A + B f C A B + C (GS2) A B C A B f C (GS3) A B f C A B C (GS4)

36 What GS is A B C (GS) A B f C is a special case of classical rule for implication: A B D C A B D C or X, B D, Y X B D, Y ( R )

37 What GS does Definability of Routley star Extendability of (C) and (E) Implicationalization of negation: A A f

38 Conclusion Modification of Routley s American plan Twin ternary relations Generalized star postulate

Relevance Logic as an Information-Based Logic. J. Michael Dunn Indiana University Bloomington

Relevance Logic as an Information-Based Logic. J. Michael Dunn Indiana University Bloomington Relevance Logic as an Information-Based Logic J. Michael Dunn Indiana University Bloomington The Founders of Relevance Logic Ivan Orlov (1928) Calculus of Combatibility. Orlov s pioneering work was effectively

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

Relevant Logic. Daniel Bonevac. March 20, 2013

Relevant Logic. Daniel Bonevac. March 20, 2013 March 20, 2013 The earliest attempts to devise a relevance logic that avoided the problem of explosion centered on the conditional. FDE, however, has no conditional operator, or a very weak one. If we

More information

Perp and Star in the Light of Modal Logic

Perp and Star in the Light of Modal Logic Perp and Star in the Light of Modal Logic Chunlai Zhou July 8, 2004 Abstract This paper is an exploration in the light of modal logic of Dunn s ideas about two treatments of negation in non-classical logics:

More information

Defining Double Negation Elimination

Defining Double Negation Elimination Defining Double Negation Elimination GREG RESTALL, Department of Philosophy, Macquarie University, Sydney 2109, Australia. Email: Greg.Restall@mq.edu.au. Web: http://www.phil.mq.edu.au/staff/grestall/

More information

overview overview proof system for basic modal logic proof systems advanced logic lecture 8 temporal logic using temporal frames

overview overview proof system for basic modal logic proof systems advanced logic lecture 8 temporal logic using temporal frames overview advanced logic 2018 02 28 lecture 8 proof systems temporal logic using temporal frames overview proof system for basic modal logic extension: φ if φ is a tautology from prop1 proof systems temporal

More information

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

To every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.

To every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied. Modal Logic (2) There appeared to be a correspondence between the validity of Φ Φ and the property that the accessibility relation R is reflexive. The connection between them is that both relied on the

More information

Modal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014

Modal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014 Modal Logic UIT2206: The Importance of Being Formal Martin Henz March 19, 2014 1 Motivation The source of meaning of formulas in the previous chapters were models. Once a particular model is chosen, say

More information

Normal Forms of Propositional Logic

Normal Forms of Propositional Logic Normal Forms of Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 12, 2017 Bow-Yaw Wang (Academia Sinica) Normal Forms of Propositional Logic September

More information

Outline. 1 Background and Aim. 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion

Outline. 1 Background and Aim. 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion Outline 1 Background and Aim 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016

More information

CS156: The Calculus of Computation

CS156: The Calculus of Computation CS156: The Calculus of Computation Zohar Manna Winter 2010 It is reasonable to hope that the relationship between computation and mathematical logic will be as fruitful in the next century as that between

More information

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency

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

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets

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

Boolean bunched logic: its semantics and completeness

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

Неклассическая логика Non-classical Logic. Game Theoretical Semantic for Relevant Logic 1

Неклассическая логика Non-classical Logic. Game Theoretical Semantic for Relevant Logic 1 Логические исследования Logical Investigations 2015. Т. 21. 2. С. 42 52 2015, vol. 21, no 2, pp. 42 52 УДК 510.649 Неклассическая логика Non-classical Logic V.L. Vasukov Game Theoretical Semantic for Relevant

More information

Part XII RELEVANCE AND PARACONSISTENT LOGICS

Part XII RELEVANCE AND PARACONSISTENT LOGICS Part XII RELEVANCE AND PARACONSISTENT LOGICS 38 Relevance Logic EDWIN D. MARES 1 Non-Sequiturs are Bad Since 1993, when Andrew Wiles completed his difficult proof of Fermat s Last Theorem, mathematicians

More information

Chapter 4: Classical Propositional Semantics

Chapter 4: Classical Propositional Semantics Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical

More information

Propositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac.

Propositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac. January 22, 2013 Modal logic is, among other things, the logic of possibility and necessity. Its history goes back at least to Aristotle s discussion of modal syllogisms in the Prior Analytics. But modern

More information

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof. Overview I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof. Propositional formulas Grammar: ::= p j (:) j ( ^ )

More information

Chapter 11: Automated Proof Systems (1)

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

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows. Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is

More information

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called

More information

The Calculus of Computation: Decision Procedures with Applications to Verification. Part I: FOUNDATIONS. by Aaron Bradley Zohar Manna

The Calculus of Computation: Decision Procedures with Applications to Verification. Part I: FOUNDATIONS. by Aaron Bradley Zohar Manna The Calculus of Computation: Decision Procedures with Applications to Verification Part I: FOUNDATIONS by Aaron Bradley Zohar Manna 1. Propositional Logic(PL) Springer 2007 1-1 1-2 Propositional Logic(PL)

More information

Deductive Systems. Lecture - 3

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

Modal Logic: Exercises

Modal Logic: Exercises Modal Logic: Exercises KRDB FUB stream course www.inf.unibz.it/ gennari/index.php?page=nl Lecturer: R. Gennari gennari@inf.unibz.it June 6, 2010 Ex. 36 Prove the following claim. Claim 1. Uniform substitution

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

Natural Deduction for Propositional Logic

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

Paraconsistent Logic, Evidence, and Justification

Paraconsistent Logic, Evidence, and Justification Paraconsistent Logic, Evidence, and Justification Melvin Fitting December 24, 2016 Abstract In a forthcoming paper, Walter Carnielli and Abilio Rodriguez propose a Basic Logic of Evidence (BLE) whose natural

More information

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook) Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

More information

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.

More information

Language of Propositional Logic

Language of Propositional Logic Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called

More information

Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

More information

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

2. The Logic of Compound Statements Summary. Aaron Tan August 2017 2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional

More information

Truth-Functional Logic

Truth-Functional Logic Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence

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

RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC

RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC Bulletin of the Section of Logic Volume 10/4 (1981), pp. 185 190 reedition 2009 [original edition, pp. 185 191] Newton C. A. da Costa Elias H. Alves RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED

More information

Proofs. Joe Patten August 10, 2018

Proofs. Joe Patten August 10, 2018 Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital

More information

Semantics and Pragmatics of NLP

Semantics and Pragmatics of NLP Semantics and Pragmatics of NLP Alex Ewan School of Informatics University of Edinburgh 28 January 2008 1 2 3 Taking Stock We have: Introduced syntax and semantics for FOL plus lambdas. Represented FOL

More information

02 Propositional Logic

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

Modal logics and their semantics

Modal logics and their semantics Modal logics and their semantics Joshua Sack Department of Mathematics and Statistics, California State University Long Beach California State University Dominguez Hills Feb 22, 2012 Relational structures

More information

Inducing syntactic cut-elimination for indexed nested sequents

Inducing syntactic cut-elimination for indexed nested sequents Inducing syntactic cut-elimination for indexed nested sequents Revantha Ramanayake Technische Universität Wien (Austria) IJCAR 2016 June 28, 2016 Revantha Ramanayake (TU Wien) Inducing syntactic cut-elimination

More information

Preface to the First Edition. xxvii 0.1 Set-theoretic Notation xxvii 0.2 Proof by Induction xxix 0.3 Equivalence Relations and Equivalence Classes xxx

Preface to the First Edition. xxvii 0.1 Set-theoretic Notation xxvii 0.2 Proof by Induction xxix 0.3 Equivalence Relations and Equivalence Classes xxx Table of Preface to the First Edition Preface to the Second Edition page xvii xxi Mathematical Prolegomenon xxvii 0.1 Set-theoretic Notation xxvii 0.2 Proof by Induction xxix 0.3 Equivalence Relations

More information

Grammatical resources: logic, structure and control

Grammatical resources: logic, structure and control Grammatical resources: logic, structure and control Michael Moortgat & Dick Oehrle 1 Grammatical composition.................................. 5 1.1 Grammar logic: the vocabulary.......................

More information

Logic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae

Logic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae Logic and Discrete Mathematics Section 3.5 Propositional logical equivalence Negation of propositional formulae Slides version: January 2015 Logical equivalence of propositional formulae Propositional

More information

Semantic Metatheory of SL: Mathematical Induction

Semantic Metatheory of SL: Mathematical Induction Semantic Metatheory of SL: Mathematical Induction Preliminary matters: why and when do we need Mathematical Induction? We need it when we want prove that a certain claim (n) holds for all n N (0, 1, 2,

More information

Nāgārjuna s Logic. Aaron J. Cotnoir

Nāgārjuna s Logic. Aaron J. Cotnoir Nāgārjuna s Logic Aaron J. Cotnoir 1 Nāgārjuna and the Catuskoti The traditional dominant view in Western philosophy is that truth and falsity are semantic categories that exhaust, without overlap, all

More information

Semantics of intuitionistic propositional logic

Semantics of intuitionistic propositional logic Semantics of intuitionistic propositional logic Erik Palmgren Department of Mathematics, Uppsala University Lecture Notes for Applied Logic, Fall 2009 1 Introduction Intuitionistic logic is a weakening

More information

CS156: The Calculus of Computation Zohar Manna Autumn 2008

CS156: The Calculus of Computation Zohar Manna Autumn 2008 Page 3 of 52 Page 4 of 52 CS156: The Calculus of Computation Zohar Manna Autumn 2008 Lecturer: Zohar Manna (manna@cs.stanford.edu) Office Hours: MW 12:30-1:00 at Gates 481 TAs: Boyu Wang (wangboyu@stanford.edu)

More information

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010) http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

More information

Nested Epistemic Logic Programs

Nested Epistemic Logic Programs Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and

More information

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom. Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes

More information

Dynamic Epistemic Logic in Update Logic

Dynamic Epistemic Logic in Update Logic Dynamic Epistemic Logic in Update Logic Guillaume Aucher To cite this version: Guillaume Aucher. Dynamic Epistemic Logic in Update Logic. Journal of Logic and Computation, Oxford University Press (OUP),

More information

Relevance Logic. Hans Halvorson. December 21, New Dec 16: Updated section on possible worlds semantics.

Relevance Logic. Hans Halvorson. December 21, New Dec 16: Updated section on possible worlds semantics. Relevance Logic Hans Halvorson December 21, 2007 New Dec 16: Updated section on possible worlds semantics 1 Structural rules Definition 11 The collection of dependencies is defined inductively (Base case)

More information

RELEVANT RESTRICTED QUANTIFICATION

RELEVANT RESTRICTED QUANTIFICATION Journal of Philosophical Logic (2006) DOI: 10.1007/s10992-005-9008-5 # Springer 2006 JC BEALL, ROSS T. BRADY, A. P. HAZEN, GRAHAM PRIEST and GREG RESTALL RELEVANT RESTRICTED QUANTIFICATION Received 04

More information

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

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

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

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

Equational Logic: Part 2. Roland Backhouse March 6, 2001

Equational Logic: Part 2. Roland Backhouse March 6, 2001 1 Equational Logic: Part 2 Roland Backhouse March 6, 2001 Outline 2 We continue the axiomatisation of the propositional connectives. The axioms for disjunction (the logical or of two statements) are added

More information

First Degree Entailment

First Degree Entailment First Degree Entailment Melvin Fitting March 30, 2018 1 Truth Tables First Degree Entailment is a four-valued logic whose importance has become ever more apparent over the years. It arose out of work on

More information

Relevant Agents. Ondrej Majer. Institute of Philosophy, Academy of Sciences of the Czech Republic Jilská 1, Prague 1.

Relevant Agents. Ondrej Majer. Institute of Philosophy, Academy of Sciences of the Czech Republic Jilská 1, Prague 1. Relevant Agents Marta Bílková Department of Logic, Charles University in Prague; Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou věží 2,18 2 07 Prague 8 Ondrej

More information

Propositional Logic Review

Propositional Logic Review Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining

More information

Tecniche di Verifica. Introduction to Propositional Logic

Tecniche di Verifica. Introduction to Propositional Logic Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called

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

Semantics Basics for Syntacticians

Semantics Basics for Syntacticians Department of Linguistics Ohio State University January 19, 2012 Expressions, Utterances, and Meanings (1/2) We distinguish expressions from utterances (uses of expressions in specific circumstances).

More information

Comp487/587 - Boolean Formulas

Comp487/587 - Boolean Formulas Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested

More information

Notes on Inference and Deduction

Notes on Inference and Deduction Notes on Inference and Deduction Consider the following argument 1 Assumptions: If the races are fixed or the gambling houses are crooked, then the tourist trade will decline. If the tourist trade declines

More information

The Axiomatic Method in Social Choice Theory:

The Axiomatic Method in Social Choice Theory: The Axiomatic Method in Social Choice Theory: Preference Aggregation, Judgment Aggregation, Graph Aggregation Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss

More information

On truth, abnormal worlds, and necessity

On truth, abnormal worlds, and necessity On truth, abnormal worlds, and necessity Jc Beall 1 Introduction Various semantic theories (e.g., truth, exemplification, and more) are underwritten by so-called depth-relevant logics. Such logics afford

More information

Epistemic Modals and Informational Consequence

Epistemic Modals and Informational Consequence Epistemic Modals and Informational Consequence [This is a penultimate draft. Please quote only from the published version. The paper is already available through Online First at http://www.springerlink.com/content/0039-7857]

More information

Logic: Propositional Logic (Part I)

Logic: Propositional Logic (Part I) Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.

More information

Inference in Propositional Logic

Inference in Propositional Logic Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located

More information

pluralism and proofs

pluralism and proofs pluralism and proofs Greg Restall Philosophy Department, The University of Melbourne restall@unimelb.edu.au August 2011 Abstract Beall and Restall s Logical Pluralism [2] characterises pluralism about

More information

Chapter 11: Automated Proof Systems

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

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

What is Logic? Introduction to Logic. Simple Statements. Which one is statement? What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo

More information

Propositional Logic Arguments (5A) Young W. Lim 11/8/16

Propositional Logic Arguments (5A) Young W. Lim 11/8/16 Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

Semantics for Propositional Logic

Semantics for Propositional Logic Semantics for Propositional Logic An interpretation (also truth-assignment, valuation) of a set of propositional formulas S is a function that assigns elements of {f,t} to the propositional variables in

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

A Tableau Calculus for Minimal Modal Model Generation

A Tableau Calculus for Minimal Modal Model Generation M4M 2011 A Tableau Calculus for Minimal Modal Model Generation Fabio Papacchini 1 and Renate A. Schmidt 2 School of Computer Science, University of Manchester Abstract Model generation and minimal model

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 Note on Graded Modal Logic

A Note on Graded Modal Logic A Note on Graded Modal Logic Maarten de Rijke Studia Logica, vol. 64 (2000), pp. 271 283 Abstract We introduce a notion of bisimulation for graded modal logic. Using these bisimulations the model theory

More information

Conjunctive Normal Form and SAT

Conjunctive Normal Form and SAT Notes on Satisfiability-Based Problem Solving Conjunctive Normal Form and SAT David Mitchell mitchell@cs.sfu.ca October 4, 2015 These notes are a preliminary draft. Please use freely, but do not re-distribute

More information

Glossary of Logical Terms

Glossary of Logical Terms Math 304 Spring 2007 Glossary of Logical Terms The following glossary briefly describes some of the major technical logical terms used in this course. The glossary should be read through at the beginning

More information

2.2: Logical Equivalence: The Laws of Logic

2.2: Logical Equivalence: The Laws of Logic Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q

More information

Propositional Logic: Equivalence

Propositional Logic: Equivalence Propositional Logic: Equivalence Alice Gao Lecture 5 Based on work by J. Buss, L. Kari, A. Lubiw, B. Bonakdarpour, D. Maftuleac, C. Roberts, R. Trefler, and P. Van Beek 1/42 Outline Propositional Logic:

More information

Relevant and Substructural Logics

Relevant and Substructural Logics Relevant and Substructural Logics GREG RESTALL PHILOSOPHY DEPARTMENT, MACQUARIE UNIVERSITY Greg.Restall@mq.edu.au June 23, 2001 http://www.phil.mq.edu.au/staff/grestall/ Abstract: This is a history of

More information

Introduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010

Introduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Introduction to Artificial Intelligence Propositional Logic & SAT Solving UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Today Representation in Propositional Logic Semantics & Deduction

More information

Decision Procedures for Satisfiability and Validity in Propositional Logic

Decision Procedures for Satisfiability and Validity in Propositional Logic Decision Procedures for Satisfiability and Validity in Propositional Logic Meghdad Ghari Institute for Research in Fundamental Sciences (IPM) School of Mathematics-Isfahan Branch Logic Group http://math.ipm.ac.ir/isfahan/logic-group.htm

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

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false. Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency

More information

CSC Discrete Math I, Spring Propositional Logic

CSC Discrete Math I, Spring Propositional Logic CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

More information

Module 1. Integers, Induction, and Recurrences

Module 1. Integers, Induction, and Recurrences Module 1. Integers, Induction, and Recurrences This module will look at The integers and the natural numbers. Division and divisors, greatest common divisors Methods of reasoning including proof by contradiction

More information

PHIL12A Section answers, 16 February 2011

PHIL12A Section answers, 16 February 2011 PHIL12A Section answers, 16 February 2011 Julian Jonker 1 How much do you know? 1. Show that the following sentences are equivalent. (a) (Ex 4.16) A B A and A B A B (A B) A A B T T T T T T T T T T T F

More information

Logic for Computer Science - Week 4 Natural Deduction

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

On the ternary relation and conditionality

On the ternary relation and conditionality On the ternary relation and conditionality Jc Beall, Ross Brady, Michael Dunn, Allen Hazen, Edwin Mares, Robert K. Meyer, Graham Priest, Greg Restall, David Ripley, John Slaney, and Richard Sylvan (formerly

More information

Module 5 K and Equivalent Systems

Module 5 K and Equivalent Systems Module 5 K and Equivalent Systems G. J. Mattey July 8, 2010 Contents 1 The Semantical System KI 2 1.1 Specification of KI....................................... 2 1.2 Semantical Properties and Relations

More information

Proving Completeness for Nested Sequent Calculi 1

Proving Completeness for Nested Sequent Calculi 1 Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there

More information

Compound Propositions

Compound Propositions Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth

More information

Part 1: Propositional Logic

Part 1: Propositional Logic Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax

More information