Lecture 02: Propositional Logic
|
|
- Dominick Henry
- 6 years ago
- Views:
Transcription
1 Lecture 02: Propositional Logic CSCI 358 Discrete Mathematics, Spring 2016 Hua Wang, Ph.D. Department of Electrical Engineering and Computer Science January 19, 2015
2 Propositional logic Propositional logic The simplest logic Definition: A proposition is a statement that is either true or false. Examples: Mines is located Golden, Colorado. (T) = 8. (F) It is raining today. (either T or F) 2 of 16 CS 441 Discrete mathematics for CS
3 Composite statements Composite statements More complex propositional statements can be build from elementary statements using logical connectives. Example: Proposition A: It rains outside Proposition B: We will see a movie A new (combined) proposition: If it rains outside then we will see a movie 3 of 16 CS 441 Discrete mathematics for CS
4 CS 441 Discrete mathematics for CS Composite statements Composite statements More complex propositional statements can be build from elementary statements using logical connectives. Logical connectives: Negation Conjunction Disjunction Exclusive or Implication Biconditional 3 of 16
5 Negation Negation Definition: Let p be a proposition. The statement "It is not the case that p." is another proposition, called the negation of p. The negation of p is denoted by p and read as "not p." Example: Golden is located at west of Denver. It is not the case that Golden is located at west of Denver. Other examples: is not a prime number. It is not the case that buses stop running at 9:00pm. 4 of 16 CS 441 Discrete mathematics for CS
6 Negation Negation A truth table displays the relationships between truth values (T or F) of different propositions. p p T F F T Rows: all possible values of elementary propositions: 4 of 16 CS 441 Discrete mathematics for CS
7 Conjunction Conjunction Definition: Let p and q be propositions. The proposition "p and q" denoted by p q, is true when both p and q are true and is false otherwise. The proposition p q is called the conjunction of p and q. Examples: Colorado School of Mines is located at west of Denver and = 8. It is raining today and 2 is a prime number. 2 is a prime number and is a perfect square and 9 is a prime. 5 of 16 CS 441 Discrete mathematics for CS
8 Disjunction Disjunction Definition: Let p and q be propositions. The proposition "p or q" denoted by p q, is false when both p and q are false and is true otherwise. The proposition p q is called the disjunction of p and q. Examples: Colorado School of Mines is located at west of Denver or = 8. It is raining today or 2 is a prime number. 2 is a prime number or is a perfect square or 9 is a prime. 6 of 16 CS 441 Discrete mathematics for CS
9 Truth tables of conjunction Truth tables and disjunction Conjunction and disjunction Four different combinations of values for p and q p q p q p q T T T F F T F F Rows: all possible combinations of values for elementary propositions: 2 n values 7 of 16 CS 441 Discrete mathematics for CS
10 Truth tables of conjunction Truth tables and disjunction Conjunction and disjunction Four different combinations of values for p and q p q p q p q T T T T F F F T F F F F NB: p q (the or is used inclusively, i.e., p q is true when either p or q or both are true). 7 of 16 CS 441 Discrete mathematics for CS
11 Truth tables of conjunction Truth tables and disjunction Conjunction and disjunction Four different combinations of values for p and q p q p q p q T T T T T F F T F T F T F F F F NB: p q (the or is used inclusively, i.e., p q is true when either p or q or both are true). 7 of 16 CS 441 Discrete mathematics for CS
12 Exclusive or Exclusive or Definition: Let p and q be propositions. The proposition "p exclusive or q" denoted by p q, is true when exactly one of p and q is true and it is false otherwise. p q p q T T F T F T F T T F F F 8 of 16 CS 441 Discrete mathematics for CS
13 CS 441 Discrete mathematics for CS Implication Implication Definition: Let p and q be propositions. The proposition "p implies q" denoted by p q is called implication. It is false when p is true and q is false and is true otherwise. In p q, p is called the hypothesis and q is called the conclusion. 9 of 16 p q p q T T T T F F F T T F F T
14 Implication Implication p q is read in a variety of equivalent ways: if p then q p only if q p is sufficient for q q whenever p Examples: if Paris is a city of U.S. then 2 is a prime. If F then T? 9 of 16 CS 441 Discrete mathematics for CS
15 CS 441 Discrete mathematics for CS Implication Implication p q is read in a variety of equivalent ways: if p then q p only if q p is sufficient for q q whenever p Examples: if Paris is a city of U.S. then 2 is a prime. T if today is Tuesday then 2 * 3 = 8. What is the truth value? 9 of 16
16 Implication Implication p q is read in a variety of equivalent ways: if p then q p only if q p is sufficient for q q whenever p Examples: if Paris is a city of U.S. then 2 is a prime. T if today is Tuesday then 2 * 3 = 8. If T then F 9 of 16 CS 441 Discrete mathematics for CS
17 CS 441 Discrete mathematics for CS Implication Implication p q is read in a variety of equivalent ways: if p then q p only if q p is sufficient for q q whenever p Examples: if Paris is a city of U.S. in 2013 then 2 is a prime. T if today is Thursday then 2 * 3 = 8. F 9 of 16
18 Implication Implication The converse of p q is q p. The contrapositive of p q is q p The inverse of p q is p q 9 of 16 CS 441 Discrete mathematics for CS
19 Implication Implication The converse of p q is q p. The contrapositive of p q is q p The inverse of p q is p q Examples: If it snows, the traffic moves slowly. p: it snows q: traffic moves slowly. p q The converse: q p 9 of 16 CS 441 Discrete mathematics for CS
20 Implication Implication The converse of p q is q p. The contrapositive of p q is q p The inverse of p q is p q Examples: If it snows, the traffic moves slowly. p: it snows q: traffic moves slowly. p q The converse: If the traffic moves slowly then it snows. q p 9 of 16 CS 441 Discrete mathematics for CS
21 CS 441 Discrete mathematics for CS Implication Implication The contrapositive of p q is q p The inverse of p q is p q Examples: If it snows, the traffic moves slowly. The contrapositive: q p The inverse: p q 9 of 16
22 CS 441 Discrete mathematics for CS Implication Implication The contrapositive of p q is q p The inverse of p q is p q Examples: If it snows, the traffic moves slowly. The contrapositive: If the traffic does not move slowly then it does not snow. q p The inverse: p q 9 of 16
23 CS 441 Discrete mathematics for CS Implication Implication The contrapositive of p q is q p The inverse of p q is p q Examples: If it snows, the traffic moves slowly. The contrapositive: If the traffic does not move slowly then it does not snow. q p The inverse: If it does not snow the traffic moves quickly. p q 9 of 16
24 Biconditional Biconditional Definition: Let p and q be propositions. The biconditional p q (read p if and only if q), is true when p and q have the same truth values and is false otherwise. p q p q T T T T F F F T F F F T Note: two truth values always agree. 10 of 16 CS 441 Discrete mathematics for CS
25 Propositional logic: review Propositional logic: 11 of 16
26 Propositional logic: review Propositional logic: a formal language for representing knowledge and for making logical inferences. 11 of 16
27 Propositional logic: review Propositional logic: a formal language for representing knowledge and for making logical inferences. A proposition 11 of 16
28 Propositional logic: review Propositional logic: a formal language for representing knowledge and for making logical inferences. A proposition is a statement that is either True or False. 11 of 16
29 Propositional logic: review Propositional logic: a formal language for representing knowledge and for making logical inferences. A proposition is a statement that is either True or False. A compound proposition can be created from other propositions using logical connectives. The truth of a compound proposition is defined by truth values of elementary propositions and the meaning of connectives. The truth table for a compound proposition: table with entries (rows) for all possible combinations of truth values of elementary propositions. 11 of 16
30 Propositional logic: review compound propositions Given the following two propositions: p: 2 is a prime. True q: 6 is a prime. False Determine the truth value of the following statements: p: p q: p q: p q: p q: p q: q p: 12 of 16
31 Propositional logic: review compound propositions Given the following two propositions: p: 2 is a prime. True q: 6 is a prime. False Determine the truth value of the following statements: p: False p q: p q: p q: p q: p q: q p: 12 of 16
32 Propositional logic: review compound propositions Given the following two propositions: p: 2 is a prime. True q: 6 is a prime. False Determine the truth value of the following statements: p: False p q: False p q: p q: p q: p q: q p: 12 of 16
33 Propositional logic: review compound propositions Given the following two propositions: p: 2 is a prime. True q: 6 is a prime. False Determine the truth value of the following statements: p: False p q: False p q: True p q: p q: p q: q p: 12 of 16
34 Propositional logic: review compound propositions Given the following two propositions: p: 2 is a prime. True q: 6 is a prime. False Determine the truth value of the following statements: p: False p q: False p q: True p q: True p q: p q: q p: 12 of 16
35 Propositional logic: review compound propositions Given the following two propositions: p: 2 is a prime. True q: 6 is a prime. False Determine the truth value of the following statements: p: False p q: False p q: True p q: True p q: True p q: q p: 12 of 16
36 Propositional logic: review compound propositions Given the following two propositions: p: 2 is a prime. True q: 6 is a prime. False Determine the truth value of the following statements: p: False p q: False p q: True p q: True p q: True p q: False q p: 12 of 16
37 Propositional logic: review compound propositions Given the following two propositions: p: 2 is a prime. True q: 6 is a prime. False Determine the truth value of the following statements: p: False p q: False p q: True p q: True p q: True p q: False q p: True 12 of 16
38 Propositional logic: review binary logic connectives We have defined five binary logical connectives between two propositions p and q, including,,,,. Are there any others that might be useful? How many binary connectives can there be? Why are some of them not very useful? 13 of 16
39 Propositional logic: review binary logic connectives We have defined five binary logical connectives between two propositions p and q, including,,,,. Are there any others that might be useful? Yes. How many binary connectives can there be? Why are some of them not very useful? 13 of 16
40 Propositional logic: review binary logic connectives We have defined five binary logical connectives between two propositions p and q, including,,,,. Are there any others that might be useful? Yes. How many binary connectives can there be? A binary logical connective is defined by a truth table with 4 rows. Each of the four rows may be True or False, so there are 2 4 = 16 possible truth tables, and thus 16 possible connectives. Why are some of them not very useful? 13 of 16
41 Propositional logic: review binary logic connectives We have defined five binary logical connectives between two propositions p and q, including,,,,. Are there any others that might be useful? Yes. How many binary connectives can there be? A binary logical connective is defined by a truth table with 4 rows. Each of the four rows may be True or False, so there are 2 4 = 16 possible truth tables, and thus 16 possible connectives. Why are some of them not very useful? Six of these are trivial ones that ignore one or both inputs; they correspond to True, False, p, q, p and q. Five of them we have already studied:,,,,. The remaining five are potentially useful: One of them is reverse implication ( instead of ). And the other four are the negations of,,,, the first two of which are sometimes called nand and nor. 13 of 16
42 Propositional logic: review constructing truth table Constructing the truth table Example: Construct the truth table for Example: constructing the truth table for (p q) ( p q) (p q) ( p q) Rows: all possible combinations of values p q p for p elementary q p q (pq) propositions: ( pq) T T 2 n values T F F T F F 14 of 16 CS 441 Discrete mathematics for CS
43 Propositional logic: review constructing truth table Constructing the truth table Example: constructing the truth table for (p q) ( p q) p q p p q p q (pq) ( pq) T T F F T F T F Typically the target (unknown) compound proposition and its values Auxiliary compound propositions and their values 14 of 16 CS 441 Discrete mathematics for CS
44 Propositional logic: review constructing truth table Constructing the truth table Examples: Construct a truth table for Example: constructing the truth table for (p q) ( p q) (p q) ( p q) p q p p q p q (pq) ( pq) T T F T F F T F F F T F F T T T T T F F T T F F 14 of 16 CS 441 Discrete mathematics for CS
45 Precedence of logic connectives Precedence of Logical Operators Precedence of Logical Operators. Operator 15 of 16 Precedence We can construct compound propositions using the negation defined so far. We will generally use parentheses to specify t in a compound proposition are to be applied. For instance, of p q and r. However, to reduce the number of parent operator is applied before all other logical operators. This m of p and q, namely, ( p) q, not the negation of the conjun Another general rule of precedence is that the conjunct the disjunction operator, so that p q r means (p q) this rule may be difficult to remember, we will continue to u the disjunction and conjunction operators is clear. Finally, it is an accepted rule that the conditional and have lower precedence than the conjunction and disjunction p q r is the same as (p q) r. We will use paren ditional operator and biconditional operator is at issue, alth precedence over the biconditional operator. Table 8 displays operators,,,,, and.
46 Precedence of logic connectives Precedence of Logical Operators. Operator 15 of 16 Precedence Precedence of Logical Operators Examples We can construct compound propositions using the negation defined so far. iswe applied will generally before use other parentheses connectives: to specify t in a compound proposition are to be applied. For instance, of p q and r. However, to reduce the number of parent operator is applied before all other logical operators. This m of p and q, namely, is applied ( p) before q, : not the negation of the conjun Another general rule of precedence is that the conjunct the disjunction operator, so that p q r means (p q) this rule may be difficult to remember, we will continue to u and have lower precedence than the disjunction and conjunction operators is clear. and : Finally, it is an accepted rule that the conditional and have lower precedence than the conjunction and disjunction p q r is the same as (p q) r. We will use paren ditional operator and biconditional operator is at issue, alth precedence over the biconditional operator. Table 8 displays operators,,,,, and.
47 Precedence of logic connectives Precedence of Logical Operators. Operator 15 of 16 Precedence Precedence of Logical Operators Examples We can construct compound propositions using the negation defined so far. iswe applied will generally before use other parentheses connectives: to specify t in a compound proposition are to be applied. For instance, p q is same as p ( q). of p q and r. However, to reduce the number of parent operator is applied before all other logical operators. This m of p and q, namely, is applied ( p) before q, : not the negation of the conjun Another general rule of precedence is that the conjunct the disjunction operator, so that p q r means (p q) this rule may be difficult to remember, we will continue to u and have lower precedence than the disjunction and conjunction operators is clear. and : Finally, it is an accepted rule that the conditional and have lower precedence than the conjunction and disjunction p q r is the same as (p q) r. We will use paren ditional operator and biconditional operator is at issue, alth precedence over the biconditional operator. Table 8 displays operators,,,,, and.
48 Precedence of logic connectives Precedence of Logical Operators. Operator 15 of 16 Precedence Precedence of Logical Operators Examples We can construct compound propositions using the negation defined so far. iswe applied will generally before use other parentheses connectives: to specify t in a compound proposition are to be applied. For instance, p q is same as p ( q). of p q and r. However, to reduce the number of parent operator is applied before all other logical operators. This m of p and q, namely, is applied ( p) before q, : not the negation of the conjun Another general p q rule r isofsame precedence as (p isq) that r. the conjunct the disjunction operator, so that p q r means (p q) this rule may be difficult to remember, we will continue to u and have lower precedence than the disjunction and conjunction operators is clear. and : Finally, it is an accepted rule that the conditional and have lower precedence than the conjunction and disjunction p q r is the same as (p q) r. We will use paren ditional operator and biconditional operator is at issue, alth precedence over the biconditional operator. Table 8 displays operators,,,,, and.
49 Precedence of logic connectives Precedence of Logical Operators. Operator 15 of 16 Precedence Precedence of Logical Operators Examples We can construct compound propositions using the negation defined so far. iswe applied will generally before use other parentheses connectives: to specify t in a compound proposition are to be applied. For instance, p q is same as p ( q). of p q and r. However, to reduce the number of parent operator is applied before all other logical operators. This m of p and q, namely, is applied ( p) before q, : not the negation of the conjun Another general p q rule r isofsame precedence as (p isq) that r. the conjunct the disjunction operator, so that p q r means (p q) this rule may be difficult to remember, we will continue to u and have lower precedence than the disjunction and conjunction operators is clear. and : Finally, it is an accepted rule that the conditional and have lower precedence p q than r is the same conjunction as (p q) and disjunction r. p q r is the same as (p q) r. We will use paren ditional operator and biconditional operator is at issue, alth precedence over the biconditional operator. Table 8 displays operators,,,,, and.
50 Copyright statement This slide set is designed only for academic use for the course of CSCI-358 Discrete Mathematics at the Department of Electrical Engineering and Computer Science of Colorado School of Mines. Some contents in this slide set are obtained from Internet and maybe copyright sensitive. Copyright and all rights therein are retained by the respective authors or by other copyright holders. Distributing or reposting the whole or part of this slide set not for academic purpose is HIGHLY prohibited without the explicit permissions of all copyright holders. 16 of 16
Introduction Propositional Logic
Discrete Mathematics for CSE of KU Introduction Propositional Logic Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg.
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 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 informationAMTH140 Lecture 8. Symbolic Logic
AMTH140 Lecture 8 Slide 1 Symbolic Logic March 10, 2006 Reading: Lecture Notes 6.2, 6.3; Epp 1.1, 1.2 Logical Connectives Let p and q denote propositions, then: 1. p q is conjunction of p and q, meaning
More informationDISCRETE STRUCTURES WEEK5 LECTURE1
DISCRETE STRUCTURES WEEK5 LECTURE1 Let s get started with... Logic! Spring 2010 CPCS 222 - Discrete Structures 2 Logic Crucial for mathematical reasoning Important for program design Used for designing
More informationLogic. Def. A Proposition is a statement that is either true or false.
Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or
More informationCompound 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 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 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 information2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?
Logic: Truth Tables CS160 Rosen Chapter 1 Logic? 1 What is logic? Logic is a truth-preserving system of inference Truth-preserving: If the initial statements are true, the inferred statements will be true
More informationIntroduction. Applications of discrete mathematics:
Introduction Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design Relational Database Theory Complexity
More informationToday s Topic: Propositional Logic
Today s Topic: Propositional Logic What is a proposition? Logical connectives and truth tables Translating between English and propositional logic Logic is the basis of all mathematical and analytical
More informationSection 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese
Section 1.1 Propositional Logic proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese go to town! X - imperative What time is it? X - interrogative propositional
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: Proposition logic MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 12, 2017 Outline 1 Propositions 2 Connectives
More informationChapter 1, Section 1.1 Propositional Logic
Discrete Structures Chapter 1, Section 1.1 Propositional Logic These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 6 th ed., by Kenneth H. Rosen, published
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 informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #2: Propositional Logic Based on materials developed by Dr. Adam Lee Today s Topic: Propositional
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
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 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 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 / 26 Why Study Logic?
More informationNote: The area of logic that deals with propositions is called the propositional calculus or propositional logic.
Ch. 1.1 Logic Logic 1 Def. A Proposition is a statement that is either true or false. Example 1: Which of the following are propositions? Statement Proposition (yes or no) UHD is a University 1 + 3 = 0
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 informationChapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.
Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)
More informationAnnouncements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication
Announcements CS311H: Discrete Mathematics Propositional Logic II Instructor: Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Wed 09/13 Remember: Due before
More informationTRUTH TABLES LOGIC (CONTINUED) Philosophical Methods
TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods Here s some Vocabulary we will be talking about in this PowerPoint. Atomic Sentences: Statements which express one proposition Connectives: These are
More informationChapter 1, Part I: Propositional Logic. With Question/Answer Animations
Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary Propositional Logic The Language of Propositions Applications Logical Equivalences Predicate Logic The Language of
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (oday) Basic logical connectives. ruth tables. Logical
More informationAnnouncements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example
Announcements CS243: Discrete Structures Propositional Logic II Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Tuesday 09/11 Weilin s Tuesday office hours are
More informationWe last time we began introducing equivalency laws.
Monday, January 14 MAD2104 Discrete Math 1 Course website: www/mathfsuedu/~wooland/mad2104 Today we will continue in Course Notes Chapter 22 We last time we began introducing equivalency laws Today we
More informationPropositional Equivalence
Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:
More informationBoolean Logic. CS 231 Dianna Xu
Boolean Logic CS 231 Dianna Xu 1 Proposition/Statement A proposition is either true or false but not both The sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 2 Boolean variables
More informationAn Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04
An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04 1 A Taste of Logic Logic puzzles (1) Knights and Knaves Knights: always tell the truth Knaves: always lie You encounter two people A and B. A says:
More information3.2: Compound Statements and Connective Notes
3.2: Compound Statements and Connective Notes 1. Express compound statements in symbolic form. _Simple_ statements convey one idea with no connecting words. _Compound_ statements combine two or more simple
More informationSec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional
Section 1.1 Sec$on Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional ruth ables 2 Proposi$ons A proposition is a declarative
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical
More informationDiscrete Mathematical Structures. Chapter 1 The Foundation: Logic
Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction
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 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 informationEquivalence and Implication
Equivalence and Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February 7 8, 2018 Alice E. Fischer Laws of Logic... 1/33 1 Logical Equivalence Contradictions and Tautologies 2 3 4 Necessary
More informationNumbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:
3.4 THE CONDITIONAL & BICONDITIONAL Definition. Any statement that can be put in the form If p, then q, where p and q are basic statements, is called a conditional statement and is written symbolically
More informationUnit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9
Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion
More information3/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
More informationThe statement calculus and logic
Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the defnitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical
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 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 informationMA103 STATEMENTS, PROOF, LOGIC
MA103 STATEMENTS, PROOF, LOGIC Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationMath.3336: Discrete Mathematics. Applications of Propositional Logic
Math.3336: Discrete Mathematics Applications of Propositional Logic Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationIntroduction Propositional Logic. Discrete Mathematics Andrei Bulatov
Introduction Propositional Logic Discrete Mathematics Andrei Bulatov Discrete Mathematics Propositional Logic 2-2 What is Logic? Computer science is a mere continuation of logic by other means Georg Gottlob
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 informationSection 1.1: Logical Form and Logical Equivalence
Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,
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 informationIntroduction to Theoretical Computer Science
Introduction to Theoretical Computer Science Zdeněk Sawa Department of Computer Science, FEI, Technical University of Ostrava 17. listopadu 15, Ostrava-Poruba 708 33 Czech republic February 11, 2018 Z.
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 informationA Statement; Logical Operations
A Statement; Logical Operations Mathematical logic is a branch of mathematics that deals with the formal principles, methods and criteria of validity of reasoning and knowledge. Logic is concerned with
More informationDiscrete Structures of Computer Science Propositional Logic I
Discrete Structures of Computer Science Propositional Logic I Gazihan Alankuş (Based on original slides by Brahim Hnich) July 26, 2012 1 Use of Logic 2 Statements 3 Logic Connectives 4 Truth Tables Use
More informationTruth-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 informationPropositional Languages
Propositional Logic Propositional Languages A propositional signature is a set/sequence of primitive symbols, called proposition constants. Given a propositional signature, a propositional sentence is
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 informationSolutions to Homework I (1.1)
Solutions to Homework I (1.1) Problem 1 Determine whether each of these compound propositions is satisable. a) (p q) ( p q) ( p q) b) (p q) (p q) ( p q) ( p q) c) (p q) ( p q) (a) p q p q p q p q p q (p
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 informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationGENERAL MATHEMATICS 11
THE SEED MONTESSORI SCHOOL GENERAL MATHEMATICS 11 Operations on Propositions July 14, 2016 WORK PLAN Daily Routine Objectives Recall Lesson Proper Practice Exercises Exit Card DAILY DOSE On ¼ sheet of
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 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 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 information- 1.2 Implication P. Danziger. Implication
Implication There is another fundamental type of connectives between statements, that of implication or more properly conditional statements. In English these are statements of the form If p then q or
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 informationCourse Staff. Textbook
Course Staff CS311H: Discrete Mathematics Intro and Propositional Logic Instructor: Işıl Dillig Instructor: Prof. Işıl Dillig TAs: Jacob Van Geffen, Varun Adiga, Akshay Gupta Class meets every Monday,
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 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 informationCS 220: Discrete Structures and their Applications. Propositional Logic Sections in zybooks
CS 220: Discrete Structures and their Applications Propositional Logic Sections 1.1-1.2 in zybooks Logic in computer science Used in many areas of computer science: ü Booleans and Boolean expressions in
More informationPHIL 422 Advanced Logic Inductive Proof
PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon
More informationProblem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
More informationChapter 1: Formal Logic
Chapter 1: Formal Logic Dr. Fang (Daisy) Tang ftang@cpp.edu www.cpp.edu/~ftang/ CS 130 Discrete Structures Logic: The Foundation of Reasoning Definition: the foundation for the organized, careful method
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationCSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Propositional Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Propositions A proposition is a declarative sentence that is either true or false
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationPropositional logic ( ): Review from Mat 1348
CSI 2101 / Winter 2008: Discrete Structures. Propositional logic ( 1.1-1.2): Review from Mat 1348 Dr. Nejib Zaguia - Winter 2008 1 Propositional logic: Review Mathematical Logic is a tool for working with
More informationDiscrete Mathematics
Discrete Mathematics Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Real numbers form a continuous
More informationCSE 311: Foundations of Computing I. Spring 2015 Lecture 1: Propositional Logic
CSE 311: Foundations of Computing I Spring 2015 Lecture 1: Propositional Logic We will study the theory needed for CSE. about the course Logic: How can we describe ideas and arguments precisely? Formal
More informationChapter 1, Part I: Propositional Logic. With Question/Answer Animations
Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary! Propositional Logic! The Language of Propositions! Applications! Logical Equivalences! Predicate Logic! The Language
More informationDiscrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques
Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics
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 information2 Conditional and Biconditional Propositions
18 FUNDAMENTALS OF MATHEMATICAL LOGIC 2 Conditional and Biconditional Propositions Let p and q be propositions. The implication p! q is the proposition that is false only when p is true and q is false;
More informationLogic: 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 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 informationLogic 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 informationTools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:
Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise
More informationSteinhardt 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
More informationKnowledge Representation. Propositional logic
CS 2710 Foundations of AI Lecture 10 Knowledge Representation. Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Knowledge-based agent Knowledge base Inference engine Knowledge
More informationPropositional 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 informationLogical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional
Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p
More informationPropositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.
Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?
More informationTopic 1: Propositional logic
Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements
More informationChapter 5: Section 5-1 Mathematical Logic
Chapter 5: Section 5-1 Mathematical Logic D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 5: Section 5-1 Mathematical Logic 1 / 29 Mathematical Logic
More informationUNIT-I: Propositional Logic
1. Introduction to Logic: UNIT-I: Propositional Logic Logic: logic comprises a (formal) language for making statements about objects and reasoning about properties of these objects. Statements in a logical
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 information