DISCRETE MATH: LECTURE 6
|
|
|
- Nora Gibson
- 5 years ago
- Views:
Transcription
1 DISCRETE MATH: LECTURE 6 DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review 2) a. When does (a, b) = (c, d)? b. If A = {1, 2} and B = {x, y, c} then what is A B, B A, and A A? 3) Let A = {2, 3, 5} and B = {3, 4, 7}. Define a relation T from A to B by: If (x, y) A B then (x, y) T means that x y Z. a. Is 2 T 7? Is (2, 4) T? b. Is T : A B a function? why or why not? c. Write down T as a set of ordered pairs. d. Draw an arrow diagram for T. 1
2 2 DR. DANIEL FREEMAN 2. Chapter 2 review 1) Construct a truth table for (p q) ( p q). 2) Construct a truth table to show that (p q) is logically equivalent to p q. What is the name for this law? 3) Construct a truth table to show that p q is not logically equivalent to p q. 4) Use a truth table to determine if the following argument is logically valid. Write a sentence which justifies your conclusion. p q r q p r p r
3 DISCRETE MATH: LECTURE 6 3 You will be provided with the following information on the test Modus Ponens and Modus Tollens. The modus ponens argument form has the following form: If p then q. p q. Modus tollens has the following form: If p then q. q p Additional Valid Argument Forms: Rules of Inference. A rule of inference is a form of argument that is valid. Modus ponens and modus tollens are both rules of inference. Here are some more... Generalization p Elimination p q p q q Specialization p q p p Transitivity p q Proof by Division into Cases p q q r p r p r q r Conjunction p r q Contradiction Rule p c p q p
4 4 DR. DANIEL FREEMAN 5) Write a logical argument which determines what I ate for dinner. Number each step in your argument and cite which rule you use for each step. a. I did not have a coupon for hamburger buns. b. I had hamburgers or chicken for dinner. c. If I had hamburgers for dinner then I bought hamburger buns. d. If I did not have a coupon for hamburger buns then I did not buy hamburger buns.
5 DISCRETE MATH: LECTURE 6 5 6) Write a logical argument which determines how Blue Beard the pirate stashed his treasure. Number each step in your argument and cite which rule you use for each step. a. Blue Beard buried his treasure on land or Blue Beard sunk his treasure in the lagoon. b. The first mate helped Blue Beard stash the treasure or the cabin boy helped Blue Beard stash the treasure. c. If the first mate helped Blue Beard then they stashed the treasure with some rum. d. If the cabin boy helped Blue Beard then they used a treasure map. e. If they sank the treasure in the lagoon then they did not use a treasure map. f. If they did not stash the treasure with some rum then they did not burry the treasure. g. If they stashed the treasure with some rum then they did not sink the treasure in the lagoon.
6 6 DR. DANIEL FREEMAN 7) (Hard problem for fun) The prison warden gives three prisoners a chance to win their freedom. The warden puts a hat on each prisoners head and says that a prisoner will be allowed to go free if they can say what color hat they are wearing, but if they get it wrong then they will be executed. The first two prisoners can see, but the third prisoner is blind. Use the following information to determine what color hat each prisoner is wearing, assuming each prisoner is a perfect logician. a. The warden owns 3 red hats and 2 white hats. b. The warden asks the first prisoner what color hat he is wearing, but the first prisoner does not know. c. The warden then asks the second prisoner what color hat he is wearing, but the second prisoner does not know. d. The warden then asks the third prisoner what color hat he is wearing, and the third prisoner answers correctly.
7 DISCRETE MATH: LECTURE Chapter 3 review 1) a. Give an example of a universal conditional statement. b. Write the contrapositive of the example. c. Write the negation of the example. 2) Write the following statements symbolically using,,,,. Then write their negation. a. If x, y R then x + y R. b. Every real number x has an additive inverse y. c. Being divisible by 8 is not a necessary condition for an integer to be divisible by 4. d. If I am tired and at home then I will go to sleep.
8 8 DR. DANIEL FREEMAN 2) Is it true or false that every real number bigger than 4 and less than 3 must be negative? Explain why. 3) Use diagrams to show whether the following arguments are logically valid or invalid. a. All people are mammals. All mammals are mortal. All people are mortal. a. Discrete math problems are fun. This problem is fun. This problem is discrete math.
DISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
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
CHAPTER 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
DISCRETE MATH: LECTURE 3
DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false
Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning
Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February, 2018 Alice E. Fischer Reasoning... 1/23 1 Truth is not the same as Validity 2 Alice E. Fischer Reasoning... 2/23 Truth is not the
A. 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
5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.
Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent
MACM 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:
CSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
Review The Conditional Logical symbols Argument forms. Logic 5: Material Implication and Argument Forms Jan. 28, 2014
Logic 5: Material Implication and Argument Forms Jan. 28, 2014 Overview I Review The Conditional Conditional statements Material implication Logical symbols Argument forms Disjunctive syllogism Disjunctive
Section 1.3: Valid and Invalid Arguments
Section 1.3: Valid and Invalid Arguments Now we have developed the basic language of logic, we shall start to consider how logic can be used to determine whether or not a given argument is valid. In order
PROPOSITIONAL 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
Chapter 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
Sample 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
CSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
The 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 :
STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6
STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES DR. LOMONACO 1. Use the principle of mathematical induction to prove that P (n) : n (n +1)(2n +1), for all integers n 1. Answer: Proof (by weak induction):
DISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form
DISCRETE MATH: LECTURE 5 DR. DANIEL FREEMAN 1. Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form x D, y E such that P (x, y) your challenge
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
Today 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.
COMP Intro to Logic for Computer Scientists. Lecture 6
COMP 1002 Intro to Logic for Computer Scientists Lecture 6 B 5 2 J Treasure hunt In the back of an old cupboard you discover a note signed by a pirate famous for his bizarre sense of humour and love of
[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics
![[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics](/thumbs/76/74441698.jpg "[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics")
400 lecture note #2 [Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 1) Basics An argument is a sequence of statements ( s1, s2,, sn). All statements in an argument, excet for
Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)
Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement
Review. p q ~p v q Contrapositive: ~q ~p Inverse: ~p ~q Converse: q p
~ v Contraositive: ~ ~ Inverse: ~ ~ Converse: Å Review ( Ú ) Ù ~( Ù ) ~( Ù ) ~ Ú ~ ~( Ú ) ~ Ù ~ is sufficient for is necessary for ~ ~ 1 Valid and Invalid Arguments CS 231 Dianna Xu 2 Associative Law:
Introduction 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
1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
ANS: If you are in Kwangju then you are in South Korea but not in Seoul.
Math 15 - Spring 2017 - Homework 1.1 and 1.2 Solutions 1. (1.1#1) Let the following statements be given. p = There is water in the cylinders. q = The head gasket is blown. r = The car will start. (a) Translate
Discrete Mathematics Exam File Spring Exam #1
Discrete Mathematics Exam File Spring 2008 Exam #1 1.) Consider the sequence a n = 2n + 3. a.) Write out the first five terms of the sequence. b.) Determine a recursive formula for the sequence. 2.) Consider
CSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
CSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
Proving 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
Chapter 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
Propositional 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
THE 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
Propositional 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
PSU MATH RELAYS LOGIC & SET THEORY 2017
PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct
A Quick Lesson on Negation
A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which
WUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
Chapter 3. The Logic of Quantified Statements
Chapter 3. The Logic of Quantified Statements 3.1. Predicates and Quantified Statements I Predicate in grammar Predicate refers to the part of a sentence that gives information about the subject. Example:
Logic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
What is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.
Question 1. [10 marks] Part (a) [2 marks] What is the decimal (base 10) representation of the binary number 110101? Show your work and place your final answer in the box. 2 0 + 2 2 + 2 4 + 2 5 = 1 + 4
Propositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
6. Conditional derivations
6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes (1588-1679) gives an important argument for government. Hobbes begins by claiming that
Discrete 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
Deductive and Inductive Logic
Deductive Logic Overview (1) Distinguishing Deductive and Inductive Logic (2) Validity and Soundness (3) A Few Practice Deductive Arguments (4) Testing for Invalidity (5) Practice Exercises Deductive and
Section 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.
6. Conditional derivations
6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes gives an important argument for government. Hobbes begins by claiming that without a common
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.](/thumbs/87/97228443.jpg "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.
PHI 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
Math Final Exam December 14, 2009 Page 1 of 5
Math 201-803-Final Exam December 14, 2009 Page 1 of 5 (3) 1. Evaluate the expressions: (a) 10 C 4 (b) 10 P 4 (c) 15!4! 3!11! (4) 2. (a) In how many ways can a president, a vice president and a treasurer
Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 008 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.
The Conditional (IMPLIES) Operator The conditional operation is written p q. The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence. The Conditional
CS100: 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
3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
Warm-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
8.8 Statement Forms and Material Equivalence
M08_COPI1396_13_SE_C08.QXD 10/16/07 9:19 PM Page 357 8.8 Statement Forms and Material Equivalence 357 murdered. So either lawlessness will be rewarded or innocent hostages will be murdered. 8. If people
How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.
Major results: (wrt propositional logic) How to reason correctly. How to reason efficiently. How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague,
Chapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 007 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
3 Rules of Inferential Logic
24 FUNDAMENTALS OF MATHEMATICAL LOGIC 3 Rules of Inferential Logic The main concern of logic is how the truth of some roositions is connected with the truth of another. Thus, we will usually consider a
Tutorial 2 Logic of Quantified Statements
Tutorial 2 Logic of Quantified Statements 1. Let V be the set of all visitors to Universal Studios Singapore on a certain day, T (v) be v took the Transformers ride, G(v) be v took the Battlestar Galactica
DISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
Methods 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
software 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
Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
MATH 2001 MIDTERM EXAM 1 SOLUTION
MATH 2001 MIDTERM EXAM 1 SOLUTION FALL 2015 - MOON Do not abbreviate your answer. Write everything in full sentences. Except calculators, any electronic devices including laptops and cell phones are not
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
Advanced 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
CITS2211 Discrete Structures Proofs
CITS2211 Discrete Structures Proofs Unit coordinator: Rachel Cardell-Oliver August 13, 2017 Highlights 1 Arguments vs Proofs. 2 Proof strategies 3 Famous proofs Reading Chapter 1: What is a proof? Mathematics
Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
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)
Section 1.2: Conditional Statements
Section 1.2: Conditional Statements In this section, we study one of the most important tools in logic - conditional statements. Loosely speaking, conditional statements are statements of the form if p
Math 3336: Discrete Mathematics Practice Problems for Exam I
Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing
COMP219: 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
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
Analyzing Arguments with Truth Tables
Analyzing Arguments with Truth Tables MATH 100 Survey of Mathematical Ideas J. Robert Buchanan Department of Mathematics Fall 2014 Introduction Euler diagrams are useful for checking the validity of simple
Chapter 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
Test Bank Questions. (a) Is there an integer n such that n has? (b) Does there exist such that if n is divided by 4 the remainder is 1 and if?
Discrete Mathematics with Applications, 4th Edition by Susanna S. Epp Chapter 1 Test Bank Questions 1. Fill in the blanks to rewrite the following statement with variables: Is there an integer with a remainder
- a reversed conditional; if a conditional is p q, than its converse is q p
Lesson 5: Inductive and Deductive Reasoning Conditional - a statement that tells if one thing happens, another will follow; stated as if p, then q written as p q; Contrapositive - a type of conditional
Review. 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
CSC 125 :: Final Exam December 14, 2011
1-5. Complete the truth tables below: CSC 125 :: Final Exam December 14, 2011 p q p q p q p q p q p q T T F F T F T F (6 9) Let p be: Log rolling is fun. q be: The sawmill is closed. Express these as English
Manual 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
Intermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
Proposition logic and argument. CISC2100, Spring 2017 X.Zhang
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
Where are my glasses?
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
n 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
Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!
Logic and Proof On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA 341 001 2 Requirements for Proof 1. Mutual understanding
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
Lecture 5 : Proofs DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/3/2011 Lecture 5 : Proofs Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Up until now, we have been introducing mathematical notation
Propositional 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
Logic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA
Logic and Proof On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA 341 001 2 Requirements for Proof 1. Mutual understanding
DERIVATIONS AND TRUTH TABLES
DERIVATIONS AND TRUTH TABLES Tomoya Sato Department of Philosophy University of California, San Diego Phil120: Symbolic Logic Summer 2014 TOMOYA SATO LECTURE 3: DERIVATIONS AND TRUTH TABLES 1 / 65 WHAT
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,...)
1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form
Math 378 Exam 1 Spring 2009 Show all Work Name 1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form a) In order for John to be wealthy it
CPSC 121 Midterm 1 Friday February 5th, 2016
CPSC 121 Midterm 1 Friday February 5th, 2016 [3] 1. Is the following statement a tautology, a contradiction or neither? Justify your answer using a truth table: (p q) (p q) This statement is a tautology:
Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
CPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Pre-class quiz #7 is due Wednesday October 16th at 17:00. Assigned reading for the quiz: Epp, 4th edition: 4.1, 4.6, Theorem 4.4.1 Epp, 3rd edition: 3.1, 3.6, Theorem 3.4.1.
Quiz 1. Directions: Show all of your work and justify all of your answers.
Quiz 1 1. Let p and q be the following statements. p : Maxwell is a mathematics major. q : Maxwell is a chemistry major. (1) a. Write each of the following in symbolic form using logical connectives. i.