Test 6A. Chapter 6 Test A
|
|
- Franklin Holt
- 5 years ago
- Views:
Transcription
1 Logic Chapter 6 Test A Name: Except for the truth table questions (which are double credit), each question is worth 2 points. Write your answer on the form provided. Erasure marks may cause the grading machine to mark your answer wrong. Select the correct translation for the following problems. 1. Either Breitling has a diamond model and Rado advertises a calendar watch or Tissot has luminous hands. a. B (R T) b. (B R) T c. (B R) T d. B R T e. B (R T) 2. If Movado offers a blue dial, then neither Fossil is water resistant nor Nautica promotes a titanium case. a. M ( F N) b. M (F N) c. M ( F N) d. M (F N) e. M F N 3. Piaget has a gold watch only if both Seiko has leather bands and Breitling has a diamond model. a. P (S B) b. (S B) P c. (S B) P d. (S B) P e. S (B P) 4. Gucci features stainless steel; also, Fossil is water resistant given that Cartier offers a stop watch. a. G (C F) b. (G C) F c. G (F C) d. C (G F) e. G (C F) 1
2 5. Movado and Nautica offer a black dial if and only if Piaget has a gold watch. a. (M N) P b. (M N) P c. (M N) P d. P (N N) e. (P M) (P N) 6. If Tissot has luminous hands, then if either Rado advertises a calendar model or Fossil is water resistant, then Gucci features stainless steel. a. (R F) (T G) b. (R T) (F G) c. [T (R F)] G d. T [(R G) (F G)] e. T [(R F) G] 7. Cartier s offering a stop watch implies that Seiko has leather bands, provided that both Rado advertises a calendar model and Tissot has luminous hands. a. (R T) (C S) b. (R C) (T S) c. (C S) (R T) d. [R (C S)] [T (C S)] e. (R T) (C S) 8. Movado s offering an ivory dial is a sufficient condition for Breitling s having a ruby model if Gucci s offering a better warranty is a necessary condition for Fossil s being water resistant. a. (M B) (F G) b. (B M) (G F) c. (G F) (B M) d. (F G) (M B) e. F [G (M B)] 9. Piaget and Nautica do not have a sapphire watch unless Breitling s having a diamond watch is a sufficient and necessary condition for either Cartier s offering multiple dials or Gucci s selling a self-winder. a. (P N) [(C G) B] b. ( P N) [(B C) (G B)] c. ( P N) [(B (C G)] d. ( P N) [(B (C G)] e. [(B (C G)] ( P N) 2
3 10. Seiko has a quartz watch if and only if either Movado does not offer a silver dial or Rado does not have a calendar watch; however, Tissot has luminous hands only if both Fossil is water resistant and Rado has a calendar model. a. [S (M R)] [T (F R)] b. [S ( M R)] [(F R) T] c. [( M R) S] [T (F R)] d. [S ( M R)] [T (F R)] e. [S ( M R)] [T (F R)] Given that A and B are true and X and Y are false, determine the truth values of the propositions in problems 11 and [A (B Y)] [B (X A)] a. True. b. False. 12. In problem 11, the main operator is a: a. Tilde. b. Wedge. c. Triple bar. d. Dot. e. Horseshoe. 13. [(X A) (B Y)] [(B Y) (A X)] a. True. b. False. 14. In problem 13, the main operator is a: a. Wedge. b. Tilde. c. Dot. d. Horseshoe. e. Triple bar. Use ordinary truth tables to answer problems The truth table problems are double credit. Construct the truth tables as per the instructions in the textbook. 15. Given the statement: (N K) (K N) This statement is: a. Contingent. b. Inconsistent. c. Consistent. d. Tautologous. e. Self-contradictory. 3
4 16. Select the same answer as problem The truth table in problem 15 has how many lines? a. Six. b. Four. c. Two. d. Eight. e. Nine. 18. Given the statement: (G Q) (Q G) This statement is: a. Consistent. b. Self-contradictory. c. Tautologous. d. Contingent. e. Logically equivalent. 19. Select the same answer as problem Given the statement: [ H (E D)] [(H E) (H D)] This statement is: a. Tautologous. b. Valid. c. Contingent. d. Inconsistent. e. Self-contradictory. 21. Select the same answer as problem The truth table in problem 20 has how many lines? a. Four. b. Eight. c. Twelve. d. Six. e. Nine. 23. Given the pair of statements: (R M) and M R a. Inconsistent. b. Invalid. c. Logically equivalent. d. Consistent. e. Contradictory. 24. Select the same answer as problem 23. 4
5 25. Given the pair of statements: (S Q) and Q S a. Logically equivalent. b. Valid. c. Contradictory. d. Consistent. e. Inconsistent. 26. Select the same answer as problem Given the pair of statements: C L and L C a. Consistent. b. Inconsistent. c. Contradictory. d. Logically equivalent. e. Valid. 28. Select the same answer as problem Given the argument: B M / B K // (K M) B This argument is: a. Invalid; fails in 3 rd line. b. Invalid; fails in 2 nd line. c. Invalid; fails in 1 st line. d. Invalid; fails in 4 th line. e. Valid. 30. Select the same answer as problem Given the argument: S (N H) / S N // S H This argument is: a. Invalid; fails in 4 th line. b. Invalid; fails in 2 nd line. c. Invalid; fails in 5 th line. d. Valid. e. Invalid; fails in 3 rd line. 32. Select the same answer as problem 31. 5
6 Use indirect truth tables to answer problems Given the argument: E J / B Q / D (J Q) // (E B) D This argument is: a. Uncogent. b. Sound. c. Valid. d. Invalid. e. Cogent. 34. Select the same answer as problem Given the argument: (K C) (P R) / J (K P) / A (P R) // (A J) C This argument is: a. Cogent. b. Sound. c. Valid. d. Uncogent. e. Invalid. 36. Select the same answer as problem Given the statements: S (Q L) / (Q G) (S N) / L (N S) / S N a. Inconsistent. b. Invalid. c. Tautologous. d. Logically equivalent. e. Consistent. 38. Select the same answer as problem Given the statements: R (M C) / (P U) C / M P / R U a. Contradictory. b. Tautologous. c. Valid. d. Inconsistent. e. Consistent. 40. Select the same answer as problem 39. Determine whether the following symbolized arguments are valid or invalid by identifying the form of each. In some cases the argument must be rewritten using double negation or commutativity before it has a named form. Those arguments without a specific name are invalid. 6
7 41. H M M H a. DA invalid. b. MP valid. c. AC invalid. d. MT valid. e. HS valid. 42. ( G E) (R M) R G E M a. MT valid. b. Invalid. c. DA invalid. d. MP valid. e. AC invalid. 43. (R T) (D T) T T R D a. MT valid. b. CD invalid. c. CD valid. d. HS valid. e. DD valid. 44. D N D N a. MP valid. b. MT invalid. c. DA invalid. d. AC invalid. e. Invalid. 45. S S F F a. MP valid. b. AC valid. c. MT valid. d. AC invalid. e. DS valid. 7
8 46. S T S T a. DA invalid. b. CD valid. c. Invalid. d. DD valid. e. CD invalid. 47. J C C T J T a. DD valid. b. MP valid. c. CD valid. d. Invalid. e. HS valid. 48. L N L N a. AC invalid. b. DA invalid. c. MP valid. d. MT valid. e. DS invalid. 49. G T (G H) ( T A) H A a. MP valid. b. CD valid. c. DD valid. d. Invalid. e. DD invalid. 50. K B B K a. DA invalid. b. Invalid. c. MT valid. d. DS valid. e. MP valid. 8
9 Logic Chapter 6 Test B Name: Except for the truth table questions (which are double credit), each question is worth 2 points. Write your answer on the form provided. Erasure marks may cause the grading machine to mark your answer wrong. Select the correct translation for the following problems. 1. Princess drops its dress codes or Oceania enlarges its fleet, and Seabourn reduces its fares. a. P (O S) b. (P O) S c. P (O S) d. P O S e. (P O) S 2. Not either Regent enlarges its casinos or Celebrity revises its itineraries if Holland remodels its staterooms. a. H (R C) b. H ( R C) c. (R C) H d. ( R C) H e. H ( R C) 3. Norwegian improves its entertainment only if both Disney does not promote family cruises and Windstar does not diversify its activities. a. N ( D W) b. N ( D W) c. ( D W) N d. N (D W) e. (D W) N 4. Either Azmara or Seabourn do not open new boutiques provided that Princess improves its cuisine. a. P ( A S) b. ( A S) P c. ( A S) P d. P (A S) e. (A S) P 9
10 5. Carnival advertises its parties if and only if Disney s promoting family cruises implies that Norwegian improves its entertainment. a. (C D) N b. (C D) (N C) c. C (D N) d. C (D N) e. C (N D) 6. If Disney promotes family cruises, then if either Holland remodels its staterooms or Regent enlarges its casinos, then Windstar diversifies its activities. a. [D (H R)] W b. D [(H R) W] c. [(H R) D] W d. D [(H R) W] e. D (H R) W 7. Princess and Azmara improve gym facilities only if neither Carnival controls rowdiness nor Seabourn reduces fares. a. (P A) ( C S) b. (P A) (C S) c. (C S) (P A) d. (P A) ( C S) e. ( C S) (P A) 8. Regent s enlarging its casinos is a necessary condition for Disney s offering games if and only if Windstar s diversifying its activities is a sufficient condition for Costa s enlarging its nightspots. a. (R D) (C W) b. (D W) (R C) c. (D R) (W C) d. (D R) (W C) e. (R D) (W C) 9. Azmara s opening new boutiques is a sufficient and necessary condition for both Norwegian s improving entertainment and Holland s remodeling its staterooms if Princess s dropping its dress codes implies that Celebrity revises its itineraries. a. (P C) [(A N) (A C)] b. (P C) [A (N H)] c. [A (N H)] (P C) d. [(A N) (A C)] (P C) e. (P C) [A (N H)] 10
11 10. Seabourn revises its menu given that Norwegian and Princess halt tipping, unless Oceania enlarges its fleet if and only if both Costa improves its gym facilities and Regent enlarges its casinos. a. [S (N P)] [O (C R)] b. [(N P) S] [O (C R)] c. [(N P) S] [O (C R)] d. [S (N P)] [O (C R)] e. [S (N P)] [O (C R)] Given that A and B are true and X and Y are false, determine the truth values of the propositions in problems 11 and [(A B) X] [ Y (A X)] a. True. b. False. 12. In problem 11, the main operator is a: a. Dot. b. Triple bar. c. Wedge. d. Tilde. e. Horseshoe. 13. [(A Y) (B X)] [(B X) (Y A)] a. True. b. False. 14. In problem 13, the main operator is a: a. Horseshoe. b. Dot. c. Tilde. d. Wedge. e. Triple bar. Use ordinary truth tables to answer problems The truth table problems are double credit. Construct the truth tables as per the instructions in the textbook. 15. Given the statement: (R B) (B R) This statement is: a. Logically equivalent. b. Tautologous. c. Self-contradictory. d. Contingent. 11
12 e. Consistent. 16. Select the same answer as problem The truth table in problem 15 has how many lines? a. Six. b. Four. c. Two. d. Eight. e. Nine. 18. Given the statement: [N (S J)] [S (N J)] This statement is: a. Inconsistent. b. Contingent. c. Consistent. d. Self-contradictory. e. Tautologous. 19. Select the same answer as problem The truth table in problem 18 has how many lines? a. Nine. b. Twelve. c. Four. d. Eight. e. Six. 21. Given the statement: (F S) (S F) This statement is: a. Contingent. b. Self-contradictory. c. Inconsistent. d. Valid. e. Tautologous. 22. Select the same answer as problem Given the pair of statements: G H and H G a. Invalid. b. Consistent. c. Logically equivalent. d. Contradictory. e. Inconsistent. 24. Select the same answer as problem
13 25. Given the pair of statements: J M and (J M) (M J) a. Valid. b. Consistent. c. Contradictory. d. Logically equivalent. e. Inconsistent. 26. Select the same answer as problem Given the pair of statements: D R and R D a. Logically equivalent. b. Consistent. c. Contradictory. d. Valid. e. Inconsistent. 28. Select the same answer as problem Given the argument: K (M H) / M H / M K // K H This argument is: a. Invalid; fails in 1 st line. b. Invalid; fails in 2 nd line. c. Valid. d. Invalid; fails in 4 th line. e. Invalid; fails in 3 rd line. 30. Select the same answer as problem Given the argument: R I / S (R I) // S I This argument is: a. Valid. b. Invalid; fails in 4 th line. c. Invalid; fails in 2 nd line. d. Invalid; fails in 5 th line. e. Invalid; fails in 3 rd line. 32. Select the same answer as problem
14 Use indirect truth tables to answer problems Given the argument: Q S / (N A) / S A / (P N) (G Q) // P G This argument is: a. Valid. b. Uncogent. c. Invalid. d. Cogent. e. Sound. 34. Select the same answer as problem Given the argument: J C / R I / I (U J) / (R U) (C J) // C This argument is: a. Sound. b. Uncogent. c. Invalid. d. Cogent. e. Valid. 36. Select the same answer as problem Given the statements: Q (N S) / N (L B) / (S E) (Q B) / Q B a. Inconsistent. b. Consistent. c. Invalid. d. Tautologous. e. Logically equivalent. 38. Select the same answer as problem Given the statements: P (A M) / (D K) (M H) / (A H) D / P D a. Contradictory. b. Tautologous. c. Valid. d. Inconsistent. e. Consistent. 40. Select the same answer as problem
15 Determine whether the following symbolized arguments are valid or invalid by identifying the form of each. In some cases the argument must be rewritten using double negation or commutativity before it has a named form. Those arguments without a specific name are invalid. 41. D C R D R C a. MP valid. b. DS valid. c. Invalid. d. CD valid. e. HS valid. 42. ( C J) (P L) J L C P a. CD valid. b. Invalid. c. DD valid. d. MT valid. e. CD invalid. 43. M M G G a. AC invalid. b. MT valid. c. DS invalid. d. DA invalid. e. MP valid. 44. N A N A a. DS valid. b. HS valid. c. MT valid. d. DA invalid. e. MP valid. 45. D E E D a. AC invalid. b. DS invalid. c. Invalid. 15
16 d. MP valid. e. HS valid. 46. K N K N a. HS valid. b. MP valid. c. MT valid. d. DS valid. e. AC invalid. 47. Q H Q H a. MT invalid. b. MP valid. c. DA invalid. d. DS valid. e. AC invalid. 48. E A B E B A a. Invalid. b. DD invalid. c. HS valid. d. CD valid. e. DS valid. 49. ( H K) (H T) H H T K a. Invalid. b. CD valid. c. DD valid. d. DA invalid. e. MP valid. 16
17 50. S F F S a. MP valid. b. DS invalid. c. DA invalid. d. MT valid. e. DS valid. 17
Propositional Logic George Belic
1 Symbols and Translation (Ch 6.1) Our aim for the rest of the course is to study valid (deductive) arguments in symbolic systems. In this section, (Ch. 6-7) we look at the symbolic system of propositional
More informationPractice Exam 2. You MUST show all your work, and indicate which value is the main operator value.
Practice Exam 2 You MUS show all your work, and indicate which value is the main operator value. I. ranslate the following statements into symbolic form, using A, B, C, and D. hen, using your knowledge
More informationTruth 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 informationMath.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 informationNatural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
More 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 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 information1.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 informationPHI Propositional Logic Lecture 2. Truth Tables
PHI 103 - Propositional Logic Lecture 2 ruth ables ruth ables Part 1 - ruth unctions for Logical Operators ruth unction - the truth-value of any compound proposition determined solely by the truth-value
More information3.0. OBJECTIVES 3.1.INTRODUCTION
1 UNIT 3 INDIRECT PROOF Contents 1.0 Objectives 3.1.Introduction 3.2.The Meaning of Indirect Proof 3.3.Application of Indirect Proof 3.4.Examples 3.5.Exercises on Indirect Proof 3.6 Indirect Proof and
More informationSection 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.
Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency
More informationTautologies, 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 informationi.e. The conclusion to the following argument says If you had an A, then you d have a ~(B v Z).
7.5 Conditional Proof (CP): Conditional Proof is a different way to do proofs. Using CP will always get you a horseshoe statement, so the best time to use it is when your conclusion is either a horseshoe
More informationPL: Truth Trees. Handout Truth Trees: The Setup
Handout 4 PL: Truth Trees Truth tables provide a mechanical method for determining whether a proposition, set of propositions, or argument has a particular logical property. For example, we can show that
More information8.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
More informationSymbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
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 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 informationLogic 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 informationComputation and Logic Definitions
Computation and Logic Definitions True and False Also called Boolean truth values, True and False represent the two values or states an atom can assume. We can use any two distinct objects to represent
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 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 informationDERIVATIONS 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
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 informationMAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.
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)
More informationLogic and Truth Tables
Logic and Truth Tables What is a Truth Table? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. There are five basic operations
More informationBox. Turn in your e xam to Kathy Stackhouse in Chem 303 by noon on Thursday, March 30.
Phil 201 Exam #6 Score Name Instructions: Open book, open notes. Do all your work on these pages. When doing derivations in this exam, you may use any of the simple, complex, or derived rules of truth-functional
More informationDepartment of Computer Science & Software Engineering Comp232 Mathematics for Computer Science
Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science Fall 2018 Assignment 1. Solutions 1. For each of the following statements use a truth table to determine whether
More informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
More informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More informationSection 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 informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More information(ÀB Ä (A Â C)) (A Ä ÀC) Á B. This is our sample argument. Formal Proofs
(ÀB Ä (A Â C)) (A Ä ÀC) Á B This is our sample argument. Formal Proofs From now on, formal proofs will be our main way to test arguments. We ll begin with easier proofs. Our initial strategy for constructing
More informationFORMAL PROOFS DONU ARAPURA
FORMAL PROOFS DONU ARAPURA This is a supplement for M385 on formal proofs in propositional logic. Rather than following the presentation of Rubin, I want to use a slightly different set of rules which
More informationMat 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 informationTHE 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 informationIntroduction 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 informationSection 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 informationUnit 1 Logic Unit Math 114
Unit 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Deductive Reasoning: The application of a general statement to a specific instance. Deductive reasoning goes from general to specific
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationDeMorgan s Laws and the Biconditional. Philosophy and Logic Sections 2.3, 2.4 ( Some difficult combinations )
DeMorgan s aws and the Biconditional Philosophy and ogic Sections 2.3, 2.4 ( Some difficult combinations ) Some difficult combinations Not both p and q = ~(p & q) We won t both sing and dance. A negation
More informationTruth Tables for Propositions
Truth Tables for Propositions 1. Truth Tables for 2-Letter Compound Statements: We have learned about truth tables for simple statements. For instance, the truth table for A B is the following: Conditional
More informationUnit 1 Logic Unit Math 114
Unit 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Deductive Reasoning: The application of a general statement to a specific instance. Deductive reasoning goes from general to specific
More informationa. ~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 informationChapter 1 Logic Unit Math 114
Chapter 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Statements Definition: A statement is a group of words or symbols that can be classified as true or false. Examples of statements
More informationFor a horseshoe statement, having the matching p (left side) gives you the q (right side) by itself. It does NOT work with matching q s.
7.1 The start of Proofs From now on the arguments we are working with are all VALID. There are 18 Rules of Inference (see the last 2 pages in Course Packet, or front of txt book). Each of these rules is
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
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 informationCSE 20: Discrete Mathematics
Spring 2018 Summary Last time: Today: Logical connectives: not, and, or, implies Using Turth Tables to define logical connectives Logical equivalences, tautologies Some applications Proofs in propositional
More information8. Reductio ad absurdum
8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, 10 Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual
More informationSec$on Summary. Tautologies, Contradictions, and Contingencies. Logical Equivalence. Normal Forms (optional, covered in exercises in text)
Section 1.3 1 Sec$on Summary Tautologies, Contradictions, and Contingencies. Logical Equivalence Important Logical Equivalences Showing Logical Equivalence Normal Forms (optional, covered in exercises
More informationPart Two: The Basic Components of the SOFL Specification Language
Part Two: The Basic Components of the SOFL Specification Language SOFL logic Module Condition Data Flow Diagrams Process specification Function definition and specification Process decomposition Other
More informationPropositional Logic. Chrysippos (3 rd Head of Stoic Academy). Main early logician. AKA Modern Logic AKA Symbolic Logic. AKA Boolean Logic.
Propositional Logic. Modern Logic. Boolean Logic. AKA Modern Logic AKA Symbolic Logic. AKA Boolean Logic. Chrysippos (3 rd Head of Stoic Academy). Main early logician Stoic Philosophers Zeno ff301bc. Taught
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 informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More 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 informationLogic Review Solutions
Logic Review Solutions 1. What is true concerning the validity of the argument below? (hint: Use a Venn diagram.) 1. All pesticides are harmful to the environment. 2. No fertilizer is a pesticide. Therefore,
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 information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More informationCS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions
CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions 1. [10 points] Translate the following sentences into propositional logic, making the meaning of your propositional variables
More informationLogic and Truth Tables
Logic and ruth ables What is a ruth able? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. here are five basic operations
More informationC241 Homework Assignment 4
C241 Homework Assignment 4 1. Which of the following formulas are tautologies and which are contradictions? Which of the formulas are logically equivalent to each other? (a) p (q r) (b) ( p r) (q r) (c)
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 Language - Semantics
Propositional Language - Semantics Lila Kari University of Waterloo Propositional Language - Semantics CS245, Logic and Computation 1 / 41 Syntax and semantics Syntax Semantics analyzes Form analyzes Meaning
More informationPHIL12A Section answers, 28 Feb 2011
PHIL12A Section answers, 28 Feb 2011 Julian Jonker 1 How much do you know? Give formal proofs for the following arguments. 1. (Ex 6.18) 1 A B 2 A B 1 A B 2 A 3 A B Elim: 2 4 B 5 B 6 Intro: 4,5 7 B Intro:
More information2. Find all combinations of truth values for p, q and r for which the statement p (q (p r)) is true.
1 Logic Questions 1. Suppose that the statement p q is false. Find all combinations of truth values of r and s for which ( q r) ( p s) is true. 2. Find all combinations of truth values for p, q and r for
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More information8. Reductio ad absurdum
8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual infinities
More informationCS 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 informationPhilosophy 240 Symbolic Logic. Russell Marcus Hamilton College Fall 2015
Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2015 Class 2: Translation and Wffs ( 1.3-1.4) Marcus, Symbolic Logic, Fall 2015, Slide 1 Today P A little review (what we didn t do on
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 information1.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 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 informationa. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.
For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.
More informationPhilosophy 240 Symbolic Logic. Russell Marcus Hamilton College Fall 2014
Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014 Class 2: Translation and Wffs ( 1.3-1.4) Marcus, Symbolic Logic, Fall 2014, Slide 1 Problem Sets #5 and 6 P Printed Syllabus is incomplete.
More informationKOÇ UNIVERSITY EQUR 121 FIRST EXAM March 3, 2014
KOÇ UNIVERSITY EQUR 121 FIRST EXAM March 3, 2014 Burak Özbaǧcı Duration of Exam: 75 minutes INSTRUCTIONS: No calculators may be used on the test. No questions, and talking allowed. You must always explain
More informationMidterm Exam Solution
Midterm Exam Solution Name PID Honor Code Pledge: I certify that I am aware of the Honor Code in effect in this course and observed the Honor Code in the completion of this exam. Signature Notes: 1. This
More informationLogical Form 5 Famous Valid Forms. Today s Lecture 1/26/10
Logical Form 5 Famous Valid Forms Today s Lecture 1/26/10 Announcements Homework: --Read Chapter 7 pp. 277-298 (doing the problems in parts A, B, and C pp. 298-300 are recommended but not required at this
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 informationCHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC
1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of
More informationPSU 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 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 informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More informationCHAPTER 1 - LOGIC 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 informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationFirst-Order Logic (FOL)
First-Order Logic (FOL) Also called Predicate Logic or Predicate Calculus 2. First-Order Logic (FOL) FOL Syntax variables x, y, z, constants a, b, c, functions f, g, h, terms variables, constants or n-ary
More informationPHIL12A 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 informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More 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 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 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 informationDEDUCTIVE 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 informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationMATH1050B/C Assignment 6 Supplement (Answers)
MATH1050B/C Assignment 6 Supplement (Answers) 1. (a) Let P,Q be statements. [(P Q) P] Q is true irrespective of the truth values of P,Q. Hence it is a tautology. This is a truth table displaying the truth
More information2/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 informationMathematical 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 informationPropositional Logic Review
Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining
More informationCOMP219: Artificial Intelligence. Lecture 20: Propositional Reasoning
COMP219: Artificial Intelligence Lecture 20: Propositional Reasoning 1 Overview Last time Logic for KR in general; Propositional Logic; Natural Deduction Today Entailment, satisfiability and validity Normal
More information1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.
Chapter 1.10 Logic Gates 1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output. Microprocessors are the central hardware that runs computers. There are several components that
More information