MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.

Size: px
Start display at page:

Download "MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions."

Transcription

1 Name: MA 101 Exam 2 Logic (Part I) all 2017 Multiple-Choice Questions [5 pts each] Circle the correct answer on the following multiple-choice questions. 1. Which of the following is not a statement? a) All prime numbers are odd naturals greater than 1. b) is larger than 10. c) riangles do not have 4 sides if and only if squares have exactly 5 corners. d) Sentences consisting of ten words or less are always false. e) or some integer x, x x If p is true, then what is the truth value of the compound statement ~ p (~ q r) a) rue. b) alse. c) his truth value cannot be determined.? 3. What can you conclude, in general, about the symbolic statement ~ pq, are component statements? a) It is a tautology (i.e. it is always true). b) It is a contradiction (i.e. it is always false). c) It is only true when q is true. d) It is only true when both p and q are true. p p q, where 4. How many rows would be needed to construct the truth table of a compound statement with 6 component statements? a) 12 b) 16 c) 32 d) 64

2 or questions 5 7, let w represent the statement he wife has long hair, h represent the statement he husband has a beard, and r represent the statement I remember this couple. 5. Which of the following is the symbolic representation of the statement It is not the case that the wife has long hair or that the husband has a beard. a) ~ w h b) ~ w ~ h c) ~ w h d) ~ w h 6. Which of the following is the verbal translation of the symbolic statement (~ w) (~ h)? a) Neither does the wife have long hair nor does the husband have a beard. b) he wife does not have long hair or the husband does not have a beard. c) It is not the case that the wife has long hair or the husband has a beard. d) Either the wife has long hair or the husband has a beard. 7. Which of the following is equivalent to the symbolic statement ~ w h r? a) he wife has long hair and the husband does not have a beard, provided I remember this couple. b) I remember this couple, provided the wife has long hair and the husband does not have a beard. c) I do not remember this couple, unless the wife has long hair and the husband does not have a beard. d) If I remember this couple, the wife has long hair and the husband does not have a beard.

3 Show all your work on the following problems to receive full credit. Problem 1 [15 pts] Write the following song lyrics symbolically. Specify the letters you attribute to each of the component statements in the quotation explicitly. a) You may say I m a dreamer but I am not the only one. - John Lennon b) Ready or not, here I come. - he Delfonics c) Lean on me when you re not strong and I ll be your friend. - Bill Withers

4 Problem 2 [15 pts] Write the negation of the following statements. Do not just provide symbolic answers. 11 a) b) She was unwilling to join the party or her car broke down that day. c) Everyone on Long Island was affected by super storm Sandy in 2012, but some did not lose power in their homes.

5 Problem 3 [15 pts] a) Use the truth tables provided below to show that ~ ~ p q is not logically equivalent to p ~ q, where p and q represent any two component statements. p q p q b) Can you prove that ~ ~ p q p ~ q without using truth tables? [Bonus 5pts]

6 Problem 4 [20 pts] a) Using the truth table below, show that the symbolic statement (~ p q) (~ q r) is a tautology (i.e. a compound statement that is always true.) p q r b) Consider the following three component statements: p All triangles have more than 3 sides. q Odd integers have a factor of 2. r Some pigs can solve differential equations. Using the truth table constructed in part a), how can you justify that the statement (~ p q) (~ q r) is still true with the components given above?

7 Bonus Problem [5 pts] In propositional logic, the disjunction p or q (written symbolically as p q) is said to be inclusive since it is true when either p is true, q is true, or both p and q are true. On the other hand, the disjunctive form Either p or q is said to be exclusive since it is not true when both p and q are true. Write this exclusive form of the disjunction symbolically along with its truth table.

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~ MAT 101 Solutions Exam 2 (Logic, Part I) Multiple-Choice Questions 1. D Because this sentence contains exactly ten words, it is stating that it is false. But if it is taken to be false, then it has to

More information

CSC Discrete Math I, Spring Propositional Logic

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,...)

More information

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Logical 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 information

Propositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election.

Propositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election. 1&2 Propositional Calculus Propositional Calculus Problems Jim Woodcock University of York October 2008 1. Let p be it s cold and let q be it s raining. Give a simple verbal sentence which describes each

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 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 information

Section L.1- Introduction to Logic

Section L.1- Introduction to Logic Section L.1- Introduction to Logic Definition: A statement, or proposition, is a declarative sentence that can be classified as either true or false, but not both. Example 1: Which of the following are

More information

PROPOSITIONAL CALCULUS

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

More information

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) 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 information

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

2/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 information

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

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

More information

Chapter 1: The Logic of Compound Statements. January 7, 2008

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

More information

Section 1.1: Logical Form and Logical Equivalence

Section 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 information

1.1 Language and Logic

1.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 information

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Example. 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 information

Mathematical Reasoning (Part I) 1

Mathematical Reasoning (Part I) 1 c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither

More information

STRATEGIES OF PROBLEM SOLVING

STRATEGIES OF PROBLEM SOLVING STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical

More information

Logic and Proofs. Jan COT3100: Applications of Discrete Structures Jan 2007

Logic and Proofs. Jan COT3100: Applications of Discrete Structures Jan 2007 COT3100: Propositional Equivalences 1 Logic and Proofs Jan 2007 COT3100: Propositional Equivalences 2 1 Translating from Natural Languages EXAMPLE. Translate the following sentence into a logical expression:

More information

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y Lecture 4: ruth functions, evaluating compound statements 1. unctions, arithmetic functions, and truth functions 2. Definitions of truth functions unctions A function is something that takes inputs and

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 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 information

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

What 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 information

1.1 Statements and Compound Statements

1.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 information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition

More information

Chapter 5: Section 5-1 Mathematical Logic

Chapter 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 information

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements. 1. Find the truth tables of each of the following compound statements. (a) ( (p q)) (p q), p q p q (p q) q p q ( (p q)) (p q) 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 (b) [p ( p q)] [( (p

More information

Truth Tables for Arguments

Truth Tables for Arguments ruth ables for Arguments 1. Comparing Statements: We ve looked at SINGLE propositions and assessed the truth values listed under their main operators to determine whether they were tautologous, self-contradictory,

More information

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

TRUTH 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 information

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set.

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set. Math 1312 Lesson 1: Sets, Statements, and Reasoning A set is any collection of objects. hese objects are called the elements of the set. A is a subset of B, if A is "contained" inside B, that is, all elements

More information

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Propositional 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 information

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional Class XI Mathematics Ch. 14 Mathematical Reasoning 1. Statement: A sentence which is either TRUE or FALSE but not both is known as a statement. eg. i) 2 + 2 = 4 ( it is a statement which is true) ii) 2

More information

2.2: Logical Equivalence: The Laws of Logic

2.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 information

PSU MATH RELAYS LOGIC & SET THEORY 2017

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

More information

Logic. Def. A Proposition is a statement that is either true or false.

Logic. 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 information

Compound Propositions

Compound 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 information

Logic and Propositional Calculus

Logic 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 information

1.3 Propositional Equivalences

1.3 Propositional Equivalences 1 1.3 Propositional Equivalences The replacement of a statement with another statement with the same truth is an important step often used in Mathematical arguments. Due to this methods that produce propositions

More information

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

10/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 information

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Chapter 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 information

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman. Math 299 Homework Assignment, Chapter 2 Section 2.1 2.A (not in the text) Which of the following are statements? Explain. 1. Let x be a positive integer. Then x is rational. 2. Mathematics is fun. 3. The

More information

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows. Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is

More information

15414/614 Optional Lecture 1: Propositional Logic

15414/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 information

DISCRETE MATHEMATICS BA202

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

More information

AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold

AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH 3034 Jimmy T. Arnold i TABLE OF CONTENTS CHAPTER 1: The Structure of Mathematical Statements.............................1 1.1. Statements..................................................................

More information

Logic Overview, I. and T T T T F F F T F F F F

Logic 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 information

PHI Propositional Logic Lecture 2. Truth Tables

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

More information

A statement is a sentence that is definitely either true or false but not both.

A 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 information

Solutions to Exercises (Sections )

Solutions to Exercises (Sections ) s to Exercises (Sections 1.1-1.10) Section 1.1 Exercise 1.1.1: Identifying propositions (a) Have a nice day. : Command, not a proposition. (b) The soup is cold. : Proposition. Negation: The soup is not

More information

Section 1.3. Let I be a set. When I is used in the following context,

Section 1.3. Let I be a set. When I is used in the following context, Section 1.3. Let I be a set. When I is used in the following context, {B i } i I, we call I the index set. The set {B i } i I is the family of sets of the form B i where i I. One could also use set builder

More information

3.2: Compound Statements and Connective Notes

3.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 information

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional. Review Propositional Logic Propositions atomic and compound Operators: negation, and, or, xor, implies, biconditional Truth tables A closer look at implies Translating from/ to English Converse, inverse,

More information

Foundation of proofs. Jim Hefferon.

Foundation of proofs. Jim Hefferon. Foundation of proofs Jim Hefferon http://joshua.smcvt.edu/proofs The need to prove In Mathematics we prove things To a person with a mathematical turn of mind, the base angles of an isoceles triangle are

More information

Discrete Mathematics and Applications COT3100

Discrete Mathematics and Applications COT3100 Discrete Mathematics and Applications CO3100 Dr. Ungor Sources: Slides are based on Dr. G. Bebis material. uesday, January 7, 2014 oundations of Logic: Overview Propositional logic: (Sections 1.1-1.3)

More information

Ella failed to drop the class. Ella dropped the class.

Ella failed to drop the class. Ella dropped the class. Propositional logic In many cases, a sentence is built up from one or more simpler sentences. To see what follows from such a complicated sentence, it is helpful to distinguish the simpler sentences from

More information

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete 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 information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #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 information

The statement calculus and logic

The 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 information

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN 021 McLoughlin Handout 1.3, page 1 of 6 FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN Truth Table for Not K K T F F T Truth Table for And B M B M T F F F T F F F F Truth Table for Or R S R S T

More information

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

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

More information

Read ahead and use your textbook to fill in the blanks. We will work the examples together.

Read ahead and use your textbook to fill in the blanks. We will work the examples together. Math 1312 Section 1.1 : Sets, Statements, and Reasoning Read ahead and use your textbook to fill in the blanks. We will work the examples together. A set is any. hese objects are called the of the set.

More information

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares

More information

n 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

n 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 information

Section 1.1: Propositions and Connectives

Section 1.1: Propositions and Connectives Section 1.1: Propositions and Connectives Definition : Proposition: A statement that has exactly one truth value, i.e., either true (T) or false (F). Axiom (or Postulate): A statement about the primitive

More information

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Stockholm University September 2016 Propositions Proposition:

More information

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018 University of California, San Diego Department of Computer Science and Engineering CSE 20 Solutions to Midterm Exam Winter 2018 Problem 1 (30 points) a. The boolean function f(p, q) = (q p) ( q p) is specified

More information

Prof. Girardi Exam 1 Math 300 MARK BOX

Prof. Girardi Exam 1 Math 300 MARK BOX NAME: Prof. Girardi 09.27.11 Exam 1 Math 300 problem MARK BOX points 1 40 2 5 3 10 4 5 5 10 6 10 7 5 8 5 9 8 10 2 total 100 Problem Inspiration (1) Quiz 1 (2) Exam 1 all 10 Number 3 (3) Homework and Study

More information

Chapter 1 Elementary Logic

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

More information

UNIT-I: Propositional Logic

UNIT-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 information

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Chapter 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 information

AMTH140 Lecture 8. Symbolic Logic

AMTH140 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 information

Propositional Equivalence

Propositional 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 information

Tautologies, Contradictions, and Contingencies

Tautologies, Contradictions, and Contingencies Section 1.3 Tautologies, Contradictions, and Contingencies A tautology is a proposition which is always true. Example: p p A contradiction is a proposition which is always false. Example: p p A contingency

More information

Math.3336: Discrete Mathematics. Propositional Equivalences

Math.3336: Discrete Mathematics. Propositional Equivalences Math.3336: Discrete Mathematics Propositional Equivalences Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall

More information

Chapter 1, Section 1.1 Propositional Logic

Chapter 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 information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

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

More information

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

HW1 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 information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Describe and use algorithms for integer operations based on their expansions Relate algorithms for integer

More information

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

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

More information

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:

Numbers 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 information

DEDUCTIVE REASONING Propositional Logic

DEDUCTIVE REASONING Propositional Logic 7 DEDUCTIVE REASONING Propositional Logic Chapter Objectives Connectives and Truth Values You will be able to understand the purpose and uses of propositional logic. understand the meaning, symbols, and

More information

Logical Reasoning. Chapter Statements and Logical Operators

Logical Reasoning. Chapter Statements and Logical Operators Chapter 2 Logical Reasoning 2.1 Statements and Logical Operators Preview Activity 1 (Compound Statements) Mathematicians often develop ways to construct new mathematical objects from existing mathematical

More information

Proofs. Joe Patten August 10, 2018

Proofs. Joe Patten August 10, 2018 Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital

More information

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction Midterm: Sample 3 ECS20 (Fall 2017) Part I: logic 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction or neither. 1) [p (q r)] [((r p) q) q] Let

More information

Homework assignment 1: Solutions

Homework assignment 1: Solutions Math 240: Discrete Structures I Due 4:30pm Friday 29 September 2017. McGill University, Fall 2017 Hand in to the mailbox at Burnside 1005. Homework assignment 1: Solutions Discussing the assignment with

More information

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship. LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,

More information

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

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

More information

Chapter 1: Formal Logic

Chapter 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 information

Propositions. Frequently, we will use the word statement instead of proposition.

Propositions. Frequently, we will use the word statement instead of proposition. Propositional Logic Propositions A proposition is a declaration of fact that is either true or false, but not both. Examples and non-examples: One plus two equals four (proposition) Mozart is the greatest

More information

GENERAL MATHEMATICS 11

GENERAL 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 information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

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

More information

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, 2016 Propositional logic 1 Vocabulary of propositional logic Vocabulary (1) a. Propositional letters: p, q, r, s, t, p 1, q 1,..., p 2, q 2,...

More information

Boolean Logic. CS 231 Dianna Xu

Boolean 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 information

Basic Logic and Proof Techniques

Basic Logic and Proof Techniques Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely

More information

Mat 243 Exam 1 Review

Mat 243 Exam 1 Review OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form

More information

CS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration

CS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration Lecture 4 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square dministration Homework assignment 1 is out Due next week on Wednesday, September 17 Problems: LISP programming a PL

More information

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both. Chapter 3: Logic Diana Pell Section 3.1: Statements and Quantifiers A statement is a declarative sentence that is either true or false, but not both. Exercise 1. Decide which of the following are statements

More information

COT 2104 Homework Assignment 1 (Answers)

COT 2104 Homework Assignment 1 (Answers) 1) Classify true or false COT 2104 Homework Assignment 1 (Answers) a) 4 2 + 2 and 7 < 50. False because one of the two statements is false. b) 4 = 2 + 2 7 < 50. True because both statements are true. c)

More information

Logical Representations. LING 7800/CSCI 7000 Martha Palmer 9/30/2014

Logical Representations. LING 7800/CSCI 7000 Martha Palmer 9/30/2014 Logical Representations LING 7800/CSCI 7000 Martha Palmer 9/30/2014 1 The Semantic Wall Physical Symbol System World +BLOCKA+ +BLOCKB+ +BLOCKC+ P 1 :(IS_ON +BLOCKA+ +BLOCKB+) P 2 :((IS_RED +BLOCKA+) Truth

More information

PHIL12A Section answers, 16 February 2011

PHIL12A Section answers, 16 February 2011 PHIL12A Section answers, 16 February 2011 Julian Jonker 1 How much do you know? 1. Show that the following sentences are equivalent. (a) (Ex 4.16) A B A and A B A B (A B) A A B T T T T T T T T T T T F

More information

a. ~p : if p is T, then ~p is F, and vice versa

a. ~p : if p is T, then ~p is F, and vice versa Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.

More information

1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form

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

More information