Assignment - Introduction to Discrete Math | MATH 2534, Assignments of Discrete Mathematics

Material Type: Assignment; Class: Intro Discrete Math; Subject: Mathematics; University: Virginia Polytechnic Institute And State University; Term: Fall 2008;

Typology: Assignments

Pre 2010

Uploaded on 10/07/2008

render-3
render-3 🇺🇸

5

(1)

1 document

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Math 2534 Logic Worksheet - Due Monday
Put all work on another sheet of paper and be neat and complete in your work
Problem 1:
Given the following statements convert the following sentences into symbolic logic form:
Part A P: Ed goes camping
Q: Mountain lions are near
R: It is snowing
a) It is snowing and Ed goes camping.
b) It is not true that mountain lions are near but Ed does not go camping.
c) It is a clear day or Ed does not camp.
d) Either it is a clear day or mountain lions are near.
Part B Convert the following symbolic logic into natural conversational English.
a) (R Q) P
b) (P Q)
c) Q (P Q)
d) R (P Q)
∧∨¬
¬∨
∨∧
⊕∧
Problem 2: Using Truth Tables, verify the following: [( ) ] ( )PQ R P Q R
¬
∧∨¬¬¬
Summarize your results with clear English sentences.
Problem 3:
Use DeMogan’s Law to find the negation of the following sentences. Show how you use
the symbolic logic and then restate the results in English.
a) Anna will hike or rock climb
b) Laura will study and pass the test
Problem 4: Put the following into conditional propositional logic form.
a) I will take a nap if you do.
b) You will feel better only if you take a nap.
c) If you do not leave then I can not finish my work.
d) The game is on or it is raining.
e) You must exercise to build endurance.
pf2

Partial preview of the text

Download Assignment - Introduction to Discrete Math | MATH 2534 and more Assignments Discrete Mathematics in PDF only on Docsity!

Math 2534 Logic Worksheet - Due Monday

Put all work on another sheet of paper and be neat and complete in your work

Problem 1: Given the following statements convert the following sentences into symbolic logic form: Part A P: Ed goes camping Q: Mountain lions are near R: It is snowing

a) It is snowing and Ed goes camping. b) It is not true that mountain lions are near but Ed does not go camping. c) It is a clear day or Ed does not camp. d) Either it is a clear day or mountain lions are near.

Part B Convert the following symbolic logic into natural conversational English. a) (R Q) P b) (P Q) c) Q (P Q) d) R (P Q)

Problem 2: Using Truth Tables, verify the following: ¬[( PQ ) ∨ ¬ R ] ≡ ¬( P ∨ ¬ Q ) ∧ R

Summarize your results with clear English sentences.

Problem 3: Use DeMogan’s Law to find the negation of the following sentences. Show how you use the symbolic logic and then restate the results in English.

a) Anna will hike or rock climb b) Laura will study and pass the test

Problem 4: Put the following into conditional propositional logic form.

a) I will take a nap if you do. b) You will feel better only if you take a nap. c) If you do not leave then I can not finish my work. d) The game is on or it is raining. e) You must exercise to build endurance.

Problem 5: The NAND operator is denoted by and is defined by P Q ≡ ¬( PQ )

a) Develop the truth table for this operator b) Prove that P P ≡ ¬ P (do not use truth tables) c) Develop the equivalent NAND representation for PQ

Problem 6: Given the following statements:

P: Sara is a freshman at VA Tech Q: UVA is the best School in Virginia R: VA Tech is number one

Part A: Suppose the statement P is true and Q is false. Express each of the following compound statements in symbolic logic notation and then determine its true value.

  1. Sara is not a freshman at VA Tech but UVA is the best school in Virginia.
  2. Either Sara is a freshman at VA Tech or UVA is not the best school in Virginia.

Part B:

If we assume that the statements P, Q and R have no assigned truth values but it is given that the implication R → ( PQ )is false then (if possible) determine the truth values for

each statement.