Checkout
checkout
view
Your Cart Your Cart: item(s)
View Details $1.99 Download Add to Cart

I am stumped

This question has three parts: So I am making it 5 credits for that reason. a. Show that the hypotheses "I left my notes in the library or I finished the rough draft of the paper" and "I did not leave my notes in the library or I revised the bibliography" imply that "I finished the rough draft of the paper or I revised the bibliography". b. Using c for "it is cold" and d for "it is dry", write "It is neither cold nor dry" in symbols. c. Show that the premises "Everyone who read the textbook passed the exam", and "Ed read the textbook" imply the conclusion "Ed passed the exam".

Subject:

Math

Topic:

Discrete Structures

Posting ID:

21899

OTA ID:

103997

View Details $1.99 Download Add to Cart

Relations

S = {0, 1, 2, 4, 6} Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity. Also find the reflexive, symmetric and transitive closure of each relations. A) P = {(0,0), (1,1), (2,2), (4,4), (6,6), (0,1), (1,2), (2,4), (4,6) } B) P {(0,1), (1,0), (2,4), (4,2), (4,6), (6,4)} C) P ((0,0), (1,1), (2,2), 4,4), (6,6), (4,6), (6,4)} D) P = everything not equal to 0

Subject:

Math

Topic:

Discrete Structures

Posting ID:

22606

OTA ID:

103300

View Details $1.99 Download Add to Cart

Relations

Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity A) S = Q X p Y <-> ABS(X) <= ABS(Y) B) S = Z X p Y <-> x -y is an integral multiple of 3 C) S = N X P Y <-> X is odd D) S = Set of all squares in the place S1 p S2 <-> length of side of S1 = length of side S2 E) S = set of finite-length strings of characters X p Y <-> number of characters in x = number of characters in y

Subject:

Math

Topic:

Discrete Structures

Posting ID:

22607

OTA ID:

103300

View Details $1.99 Download Add to Cart

Relations

For each case, think of a set S and a binary relation p on S for - A. p is reflexive and symmetric but not transitive b. p is reflexive and transitive but not symmetric c. p is reflexive but neither symmetric nor transitive

Subject:

Math

Topic:

Discrete Structures

Posting ID:

22608

OTA ID:

101620

View Details $1.99 Download Add to Cart

Functions

Let P be the power set of {A, B} and let S be the set of all binary strings of length 2. A function f: P -> S is defined as follows: For A in P, f(A) has a 1 in the high-order bit position (left end of string) if and only if a is in A. f(A) has a 1 in the low-order bit position (right end of string) if and only if b is in A. Is f one-to-one? Prove or disprove. Is f onto? Prove or disprove.

Subject:

Math

Topic:

Discrete Structures

Posting ID:

22609

OTA ID:

103300

Page generated in 0.1875 seconds

About Us ·  Contact Us ·  Samples ·  Solutions ·  Legal Terms and Conditions ·  Privacy Policy ·  Copyright Notification Policy

©2010 SolutionLibrary.com

Search for Solutions About Us Samples