Presented By: Kishaloy Halder (10305022) Bikash Chandra (10305082) Kaustav Das (10305024) 14 November 2010.

Slides:



Advertisements
Similar presentations
Reason and Argument Chapter 1. Claims A claim takes the form of a proposition. A proposition has a similar relation to a sentence as a number does to.
Advertisements

1 Knowledge Representation Introduction KR and Logic.
Introduction to Proofs
Basics A (finite) set N of individual voters i, j, k etc. Assume that |N| = n Basic language L: generated by the grammar φ: p | ~φ | ψ ˄ χ from a set A.
Possible World Semantics for Modal Logic
Introduction to Theorem Proving
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
Kaplan’s Theory of Indexicals
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
Chapter Twelve: The Fact-Value Problem Chapter Twelve: The Fact-Value Problem Metaethics ► Philosophizing about the very terms of ethics ► Considering.
Logic Concepts Lecture Module 11.
CLASSICAL LOGIC and FUZZY LOGIC. CLASSICAL LOGIC In classical logic, a simple proposition P is a linguistic, or declarative, statement contained within.
Fuzzy Logic Frank Costanzo – MAT 7670 Spring 2012.
Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
From Chapter 4 Formal Specification using Z David Lightfoot
Knoweldge Representation & Reasoning
Let remember from the previous lesson what is Knowledge representation
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Discussion #9 1/9 Discussion #9 Tautologies and Contradictions.
EE1J2 – Discrete Maths Lecture 4 Analysis of arguments Logical consequence Rules of deduction Rules of equivalence Formal proof of arguments See: Anderson,
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
Of 33 lecture 12: propositional logic – part I. of 33 propositions and connectives … two-valued logic – every sentence is either true or false some sentences.
Propositional Logic Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma Guadalajara
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
Theory and Applications
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
CS6133 Software Specification and Verification
Artificial Intelligence 2004 Non-Classical Logics Non-Classical Logics Specific Language Constructs added to classic FOPL Different Types of Logics.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
Propositional Logic Predicate Logic
 Semiotics – the general study of signs.  It is divided into three branches: 1) semantics concerning realtions between signs and things they refer to.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Of 38 lecture 13: propositional logic – part II. of 38 propositional logic Gentzen system PROP_G design to be simple syntax and vocabulary the same as.
What is Reasoning  Logical reasoning is the process of drawing conclusions from premises using rules of inference.  These inference rules are results.
1 Propositional Logic: Fundamental Elements for Computer Scientists 0. Motivation for Computer Scientists 1. Propositions and Propositional Variables 2.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
1 Lecture 3 The Languages of K, T, B and S4. 2 Last time we extended the language PC to the language S5 by adding two new symbols ‘□’ (for ‘It is necessary.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Knowledge Representation and Inference Dr Nicholas Gibbins 32/3019.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 4- Logic.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Lecture 6 Modality: Possible worlds
Lecture 2 The Language of S5
Advanced Algorithms Analysis and Design
CLASSICAL LOGIC and FUZZY LOGIC
CS 270 Math Foundations of CS
The Method of Deduction
CSNB234 ARTIFICIAL INTELLIGENCE
Foundations of Discrete Mathematics
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Artificial Intelligence 2004 Non-Classical Logics
CIS Monthly Seminar – Software Engineering and Knowledge Management IS Enterprise Modeling Ontologies Presenter : Dr. S. Vasanthapriyan Senior Lecturer.
Presentation transcript:

Presented By: Kishaloy Halder ( ) Bikash Chandra ( ) Kaustav Das ( ) 14 November 2010

 Introduction  Description  Logical Grammar  Systems of Deontic Logic  Difference with Modal Logic  Deontic logic World  Limitations  Why Deontic Logic?  Conclusion  References 

 Deontic logic A field of logic concerned with Obligation, Permission and related concepts.  Obligation and Permission resembles Necessity and Possibility of Modal Concept.  Quantifiers are case or state of affairs.

Deontic Square

The Traditional Threefold Classification

 Deontic Operators : O φ : It is obligatory that φ. P φ : It is permitted that φ. Ғ φ : It is forbidden that φ.  Augmented Operators [2] : OM φ : It is omissible that φ. OP φ : It is optional that φ.

 Usual operators: ¬φ : It is not the case that φ. (φ → Ψ) : If φ, then Ψ. (φ ↔Ψ) : φ if, and only if Ψ. (φ ∧ Ψ) : φ and Ψ. ( φ ∨ Ψ ) : φ or Ψ.  Intuitively : F φ ↔ ¬ P φ,F φ ↔O¬ φ, Pφ → ¬O¬φ.

Deontic Hexagon [4]

 Two main rules O and Modus Ponens. 1) If φ, then Oφ.(O-rule) 2) If φ and (φ→ Ψ) then Ψ.(Modus Ponens)  is read as “provable”.

Minimal system deontic logic  consists of a single axiom for the distribution of O over a conditional.  Axiom 1: φ if φ is tautology.  Axiom 2: O(φ→ Ψ) → (Oφ → OΨ). Example:  If the case "It will rain today" is tautology then it is provable that it will rain today.  It is provable that if it is obligatory that “It will rain today" implies "I will miss the lecture" this implies that if it is obligatory that “It will rain today” implies that it is obligatory that "I will miss the lecture".

DKr may lead to Good Samaritan Paradox : If the good Samaritan helps Paul who has been robbed, then Paul has been robbed. (A tautology) Φ:- the good Samaritan helps Paul who has been robbed Ψ:- Paul has been robbed  So we have : (φ → Ψ) then O(φ → Ψ) (By O rule)  By rule 2 we have: Oφ → OΨ

 Assuming φ(the good Samaritan helps Paul who has been robbed) then by O rule have: O φ  By modus ponens we get O(Ψ) But clearly this conclusion is false; hence we have a contradiction. We could replace axiom 2 by the weaker rule: If φ → Ψ, then O φ → O Ψ.

 If a case is obligatory it is permissible also.  O φ →P φ.  Adding this axiom to DKr logic we get Standard D logic

 Weaker counterpart of the Modal thesis ▫ φ → φ is the claim it ought to be that what ought to be is the case, i.e., O(O φ → φ).  In other words, even though the real world is not ethically ideal, nevertheless it ought to be ideal.  All of the theorem of DKr is theorem of DM.  P(φ →Ψ)→(P φ →PΨ) not in DKr.

 According to Modal logic what is the case must be necessarily possible.  Expressed as O(φ →O(P φ)).  Extension of DM logic  Consists more complex nested connection between deontic operators.

 What is necessary must be necessarily necessary according to modal logic.  O φ →O(O φ).  Consists of principle thesis of DM logic. DS4.2: Previously φ could be both obligatory and forbidden.  Prohibits PO φ ˄ PO ¬ φ.  Adds its negation as axiom. PO φ → OP φ.

 Again from modal logic what is possible must be necessarily possible.  P φ →OP φ.  All of the previous theorems provable.  Thought as a Supersystem.

 Modal Logic: Extends formal logic.  Includes modality (necessary and possible).  Qualify truth of judgement.  If “John is happy” is true we can say “john is very happy”. Very is modality here.

 It is necessary that it will rain today if and only if it is not possible that it will not rain today.  It is possible that it will rain today if and only if it is not necessary that it will not rain today.  Similarly can be expressed in deontic logic.  It is obligatory that it will rain today if and only if it is not permissible that it will not rain today.  It is permissible that it will rain today if and only if it is not obligatory that it will not rain today.

 What is Ideal World?  Might not be perfect in general sense.  Conditional obligation O(P|S).  Study of logial relations in deontically logical world.  Model is ordered triple,.

 w ⊨ ¬ P if and only if w ⊭ P.  w ⊨ (P & Q) if and only if w ⊨ P and w ⊨ Q.  w ⊨ OP if and only if for every element v of G, if w R v then v ⊨ P  w ⊨ P P if and only if for some element v of G, it holds that w R v and v ⊨ P.  S5 is the strongest logic as R is reflexive,symmetric and transitive i.e., equivalence relation.

 How to properly represent conditional obligatories?  If you smoke(s) Then you ought to use an ashtray (a). Two representations: O(s→a). s→O(a). No representation is adequate. Dyadic Deontic logic. Contains binary deontic operators.  O(A|B): It is obligatory that A, given B.  P(A|B) : It is permissible that A, given B.

 Standard logic is not clear if norms has no truth values.  It is not clear how a norm logically follows other norms, conjunction between them.  Explained by semantic theory of possible worlds.  Deontic operators have the same logical properties under a descriptive as under a prescriptive interpretation.  Deployable in legal and moral issues.

 Deontic properties apply to acts, while deontic operators apply to linguistic units formulating actions.  Can be classified as monadic or dyadic logics according to operators.  Still an area where good deal of disagreement about fundamental matters.

[1] Nino B. Cocchiarella, “Notes on Deontic Logic”. [2] Alchourron, Carlos E. and Eugenio Bulygin (1981), In Hilpinen 1981, 95–124. [3] Todd Bernard Weber, “The moral Dilemmas Debate, Deontic Logic, and the impotence of Argument”. [4] Anderson, Alan Ross (1956). “The Formal Analysis of Normative Systems.” In Rescher 1956, 147–213. [5] Knuuttila, Simo, 1981, “The Emergence of Deontic Logic in the Fourteenth Century,” in New Studies in Deontic Logic, Ed. Hilpinen, Risto, pp , University of Turku, Turku, Finland: D. Reidel Publishing Company. [6] Huisjes, “norms and logic”, C.H,1981, Thesis University of Groningen. [7] [8]

Thank You