Formal Logic 2. This lecture: Standard Procedure of Inferencing Normal forms Standard Deductive Proofs in Logic using Inference Rules
|
|
- Noah Osborne
- 6 years ago
- Views:
Transcription
1 ormal Logic 2 HW2 Due Now & ickup HW3 handout! Last lecture ropositional Logic ropositions, Statements, Connectives, ruth table, ormula W roperties: autology, Contradiction, Validity, Satisfiability Logical Equivalence autology Equivalence Laws his lecture: Standard rocedure of Inferencing Normal forms Standard Deductive roofs in Logic using Inference Rules 1 Normal orm wo special forms for formulas logically equivalent to a given formula : Disjunctive normal form (DN) and Conjunctive normal form (CN). DN: a formula G of m variables being a disjunction x 1 x 2 x k of k >= 0 terms/clauses, where each x i is a conjunction of m literals, i.e. x i = (y 1 y 2 y m ) CN: a formula G of m variables being a conjunction x 1 x 2 x k of k >= 0 terms/clauses, where each x i is a disjunction of m literals, i.e. x i = (y 1 y 2 y m ) heorem: Every formula is logically equivalent to a corresponding formula in DN (and a formula in CN) (in another word, every formula can be written in DN and CN) 2 1
2 Systematic way to find DN and CN Given S = (( ( R)) ( )) R S DN is ( R) ( R) ( R) i.e. take each row where S is rue. Check this! CN for S starts with DN of S, i.e. take each row where S is alse and form DN. hen, use DeMorganlaw to convert ( S) in DN to CN 3 DN for S is: ( R) ( R) ( R) ( R) ( R) Now S = ( S) : (( R) ( R) ( R) ( R) ( R) ) Use DeMorgan slaw: (push in 1 st ) ( R) ( R) ( R) ( R) ( R) ) More DeMorgan slaw to get CN for S: ( R) ( R) ( R) ( R) ( R) 4 2
3 Deductive roof Method erminology : axiomis a basic assumption about mathematical structure that needs no proof, i.e. things known to be true (facts or proven theorems or tautologies) A theoremis a statement that can be shown to be valid. A lemmais a simple theorem used as an intermediate result in the proof of another theorem. A corollaryis a proposition that follows directly from a theorem that has been proved. A conjectureis a statement whose truth value is unknown. Once it is proven, it becomes a theorem. 5 A theorem often has two parts Conditions(or hypotheses/premises) and a Conclusion A correct (deductive) proof is to establish that If all conditions are true, then the conclusion is true i.e., (Conditions Conclusion) is valid (a tautology) Deduction: a method which usestautology lawsand inference rulesto prove a theorem, i.e. Often there are missing pieces (not easily understandable) between conditions and conclusion. ill it by a sequence of applications of tautologies and inference rules - Starting from conditions and axioms - Generate a sequence of valid statements connected by proper rules of inference (new statements are generated from existing ones by these rules) 6 3
4 Logically valid inferences by using inference rules he general form of a rule of inference is: p 1 p 2. p n q if p 1 and p 2 and and p n are all true, then q is true as well. Each rule is an established tautology of p 1 p 2 p n q hese rules of inference can be used in any mathematical argument and do not require any proof. 7 Modus ponens Latin name, means: method of assertion An argumentconsists of one or more hypotheses and a conclusion. An argument isvalid(theorem), if whenever all its hypotheses are true, its conclusion is also true Example : Use deduction to prove that [[ ( )] ( )] is a valid argument (or theorem). Note : Using Conditional proof law, this is equivalent to [[ ( )] ] 1. ( ) (hypothesis) 2. (hypothesis) 3. (1& 2 modus ponens) 4. (2& 3 modus ponens) 8 4
5 Example : rove that ( ) ( S) ( S) is theorem. Note : Using Conditional proof law, this is equivalent to ( ) ( S) S 1. (hypothesis) 2. S (hypothesis) 3. (hypothesis) 4. (contraposition, 1, 4 equivalent) 5. (4, double negations) 6. (3, 5 modus ponens) 7. S (2, 6 modus ponens) 9 ew Inferences rules (more in the text book) conjunction disjunctive syllogism Modus ollens addition simplification 10 5
6 Example : rove that (A ) (A L) [A ( L)] is theorem Note : his is equivalent to (A ) (A L) A ( L) 1. A (hypothesis) 2. A L (hypothesis) 3. A (hypothesis) 4. (1, 3 modus ponens) 5. L (2, 3 modus ponens) 6. L (4, 5 conjunction inference rule) 11 Example : rove ( R) (R S W) ( S W) is a theorem Note : his is equivalent( R) (R S W) ( S) W 1. R (hypothesis) 2. R S W (hypothesis) 3. S (hypothesis) ** arget: Show W is true: ** 4. (3, simplification) 5. (4, addition) 6. R (1, 5 mp) 7. S W (2, 6 mp) 8. S (3, simplification) 9. W (7,8 disjunctive syllogism) 12 6
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
More informationPHI Propositional Logic Lecture 2. Truth Tables
PHI 103 - Propositional Logic Lecture 2 ruth ables ruth ables Part 1 - ruth unctions for Logical Operators ruth unction - the truth-value of any compound proposition determined solely by the truth-value
More informationLogic and Proof. Aiichiro Nakano
Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science
More informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
More informationLogic and Truth Tables
Logic and ruth ables What is a ruth able? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. here are five basic operations
More informationCOMP 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 informationLecture 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 informationLogic. 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 informationArtificial Intelligence Knowledge Representation I
Artificial Intelligence Knowledge Representation I Agents that reason logically knowledge-based approach implement agents that know about their world and reason about possible courses of action needs to
More informationChapter 2: The Logic of Compound Statements
Chapter 2: he Logic of Compound Statements irst: Aristotle (Gr. 384-322 BC) Collection of rules for deductive reasoning to be used in every branch of knowledge Next: Gottfried Leibniz (German, 17th century)
More informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationIntroduction Logic Inference. Discrete Mathematics Andrei Bulatov
Introduction Logic Inference Discrete Mathematics Andrei Bulatov Discrete Mathematics - Logic Inference 6-2 Previous Lecture Laws of logic Expressions for implication, biconditional, exclusive or Valid
More informationMACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:
More information2. 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 information2.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 informationLanguage 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 informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationExample. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives
Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.
More information10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference
Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationMore 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 information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationFormal Logic. Critical Thinking
ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,
More informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationProofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.
Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationProof strategies, or, a manual of logical style
Proof strategies, or, a manual of logical style Dr Holmes September 27, 2017 This is yet another version of the manual of logical style I have been working on for many years This semester, instead of posting
More informationSection 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 informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More informationPropositional Logic: Syntax
4 Propositional Logic: Syntax Reading: Metalogic Part II, 22-26 Contents 4.1 The System PS: Syntax....................... 49 4.1.1 Axioms and Rules of Inference................ 49 4.1.2 Definitions.................................
More informationPropositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38
Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationCSC 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 informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More informationDiscrete Structures of Computer Science Propositional Logic III Rules of Inference
Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationAxiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:
Axiomatic systems Revisiting the rules of inference Material for this section references College Geometry: A Discovery Approach, 2/e, David C. Kay, Addison Wesley, 2001. In particular, see section 2.1,
More information13.3 Truth Tables for the Conditional and the Biconditional
ruthablesconditionalbiconditional.nb 1 13.3 ruth ables for the Conditional and the Biconditional Conditional Earlier, we mentioned that the statement preceding the conditional symbol is called the antecedent
More informationPropositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013
Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics
More informationLogic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:
Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements. An inference mechanism (a collection of rules) to
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationWarm-Up Problem. Write a Resolution Proof for. Res 1/32
Warm-Up Problem Write a Resolution Proof for Res 1/32 A second Rule Sometimes throughout we need to also make simplifications: You can do this in line without explicitly mentioning it (just pretend you
More informationWhat 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 information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationRules Build Arguments Rules Building Arguments
Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More informationOutline. Rules of Inferences Discrete Mathematics I MATH/COSC 1056E. Example: Existence of Superman. Outline
Outline s Discrete Mathematics I MATH/COSC 1056E Julien Dompierre Department of Mathematics and Computer Science Laurentian University Sudbury, August 6, 2008 Using to Build Arguments and Quantifiers Outline
More informationMethods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures
Methods of Proof CSE0 Discrete Computational Structures Lecture 4 When is a mathematical argument correct? What methods can be used to construct mathematical arguments? Important in many computer science
More informationProving Things. Why prove things? Proof by Substitution, within Logic. Rules of Inference: applying Logic. Using Assumptions.
1 Proving Things Why prove things? Proof by Substitution, within Logic Rules of Inference: applying Logic Using Assumptions Proof Strategies 2 Why Proofs? Knowledge is power. Where do we get it? direct
More informationCSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/33
CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter 4.1-4.8 p. 1/33 CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer
More informationCS250: Discrete Math for Computer Science. L6: CNF and Natural Deduction for PropCalc
CS250: Discrete Math for Computer Science L6: CNF and Natural Deduction for PropCalc How to Simplify a PropCalc Formula: (p q) ((q r) p) How to Simplify a PropCalc Formula: 1. Get rid of s using def. of
More information7 LOGICAL AGENTS. OHJ-2556 Artificial Intelligence, Spring OHJ-2556 Artificial Intelligence, Spring
109 7 LOGICAL AGENS We now turn to knowledge-based agents that have a knowledge base KB at their disposal With the help of the KB the agent aims at maintaining knowledge of its partially-observable environment
More informationMAT 243 Test 1 SOLUTIONS, FORM A
t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationHW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall
CSE 20 HW1 graded review form? HW2 released DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Translate sentences from English to propositional logic using appropriate
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More informationManual of Logical Style (fresh version 2018)
Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationFundamentals of Logic
Fundamentals of Logic No.5 Soundness and Completeness Tatsuya Hagino Faculty of Environment and Information Studies Keio University 2015/5/18 Tatsuya Hagino (Faculty of Environment and InformationFundamentals
More informationReading: EC 1.3. Peter J. Haas. INFO 150 Fall Semester 2018
ruth ellers, Liars, and Propositional Logic Reading: EC 1.3 Peter J. Haas INO 150 all Semester 2018 Lecture 3 1/ 17 ruth ellers, Liars, and Propositional Logic Smullyan s Island Propositional Logic ruth
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationLogic for Computer Science - Week 4 Natural Deduction
Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More informationInference 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 informationReview: Potential stumbling blocks
Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 3 Logic: Rules of Inference 1 Outline Mathematical Argument Rules of Inference 2 Argument In mathematics, an argument is a sequence of propositions (called premises)
More informationLogic and Truth Tables
Logic and Truth Tables What is a Truth Table? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. There are five basic operations
More informationProposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators
Proposition/Statement Boolean Logic CS 231 Dianna Xu A proposition is either true or false but not both he sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 1 2 Boolean variables
More informationKS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE Discrete Math Team 2 -- KS091201 MD W-04 Outline Valid Arguments Modus Ponens Modus Tollens Addition and Simplification More Rules
More informationLogic - recap. So far, we have seen that: Logic is a language which can be used to describe:
Logic - recap So far, we have seen that: Logic is a language which can be used to describe: Statements about the real world The simplest pieces of data in an automatic processing system such as a computer
More informationMathematical Logic Part One
Mathematical Logic Part One Announcements Problem Session tonight from 7:00 7:50 in 380-380X. Optional, but highly recommended! Problem Set 3 Checkpoint due right now. 2 Handouts Problem Set 3 Checkpoint
More informationPropositional natural deduction
Propositional natural deduction COMP2600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2016 Major proof techniques 1 / 25 Three major styles of proof in logic and mathematics Model
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #6: Rules of Inference Based on materials developed by Dr. Adam Lee Today s topics n Rules of inference
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 12 Using the laws
More informationDefinition 2. Conjunction of p and q
Proposition Propositional Logic CPSC 2070 Discrete Structures Rosen (6 th Ed.) 1.1, 1.2 A proposition is a statement that is either true or false, but not both. Clemson will defeat Georgia in football
More informationPropositional 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 informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationSupplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationPL: Truth Trees. Handout Truth Trees: The Setup
Handout 4 PL: Truth Trees Truth tables provide a mechanical method for determining whether a proposition, set of propositions, or argument has a particular logical property. For example, we can show that
More informationPropositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173
Propositional Logic CSC 17 Propositional logic mathematical model (or algebra) for reasoning about the truth of logical expressions (propositions) Logical expressions propositional variables or logical
More informationComputational Logic Lecture 3. Logical Entailment. Michael Genesereth Autumn Logical Reasoning
Computational Logic Lecture 3 Logical Entailment Michael Genesereth Autumn 2010 Logical Reasoning Logical Reasoning relates premises and conclusion does not say whether conclusion is true in general says
More informationCSE 311: Foundations of Computing. Lecture 3: Digital Circuits & Equivalence
CSE 311: Foundations of Computing Lecture 3: Digital Circuits & Equivalence Homework #1 You should have received An e-mail from [cse311a/cse311b] with information pointing you to look at Canvas to submit
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationFirst Order Logic: Syntax and Semantics
irst Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Logic Recap You should already know the basics of irst Order Logic (OL) It s a prerequisite of this course!
More informationsoftware design & management Gachon University Chulyun Kim
Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
More informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More information