ON1 Big Mock Test 4 October 2013 Answers This test counts 4% of assessment for the course. Time allowed: 10 minutes

Similar documents
Philosophy 220. Truth-Functional Equivalence and Consistency

Predicates and Quantifiers

Introduction to Sets and Logic (MATH 1190)

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.

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final exam Logic & Set Theory (2IT61) (correction model)

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

1 Tautologies, contradictions and contingencies

Topics in Logic and Proofs

Chapter 4: Classical Propositional Semantics

PHIL12A Section answers, 16 February 2011

Part I: Propositional Calculus

1.1 Language and Logic

3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.

1 Completeness Theorem for First Order Logic

1.1 Language and Logic

With Question/Answer Animations. Chapter 2

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.

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

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.

Mathematical Preliminaries. Sipser pages 1-28

CSC165 Mathematical Expression and Reasoning for Computer Science

MATH 2001 MIDTERM EXAM 1 SOLUTION

Logic, Sets, and Proofs

SET THEORY. Disproving an Alleged Set Property. Disproving an Alleged Set. Example 1 Solution CHAPTER 6

Propositional Logic: Models and Proofs

THE LOGIC OF COMPOUND STATEMENTS

PUZZLE. You meet A, B, and C in the land of knights and knaves. A says Either B and I are both knights or we are both knaves.

THE LOGIC OF QUANTIFIED STATEMENTS

PHIL 422 Advanced Logic Inductive Proof

Mat 243 Exam 1 Review

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic

PHIL12A Section answers, 28 Feb 2011

Propositional logic (revision) & semantic entailment. p. 1/34

CSC Discrete Math I, Spring Propositional Logic

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

Section 3.1: Direct Proof and Counterexample 1

Direct Proof and Proof by Contrapositive

2.2: Logical Equivalence: The Laws of Logic


Propositional Logic Not Enough

Incomplete version for students of easllc2012 only. 6.6 The Model Existence Game 99

Propositional Logic. Fall () Propositional Logic Fall / 30

For all For every For each For any There exists at least one There exists There is Some

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

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe:

Introduction to Set Operations

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Artificial Intelligence

HANDOUT AND SET THEORY. Ariyadi Wijaya

Predicate Logic: Sematics Part 1

CSE 1400 Applied Discrete Mathematics Definitions

2 Truth Tables, Equivalences and the Contrapositive

CHAPTER 6. Copyright Cengage Learning. All rights reserved.

Description Logics. Deduction in Propositional Logic. franconi. Enrico Franconi

Formal Definition of a Finite Automaton. August 26, 2013

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

3.1 Universal quantification and implication again. Claim 1: If an employee is male, then he makes less than 55,000.

Section Summary. Section 1.5 9/9/2014

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

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

Propositional and Predicate Logic - VII

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!

Propositional Logic: Review

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.

Equivalence and Implication

1 Completeness Theorem for Classical Predicate

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA

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

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Propositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications

Manual of Logical Style

Informatics 1 - Computation & Logic: Tutorial 1

Proofs. Joe Patten August 10, 2018

Lecture 7. Logic. Section1: Statement Logic.

CS 173: Discrete Structures. Eric Shaffer Office Hour: Wed. 1-2, 2215 SC

A generalization of modal definability

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

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

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1

Math 10850, fall 2017, University of Notre Dame

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

4. Sets The language of sets. Describing a Set. c Oksana Shatalov, Fall

The Process of Mathematical Proof

I thank the author of the examination paper on which sample paper is based. VH

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Computation and Logic Definitions

THE LOGIC OF QUANTIFIED STATEMENTS

3.4 Set Operations Given a set A, the complement (in the Universal set U) A c is the set of all elements of U that are not in A. So A c = {x x / A}.

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

INTRODUCTION TO LOGIC

Stanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014

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

1.1 Statements and Compound Statements

practice: logic [159 marks]

Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science

Transcription:

ON1 Big Mock Test 4 October 2013 Answers This test counts 4% of assessment for the course. Time allowed: 10 minutes The actual test will contain only 2 questions. Marking scheme: In each multiple choice question, 2 marks are given for a complete correct answer, 1 mark for an incomplete correct answer, 0 for an incorrect or partially incorrect answer or no answer. A correct answer might contain more than one choice. Tick the correct box (or boxes): 1. Which of the following subsets of R is non-empty? (A) [2, 3] [0, 2] (B) ( 1, 1) ( 2, 2) (C) { 1, 1} { 2, 2} (D) None of the above Solution: (A) and (B). Indeed, [2, 3] [0, 2] = {2} =, ( 1, 1) ( 2, 2) = ( 1, 1), but { 1, 1} { 2, 2} =. 2. Which of the following sets is empty? (A) [1, 2] [2, 3] (B) (1, 2) (2, 3) (C) {1, 2} {2, 3} (D) All of the above Solution: (B). Two other sets are not empty: [1, 2] [2, 3] = {2} and Boolean algebra of sets {1, 2} {2, 3} = {2}. 3. Let X, Y and Z be sets such that X Y. Which of the following must be true? (A) X Z Y Z (B) X Y (C) X (Y Z) = X (Y Z)

Solution: (A) Use the following Venn diagram: 4. Let X, Y and Z be sets such that Y X. Which of the following must be true? (A) X Z Y Z (B) Y X (C) Y Z X Z (D) X (Y Z) = Y (X Z) Solution: (D). Indeed, by distributivity since Y X, we have X Y = Y and X (Y Z) = (X Y ) (X Z); X (Y Z) = Y (X Z). The falsity in the general situation of (A), (B), and (C), and necessary validity of (D) can be be easily seen from a Venn diagram (similar to the one in the solution to the previous question) which reflects the assumption that Y X. Try to do that! 5. Let X, Y and Z be sets such that Y X. Which of the following must be true? (A) Y X (B) Y X (C) Y Z X Z Solution: (C). Draw Venn diagrams. 2

6. Let X and Y be subsets of an universal set U such that Y X. Which of the following can never be true? (A) Y X (B) X Y (C) X Y (D) None of the above Solution: (D). Indeed (A) and (C) are both true when Y = X (actually, (C) is always true when Y X). (B) is true when Y X. Since each of (A), (B), (C) can happen be true, (D) is the answer. If you are still feel confused, consider the following rewording of the problem which is equivalent to the original one, that is, retains exactly the same meaning: Assume that X and Y are subsets of an universal set U such that Y X. Which of the following statements (A), (B), or (C) will always contradict the assumptions made? (A) Y X (B) X Y (C) X Y (D) None of the above 7. [Omitted, repeated the previous problem] Tautologies 8. Which of the following statements is a tautology? (A) (p q) ( p q) (B) (p q) ( p q) (C) (q p) ( p q) Solution: (A). There are several approaches to solution. The first two are universal they work for every formula. (I) The simplest (but not the shortest) approach just make truth tables for each of the three formulae. There is no need to compute the entire table; as soon as you got truth value F for the formula for some combination of values of p and q, you know 3

that the formula is not a tautology. (II) Similarly, you can use logical equivalences. For example, for (C) you have (q p) ( p q) ( q p) ( p q) ( q p) (p q) ( q p) ( q p) q p. But q p is not a tautology (why?). (III) Occasionally, a direct inspection of the formula yields the answer. For example, to see that (A) is a tautology it suffices to observe that one of the statements p and p is false, hence the corresponding conditional statement p q or p q is true; therefore, the disjunction (p q) ( p q) of two conditionals is true. (IV) Sometimes, a formulation of a statement in natural language helps. For example, to see that (B) is not a tautology, make a sentence of the same logical construction (p q) ( p q), say Apple is red and sweet or apple is not red and not sweet. But an apple can happen to be golden and sweet, thus making the sentence false. Hence (B) is not a tautology. Of course, in a multiple choice test you can use any method that works. 4

Logical equivalencies 9. Which of the following statements is NOT logically equivalent to (p p) (p q)? (A) (p q) (p p) (B) q (p q) (C) (q q) (q r) (D) None of the above Solution: (A), because it is F when p and q are T, while all other statements are tautologies. 10. Which of the following statements is logically equivalent to p (p q)? (A) p (p q) (B) q (p q) (C) (D) p q None of the above Solution: (B), because the formulae p (p q) and q (p q) are both tautologies, while the formulae p (p q) and are not. p q 5

Predicates 11. For real numbers x and y, let p(x, y) denote the predicate x > y + 1. Which of the following statements is true? (A) p(2, 1) p(1, 1) (B) p(0, 0) p(1, 2) (C) p(π, 1) p(1, π) (here π = 3.1415926...). Solution: (A), Because p(2, 1) is F. 12. For a real number x, let p(x) denote the predicate x > 1 and let q(x) denote the predicate x {0, 1, 2}. Which of the following statements is true? (A) p(1) q( 1) (B) p(1) p( 1) (C) (p(2) q(2)) Solution: (B), because (A), (B), and (C) become, correspondingly, T F, T F, and (T T ); of these, only (B) is T. 13. For a real number x, let p(x) denote the predicate x 2 > 0 x 0 and let q(x) denote the predicate x {0, 1, 2}. Which of the following statements is true? (A) p(1) q( 1) (B) p(1) p( 1) (C) (p(2) q(2)) (D) None of the above. Solution: (D). First of all notice that p(x) is T for all real x, while q( 1) is F and q(2) is T. Therefore statements (A), (B), and (C) become (A) T F, (B) T T, and (C) (T T ), none of which is T. 6