{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

11-07-homework-5

# 11-07-homework-5 - the transitive closure of R 4 Suppose...

This preview shows page 1. Sign up to view the full content.

Sets and Logic — Fall 2011 due Monday, 10/14/11 Homework #5 1 Suppose that R and S are partial orders on A . Is it true that R S is a partial order? Give a proof or counterexample. 2 Suppose that R and S are partial orders on A . Is it true that R S is a partial order? Give a proof or counterexample. 3 Let P be the set of all people who have ever lived, and define R = { ( p,q ) P × P | p is a parent of q } . Describe in words, not symbols
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , the transitive closure of R . 4 Suppose that R is a relation on A , and let S denote the transitive closure of R . Prove that if R is symmetric, then so is S . 5 Let A be a set and B a subset of A . DeFne the relation R on P ( A ) by R = { ( X,Y ) ∈ P ( A ) × P ( A ) | ( X Δ Y ) ⊆ B } . Prove that R is an equivalence relation....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online