Question 1 (a). Explain different logical connectives with the help of examples. Ans: Logical Connectivity:-
|
|
- Rosanna Hunter
- 5 years ago
- Views:
Transcription
1 Course Code : MCS-013 Course Title : Discrete Mathematics Assignment Number : MCA(1)/013/Assignment/17-18 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15th October, 2017 (For July 2017 Session) : 15th April, 2018 (For January 2018 Session) Question 1 (a). Explain different logical connectives with the help of examples. Ans: Logical Connectivity:- In logic, a logical connective (also called a logical operator) is a symbol or word used to connect two or more sentences (of either a formal or a natural language) in a grammatically valid way, such that the sense of the compound sentence produced depends only on the original sentences. The most common logical connectives are binary connectives (also called dyadic connectives) which join two sentences which can be thought of as the function's operands. Also commonly, negation is considered to be a unary connective. Different Types of Logical Connectivity:- Disjunction :- Definition: The disjunction of two propositions p and q is the compound statement p or q, denoted by p q. For example, Zarina has written a book or Singh has written a book. Is the disjunction of p and q, where p : Zarina has written a book, and q : Singh has written a book. Similarly, if p denotes 2 > 0 and q denotes 2 < 5, then p q denotes the statement 2 is greater than 0 or 2 is less than 5.. Let us consider an example.
2 Example 1: Obtain the truth value of the disjunction of The earth is flat. and = 2. Solution: Let p denote The earth is flat, and q denote = 2. Then we know that the truth values of both p and q are F. Therefore, the truth value of p q is F. Conjunction:- As in ordinary language, we use and to combine simple propositions to make compound ones. For instance, and Prof. Rao teaches Chemistry. is formed by joining and Prof. Rao teaches Chemistry by and. Let us define the formal terminology for such a compound statement. Definition : We call the compound statement p and q the conjunction of the statements p and q. We denote this by p q. For instance, > 0 is the conjunction of and 2 > 0. Similarly, = 3 3 = 5 is the conjunction of = 3 and 3 = 5. Now, when would p q be true? Do you agree that this could happen only when both p and q are true, and not otherwise? For instance, = 3 3 = 5 is not true because 3 = 5 is false. So, the truth table for conjunction. Negation:- Definition: The negation of a proposition p is not p, denoted by ~p. For example, if p is Dolly is at the study center., then ~ p is Dolly is not at the study center. Similarly, if p is No person can live without oxygen., ~ p is At least one person can live without oxygen..
3 Conditional Connectives:- Consider the proposition I f Shruti gets 75% or more in the examination, then she will get an A grade for the course.. We can write this statement as If p, and q, where p: Shruti gets 75% or more in the examination, and q: Shruti will get an A grade for the course. This compound statement is an example of the implication of q by p. Definition : Given any two propositions p and q, we denote the statement If p, then q by p q. We also read this as p implies q. or p is sufficient for q, or p only if q. We also call p the hypothesis and q the conclusion. Further, a statement of the form p q is called a conditional statement or a conditional proposition. Precedence Rule While dealing with operations on numbers, you would have realized the need for applying the BODMAS rule. According to this rule, when calculating the value of an arithmetic expression, we first calculate the value of the Bracketed portion, then apply Of, Division, Multiplication, Addition and Subtraction, in this order. While calculating the truth value of compound propositions involving more than one connective, we have a similar convention which tells us which connective to apply first. Why do we need such a convention? Suppose we didn t have an order of preference, and want to find the truth of, say ~ p q. Some of us may consider the value of ( ~ p) q, and some may consider ~ ( p q). The truth values can be different in these cases. For instance, if p and q are both true, then ( ~ p) q is true, but ~ ( p q) is false. So, for the purpose of unambiguity, we agree to such an order or rule. The rule of precedence: The order of preference in which the connectives are applied in a formula of propositions that has no brackets is :- i) ~
4 ii) iii) and iv) and (b). Make truth table for followings: i) p (q ~ r) (~p ~r) ii) p (r ~ q) (~p ~q) Ans: i) p (q ~ r) (~p ~r) ii) p (r ~ q) (~p ~q) (c) Draw Venn diagram to represent followings: i) (A B) (B C D) ii) (A B C) (C~A) Ans: i) (A B) (B C D)
5 ii) (A B C) (C~A)
6 (d) Explain logical equivalence with the help of example. Ans: Logical equivalence is a type of relationship between two statements or sentences in propositional logic or Boolean algebra. The relation translates verbally into "if and only if" and is symbolized by a double-lined, double arrow pointing to the left and right ( ). If A and B represent statements, then A B means "A if and only if B." The statement A (A B) * (B A) B is exactly the same as where the asterisk (*) represents the logical AND operation, and the right-pointing, double-lined arrow ( ) represents logical implication. Logical equivalence works both ways. Thus, (A B) (B A) Logical equivalence is important in the design of digital circuits. Several circuits may be logically equivalent, in that they all have identical truth table s. The goal of the engineer is to find the circuit that performs the desired logical function using the least possible number of gates. This will result in optimal operating efficiency, reliability, and speed. Question 2 (a) Write down suitable mathematical statement that can be represented by the following symbolic properties. (i) ( x) ( y) ( z) P (ii) ( x) ( y) ( z) P
7 (b). Write the following statements in the symbolic form. i) Some students can pass in exam. ii) Everything is having life. Ans: (i) Some students can pass in exam. x(c(x) P(x)) Then you say that everything in the domain is a student in the course and passed the exam. However, presumably there are things in the domain other than students in the course. For example, that book that the student didn't read, or the exam that they took. So if they are in the domain, you would get that the book passed the exam, or that the exam is a student in the course... which is not what you want. What you want is that if something is a student in the course, then they passed the exam, i.e. you want the conditional. Of course, it is possible that the domain is simply all the students in the course, but then why would you need a predicate C(x)C(x)? If the domain was all students in the course, you could simply use x B(x) x B(x) for the first premise, and xp(x) xp(x) for the second. So, either way, (C(x) P(x)) (C(x) P(x)) is not what you want. (ii) Everything is having life. x(l(x) E(x)) We can say that Everything is having Life. and In another way, we can say that, ~ ( x(c(x) P(x))), that 's mean Nothing is having Life.
8 (c) What is indirect method of proof? Example with example. Ans : Definition Of Indirect Proof Indirect proof is a type of proof in which a statement to be proved is assumed false and if the assumption leads to an impossibility, then the statement assumed false has been proved to be true. Example of Indirect Proof Sum of 2n even numbers is even, where n > 0. Prove the statement using an indirect proof. The first step of an indirect proof is to assume that 'Sum of even integers is odd.' That is, n = an odd number 2( n) = an odd number 2 = an odd number n(n + 1) = an odd number, a contradiction, because n(n + 1) is always an even number. Thus, the statement is proved using an indirect proof. (d) What is relation? Explain equivalence relation with the help of an example Ans: An equivalence relation on a set S, is a relation on S which is reflexive, symmetric and transitive. Examples: Let S = Z and define R = {(x,y) x and y have the same parity} i.e., x and y are either both even or both odd. The parity relation is an equivalence relation. 1. For any x Z, x has the same parity as itself, so (x,x) R. 2. If (x,y) R, x and y have the same parity, so (y,x) R. 3. If (x,y) R, and (y,z) R, then x and z have the same parity as y, so they have the same parity as each other (if y is odd, both x and z are odd; if y is even, both x and z are even), thus (x,z) R. FOR EXAMPLE Let S = R and define the "square" relation R = {(x,y) x 2 = y 2}. The square relation is an equivalence relation. 1. For all x R, x 2 = x 2, so (x,x) R. 2. If (x,y) R, x 2 = y 2, so y 2 = x 2 and (y,x) R. 3. If (x,y) R and (y,z) R then x 2 = y 2 = z2, so (x,z) R. For any set S, the identity relation on S, I S = {(x,x) x S}. This is an equivalence relation for rather trivial reasons. 1. obvious 2. If (x,y) R then y = x, so (y,x) = (x,x) R. 3. If (x,y) R and (y,z) R then x = y = z, so (x,z) = (x,x) R. Question 3 (a) Draw logic circuit for the following Boolean Expressions: i) (x y z) + (x+y+z)' (b) Find dual of Boolean Expression for Q, in the figure given below. Ans:
9 (c) Explain De Morgan s laws in relation to Boolean Algebra. Ans: DeMorgan s Theorem is mainly used to solve the various Boolean algebra expressions.the Demorgan s theorem defines the uniformity between the gate with same inverted input and output. It is used for implementing the basic gate operation likes NAND gate and NOR gate. The Demorgan s theorem mostly used in digital programming and for making digital circuit diagrams. There are two DeMorgan s Theorems. Theorem 1 The left hand side (LHS) of this theorem represents a NAND gate with inputs A and B, whereas the right hand side (RHS) of the theorem represents an OR gate with inverted inputs. This OR gate is called as Bubbled OR.
10 Table showing verification of the De Morgan's first theorem Theorem 2 The LHS of this theorem represents a NOR gate with inputs A and B, whereas the RHS represents an AND gate with inverted inputs. This AND gate is called as Bubbled AND.
11 Table showing verification of the De Morgan's second theorem (d) What is principle of mathematical induction? Explain with the help of an example. Ans: Mathematical induction is a mathematical proof technique used to prove a given statement about any well-ordered set. Most commonly, it is used to establish statements for the set of all natural numbers. Mathematical induction is a form of direct proof, usually done in two steps. When trying to prove a given statement for a set of natural numbers, the first step, known as the base case, is to prove the given statement for the first natural number. The second step, known as the inductive step, is to prove that, if the statement is assumed to be true for any one natural number, then it must be true for the next natural number as well. Having proved these two steps, the rule of inference establishes the statement to be true for all natural numbers. In common terminology, using the stated approach is referred to as using the Principle of mathematical induction. Example: 'The sum of the natural numbers from 1 to n equals n(n+1)/2'. This is a property which depends on n. We write this fact as E(n). E(3) means in our example : ' The sum of the natural numbers from 1 to 3 equals 3(3+1)/2'.
12 A proof by induction is a common method to prove such a property. We show how the method works and why it is correct. Let V = { n E(n) is true }. First we prove E(1). Then we know that 1 is in V. Then we prove that: If E(k) is true, then E(k+1) is true. If that is proved, we know that: if k is in V then (k+1) is in V. But 1 is in V, so 2 is in V, so 3 is in V, etc... Then V = { 1,2,3,4,...} We have shown that the property E(n) is true for all natural numbers starting with 1. In our example is E(n) is n = (1+n)n/2 First step: We'll show the truth of E(1). We have to show: 1 = (1+1).1/2 We see immediately that both sides are equal. So, E(1) is true. V contains '1'. Second step: Assume for a moment that E (k) is true. Given : k = (1+k)k/2 We'll show the truth of E(k+1). Proof: left side = ( k)+ (k+1) = (1+k).k/2 + (k+1) = (k+1)(k+2)/2 right side = (1+(k+1)).(k+1)/2 = (2+k)(k+1)/2 We see that the left side is equal to the right side. Thus if E (k) is true then E(k+1) is true. If k is in V, then k+1 is in V. But 1 is in V, so 2 is in V, so 3 is in V, etc.. So, V = { 1,2,3,4,...}
13 Conclusion: The property is proved for all natural numbers starting from 1. Question 4 (a) How many different committees can be formed of 12 professionals, each containing at least 2 Professors, at least 3 Lecturers and 3 Administrative Officers, from a set of 5 Professors, 8 Lectures, and 5 Administrative Officers. Ans: PROFESSOR 2 Lecturers 3 Administrative Officers 3 SOLUTION IS C(5,2) + C(8,3) + C(5,3) ( 5X4)/(2X1) + (8X7X6)/(3X2X1) + (5X4X3)/(3X2X1) (b) There are two mutually exclusive events A and B with P(A) =0.7 and P(B) = 0.6. Find the probability of followings: i) A and B both occur ii) Both A and B does not occur iii) Either A or B does not occur Ans: i) A and B both occur P(A) = 1-P(A)= 1-0.7=0.3 P(B) = 1-P(B)= 1-0.6=0.4
14 ii) Both A and B does not occur P(A )=1-P(A)=1-0.7=0.3 P(B )=1-P(B)=1-0.6=0.4 iii) Either A or B does not occur P(A )=1-P(A)=1-0.7=0.3 P(B )=1-P(B)=1-0.6=0.4 P(A OR B ) = P(A ) + P(B ) - P(A AND B ) = = 0.4 (c) What is set? Explain the basic properties of sets. Ans: First we specify a common property among "things" (we define this word later) and then we gather up all the "things" that have this common property. For example, the items you wear: shoes, socks, hat, shirt, pants, and so on. I'm sure you could come up with at least a hundred. This is known as a set. Or another example is types of fingers. This set includes index, middle, ring, and pinky. So it is just things grouped together with a certain property in common. Sets are the fundamental property of mathematics. Now as a word of warning, sets, by themselves, seem pretty pointless. But it's only when we apply sets in different situations do they become the powerful building block of mathematics that they are. Question 5
15 (a) How many words can be formed using letter of UNIVERSITY using each letter at most once? i ) If each letter must be used, {U,N,I,V,E,R,S,T,Y} n=9 NO S OF WORD IS = 9! 9!= 7X6X5X4X3X2X1= WORD ( in the UNIVERSITY letter I two time be we count once time) ii) If some or all the letters may be omitted. =P(9,0) + p(9,1)+p(9,2) + p(9,3)+p(9,4) + p(9,5)+p(9,6) + p(9,7) = (9x8) + (9x8x7) + (9x8x7x6) +(9x8x7x6x5) +(9x8x7x6x5x4) +(9x8x7x6x5x4x3) = = b)show using truth table that: ( p q) q Þ p Ú q) (c) Explain whether (p q) (q r) is a tautology or not.
16 (d) Explain addition theorem in probability The addition theorem in the Probability concept is the process of determination of the probability that either event A or event B occurs or both occur. The notation between two events A and B the addition is denoted as ' ' and pronounced as Union. The result of this addition theorem generally written using Set notation, P (A B) = P(A) + P(B) P(A B), Where, P (A) = probability of occurrence of event A P (B) = probability of occurrence of event B P (A B) = probability of occurrence of event A or event B. P (A B) = probability of occurrence of event A or event B. Addition theorem probability can be defined and proved as follows: Let A and B are Subsets of a finite non empty set S then according to the addition rule P (A B) = P (A) + P (B) P (A). P (B), On dividing both sides by P(S), we get P (A B) / P(S) = P (A) / P(S) + P (B) / P(S) P (A B) / P(S) (1). If the events A and B correspond to the two events A and B of a random experiment and if the set S corresponds to the Sample Space S of the experiment then the equation (1) becomes P (A B) = P (A) + P (B) P (A). P (B), This equation is known as the addition theorem in probability. Here the event A B refers to the meaning that either event A or event B occurs or both may occur simultaneously. If two events A and B are Mutually Exclusive Events then A B = ф, Therefore P (A B) = P (A) + P(B) [since P(A B) = 0], In language of set theory A B is same as A / B. (e) Prove that the inverse of one-one onto mapping is unique. A function is onto if and only if for every yy in the codomain, there is an xx in the domain such that f(x)=yf(x)=y. So in the example you give, f:r R,f(x)=5x+2f:R R,f(x)=5x+2, the domain and codomain are the same set: R.R. Since, for every real number y R,y R, there is an x Rx R such that f(x)=yf(x)=y, the function is onto. The example you include shows an explicit way to determine
17 which xx maps to a particular yy, by solving for xx in terms of y.y. That way, we can pick any yy, solve for f (y)=xf (y)=x, and know the value of xx which the original function maps to that yy. Side note: Note that f (y)=f 1(x)f (y)=f 1(x) when we swap variables. We are guaranteed that every function ff that is onto and one-to-one has an inverse f 1f 1, a function such that f(f 1(x))=f 1(f(x))=xf(f 1(x))=f 1(f(x))=x. Question 6 (a) How many ways are there to distribute 15 district objects into 5 distinct boxes with i) At least three empty box. C(5,3) X P(15,2)X C(5,4) X P(15,1)X C(5,5) X P(15,0)X0 15 ii) No empty box. C(15,5) x 5 5 x5! (b) Explain principle of multiplication with an example. ANS:- Multiplication Principle states: If an event occurs in m ways and another event occurs independently in n ways, then the two events can occur in m n ways. Examples of Multiplication Principle A pizza corner sells pizza in 3 sizes with 3 different toppings. If Bob wants to pick one pizza with one topping, there is a possibility of 9 combinations as the total number of outcomes is equal to Number of sizes of pizza Number of different toppings. (c) Set A,B and C are: A = {1, 2, 3,5, 8, 11 12,13}, B = { 1,2, 3,4, 5,6 } and C={ 7,8,12, 13}. Find A B C, A B C, A B C and (B~C) A B U C ={1,2,3,5,7,8,12,13} A U B U C={ 1,2,3,4,5,6,7,8,11,12,13} A U B C= {8,12,13} (B~C)= { 1,2, 3,4, 5,6 } (d) In a class of 40 students; 30 have taken science; 20 have taken mathematics and 8 has neither taken mathematic nor science. Find how many students have taken: i) both subjects. Ans :- (i)
18 Science(s) = 30 Math(m) = 20 and 8 student has neither taken mathematic nor science Then, n(s) +n(m) - n(total student) = =10 ii) exactly one subject Ans : = 30 Question 7 (a) What is power set? Write power set of set A={1,2,5,6,7,9}. Ans (a) {0}, {1}, {2}, {3}, {0,1}, {0,2}, {0,3}, {1,2}, {1,3}, {2,3}, {0,1,2}, {0,1,3},{1,2,3}, {0,2,3}, {0,1,2,3} P = {{}, {0}, {1}, {2}, {3}, {0,1}, {0,2}, {0,3}, {1,2}, {1,3}, {2,3}, {0,1,2}, {0,1,3},{1,2,3}, {0,2,3}, {0,1,2,3}}...{1,2,5,6,7},{2,5,6,7,9}... Like that, the possible Power Set A = 64 (b) Draw truth table for (P Q) n (Q P) and explain whether it is a tautology or not Ans (b) Same as above exampl e.. Q5(c) (c) What is a function? Explain domain and range in context of function, with the help of example Ans (c) Domain The domain of a function is the complete set of possible values of the independent variable. In plain English, this definition means: The domain is the set of all possible x-values which will make the function "work", and will output real y-values. When finding the domain, remember:
19 The denominator (bottom) of a fraction cannot be zero The number under a square root sign must be positive in this section Example 1 Here is the graph of \displaystyle{y}=\sqrt{{{x}+{4}}} y= x+4: (d) State and prove the Pigeonhole principle. Ans (d) Suppose that a flock of 20 pigeons flies into a set of 19 pigeonholes to roost. Because there are 20 pigeons but only 19 pigeonholes, a least one of these 19 pigeonholes must have at least two pigeons in it. To see why this is true, note that if each pigeonhole had at most one pigeon in it, at most 19 pigeons, one per hole, could be accommodated. This illustrates a general principle called the pigeonhole principle, which states that if there are more pigeons than pigeonholes, then there must be at least one pigeonhole with at least two pigeons in it. Theorem: I) If A is the average number of pigeons per hole, where A is not an integer then At least one pigeon hole contains ceil[a] (smallest integer greater than or equal to A) pigeons
20 Remaining pigeon holes contains at most floor[a] (largest integer less than or equal to A) pigeons Or II) We can say as, if n + 1 objects are put into n boxes, then at least one box contains two or more objects. The abstract formulation of the principle: Let X and Y be finite sets and let f: X > Y be a function. If X has more elements than Y, then f is not one-to-one. If X and Y have the same number of elements and f is onto, then f is one-to-one. If X and Y have the same number of elements and f is one-to-one, then f is onto. Pigeonhole principle is one of the simplest but most useful ideas in mathematics. We will see more applications that proof of this theorem. Example 1: If (Kn+1) pigeons are kept in n pigeon holes where K is a positive integer, what is the average no. of pigeons per pigeon hole? Solution: average number of pigeons per hole = (Kn+1)/n = K + 1/n Therefore at least a pigeonholes contains (K+1) pigeons i.e., ceil[k +1/n] and remaining contain at most K i.e., floor[k+1/n] pigeons. i.e., the minimum number of pigeons required to ensure that at least one pigeon hole contains (K+1) pigeons is (Kn+1). Question 8 (a)find inverse of the following functions. Ans (a)
21
22
Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More 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 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 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 informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 26 Why Study Logic?
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More informationCHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic
CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationLogic and Boolean algebra
Computer Mathematics Week 7 Logic and Boolean algebra College of Information Science and Engineering Ritsumeikan University last week coding theory channel coding information theory concept Hamming distance
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
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 NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
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 informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationBefore you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.
Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More informationMATH 22 INFERENCE & QUANTIFICATION. Lecture F: 9/18/2003
MATH 22 Lecture F: 9/18/2003 INFERENCE & QUANTIFICATION Sixty men can do a piece of work sixty times as quickly as one man. One man can dig a post-hole in sixty seconds. Therefore, sixty men can dig a
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 informationTopic 1: Propositional logic
Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements
More informationProblem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
More informationUC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits
2 Wawrzynek, Garcia 2004 c UCB UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits 1 Introduction Original document by J. Wawrzynek (2003-11-15) Revised
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationTools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:
Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise
More informationPropositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.
Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationExecutive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics:
Executive Assessment Math Review Although the following provides a review of some of the mathematical concepts of arithmetic and algebra, it is not intended to be a textbook. You should use this chapter
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationSample 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 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 informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More information1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
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 informationFormal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures
Formal Logic: Quantifiers, Predicates, and Validity CS 130 Discrete Structures Variables and Statements Variables: A variable is a symbol that stands for an individual in a collection or set. For example,
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationPreparing for the CS 173 (A) Fall 2018 Midterm 1
Preparing for the CS 173 (A) Fall 2018 Midterm 1 1 Basic information Midterm 1 is scheduled from 7:15-8:30 PM. We recommend you arrive early so that you can start exactly at 7:15. Exams will be collected
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
More informationCS61c: Representations of Combinational Logic Circuits
CS61c: Representations of Combinational Logic Circuits J. Wawrzynek March 5, 2003 1 Introduction Recall that synchronous systems are composed of two basic types of circuits, combination logic circuits,
More informationAnna University, Chennai, November/December 2012
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2012 Fifth Semester Computer Science and Engineering MA2265 DISCRETE MATHEMATICS (Regulation 2008) Part - A 1. Define Tautology with an example. A Statement
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationCA320 - Computability & Complexity
CA320 - Computability & Complexity David Sinclair Overview In this module we are going to answer 2 important questions: Can all problems be solved by a computer? What problems be efficiently solved by
More informationDefinition 2. Conjunction of p and q
Proposition Propositional Logic CPSC 2070 Discrete Structures Rosen (6 th Ed.) 1.1, 1.2 A proposition is a statement that is either true or false, but not both. Clemson will defeat Georgia in football
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More information(c) Give a proof of or a counterexample to the following statement: (3n 2)= n(3n 1) 2
Question 1 (a) Suppose A is the set of distinct letters in the word elephant, B is the set of distinct letters in the word sycophant, C is the set of distinct letters in the word fantastic, and D is the
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
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 informationPropositional Logic and Semantics
Propositional Logic and Semantics English is naturally ambiguous. For example, consider the following employee (non)recommendations and their ambiguity in the English language: I can assure you that no
More informationCombinatorics. But there are some standard techniques. That s what we ll be studying.
Combinatorics Problem: How to count without counting. How do you figure out how many things there are with a certain property without actually enumerating all of them. Sometimes this requires a lot of
More informationON1 Big Mock Test 4 October 2013 Answers This test counts 4% of assessment for the course. Time allowed: 10 minutes
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
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationBoolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.
Section 3 Boolean Algebra The Building Blocks of Digital Logic Design Section Overview Binary Operations (AND, OR, NOT), Basic laws, Proof by Perfect Induction, De Morgan s Theorem, Canonical and Standard
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
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 informationPart I: Propositional Calculus
Logic Part I: Propositional Calculus Statements Undefined Terms True, T, #t, 1 False, F, #f, 0 Statement, Proposition Statement/Proposition -- Informal Definition Statement = anything that can meaningfully
More informationTutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
More informationECOM Discrete Mathematics
ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional
More informationProof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory
Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More informationCMSC 250 Spring 2016: Final Exam Review Questions Key
CMSC 250 Spring 2016: Final Exam Review Questions Key 1 Description and disclaimer Use these questions to help review for the upcoming final exam. Note, these questions are not necessarily representative
More informationChapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.
Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)
More 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 informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationMATH 114 Fall 2004 Solutions to practice problems for Final Exam
MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from
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 informationCOMP 2600: Formal Methods for Software Engineeing
COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing
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 informationProofs. 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 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 information1.3 Predicates and Quantifiers
1.3 Predicates and Quantifiers INTRODUCTION Statements x>3, x=y+3 and x + y=z are not propositions, if the variables are not specified. In this section we discuss the ways of producing propositions from
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationDiscrete Mathematics Recitation Course 張玟翔
Discrete Mathematics Recitation Course 1 2013.03.07 張玟翔 Acknowledge 鄭安哲 TA 2012 About Myself English Name : Zak Chinese Name : 張玟翔 Mail:o0000032@yahoo.com.tw Lab: ED612 1-1 Propositional Logic 1-1 Ex.2
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationCS Module 1. Ben Harsha Apr 12, 2017
CS 50010 Module 1 Ben Harsha Apr 12, 2017 Course details Course is split into 2 modules Module 1 (this one): Covers basic data structures and algorithms, along with math review. Module 2: Probability,
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationEquivalence of Propositions
Equivalence of Propositions 1. Truth tables: two same columns 2. Sequence of logical equivalences: from one to the other using equivalence laws 1 Equivalence laws Table 6 & 7 in 1.2, some often used: Associative:
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationUnit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics
Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction
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 informationWUCT121. 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 informationPredicate Calculus - Syntax
Predicate Calculus - Syntax Lila Kari University of Waterloo Predicate Calculus - Syntax CS245, Logic and Computation 1 / 26 The language L pred of Predicate Calculus - Syntax L pred, the formal language
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More informationCS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A
CS1800 Discrete Structures Spring 2018 February 2018 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More informationFunctions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:
Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)
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 informationHandout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley AN ALGEBRAIC FIELD
Handout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley Chap. 2 AN ALGEBRAIC FIELD To introduce the notion of an abstract algebraic structure we consider (algebraic) fields. (These should not to
More informationChapter 1. Logic and Proof
Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2 Boolean Algebra and Logic Gates Basic Definitions A binary operator defined on a set S of elements is a rule that assigns, to each pair of elements from S, a unique element from S. The most common
More information