2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.

Slides:



Advertisements
Similar presentations
Reason and Argument Chapter 7 (1/2).
Advertisements

Artificial Intelligence
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Truth Functional Logic
Logic & Critical Reasoning
The Foundations: Logic and Proofs
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
1 Logic What is it?. 2 Formal logic is the science of deduction. It aims to provide systematic means for telling whether or not given conclusions follow.
Knowledge Representation Methods
CS128 – Discrete Mathematics for Computer Science
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Adapted from Discrete Math
Harper Langston New York University Summer 2015
Predicates and Quantifiers
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Chapter 2 The Logic of Quantified Statements. Section 2.4 Arguments with Quantified Statements.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
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.
Arguments with Quantified Statements M Universal Instantiation If some property is true for everything in a domain, then it is true of any particular.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
Thinking Mathematically
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.
Chapter 1: The Foundations: Logic and Proofs
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
Propositional Logic Predicate Logic
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Harper Langston New York University Summer 2017
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
3. The Logic of Quantified Statements Summary
CSNB 143 Discrete Mathematical Structures
COMP 1380 Discrete Structures I Thompson Rivers University
Predicate logic CSC 333.
Proposition & Predicates
CMSC Discrete Structures
6.1 Symbols and Translation
Chapter 8 Logic Topics
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
A Brief Summary for Exam 1
Inference Rules: Tautologies
Chapter 7. Propositional and Predicate Logic
CSNB234 ARTIFICIAL INTELLIGENCE
Predicates and Quantifiers
Discrete Mathematics Lecture 4 Logic of Quantified Statements
COMP 1380 Discrete Structures I Thompson Rivers University
Introduction to Computational Linguistics
The Foundations: Logic and Proofs
Presentation transcript:

2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic

2004/9/15fuzzy set theory chap02.ppt2 Symbolic logic Definition –Language represented by a small set of symbols reflecting the fundamental structure of reasoning with full precision. Propositional logic Predicate logic premise conclusion

2004/9/15fuzzy set theory chap02.ppt3 Forms of reasoning

2004/9/15fuzzy set theory chap02.ppt4 The structure of propositional logic Simple proposition –A proposition that does not contain any other proposition. (atomic proposition) Affirmative proposition –A proposition that contains no negating words or prefixes. A dog has four legs and tomorrow is Sunday. Proposition pProposition q Complex proposition

2004/9/15fuzzy set theory chap02.ppt5 Logic Operations

2004/9/15fuzzy set theory chap02.ppt6 Negation p = 『 a dog has four legs 』 q = 『 Elvis is mortal 』 Truth table

2004/9/15fuzzy set theory chap02.ppt7 Conjunction

2004/9/15fuzzy set theory chap02.ppt8 Disjunction

2004/9/15fuzzy set theory chap02.ppt9 Implication antecedentconsequent

2004/9/15fuzzy set theory chap02.ppt10 Equivalence

2004/9/15fuzzy set theory chap02.ppt11 Truth values of complex propositions

2004/9/15fuzzy set theory chap02.ppt12 Table of a complex proposition

2004/9/15fuzzy set theory chap02.ppt13 Contradictions and Tautologies ContradictionsTautologies Tautology:logical implicationTautology:logical equivalence

2004/9/15fuzzy set theory chap02.ppt14 Logic functions

2004/9/15fuzzy set theory chap02.ppt15 Valid inference

2004/9/15fuzzy set theory chap02.ppt16 Invalid inference error

2004/9/15fuzzy set theory chap02.ppt17 Basic Inference forms

2004/9/15fuzzy set theory chap02.ppt18 Rules of Replacement

2004/9/15fuzzy set theory chap02.ppt19 Predicate Logic Singular Proposition General Proposition Subject termPredicate term

2004/9/15fuzzy set theory chap02.ppt20 Singular Propositions Lassie is a dog Dl Individual constant l Predicate variable D Fido is a dog Df Buster is a dog Db Ginger is a dog Dg

2004/9/15fuzzy set theory chap02.ppt21 Generalization Lassie is a dog Dl Individual constant l Predicate variable D Fido is a dog Df Buster is a dog Db Ginger is a dog Dg DxDx x: Individual variable Dx: propositional function Df: substitution instances DxDx Dl instantiation generalization

2004/9/15fuzzy set theory chap02.ppt22 General Propositions ( ∃ x)Dx : There exists at least one x, such that the x is a dog ( ∃ x)( Dx ∧ Qx) : There exists at least one thing, such that it is both a dog and a quadruped. ( ∀ x) Dx : For any x, x is a dog ( ∀ x) Dx  Qx : for any x, if x is a dog, then x is a quadruped Existential generalization ∃ x : Existential quantifier universal generalization ∀ x : universal quantifier

2004/9/15fuzzy set theory chap02.ppt23 Relations represented by predicate logic John loves Mary --- Ljm L : relation j,m : individual constant Everything is attracted by something --- ( ∀ x )( ∃ y)Ayx x y

2004/9/15fuzzy set theory chap02.ppt24 Quantifier Negation It is false that everything is square --- ¬ ( ∀ x )Sx There is something which is not square --- ( ∃ x) ¬ Sx Quantifier negation equivalences

2004/9/15fuzzy set theory chap02.ppt25 The Square of Opposition