Scribd
Upload
10 views2 pages

logic relation assement

The document is an assignment for a computational methods course, requiring a group of 5 students to answer various logical and mathematical questions. It includes tasks such as determining logical equivalences, establishing tautologies and contradictions using truth tables, and analyzing relations for properties like reflexivity and symmetry. The assignment also involves verifying logical equivalences and evaluating argument validity.

Uploaded by

kirimantalib01
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views2 pages

logic relation assement

The document is an assignment for a computational methods course, requiring a group of 5 students to answer various logical and mathematical questions. It includes tasks such as determining logical equivalences, establishing tautologies and contradictions using truth tables, and analyzing relations for properties like reflexivity and symmetry. The assignment also involves verifying logical equivalences and evaluating argument validity.

Uploaded by

kirimantalib01
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MA 1102: COMPUTATIONAL METHODS

ASSIGNMENT-1 (GROUP OF 5 STUDENTS)


DEADLINE: 5/11/2022- 08:00 AM
ANSWER ALL QUESTIONS
1. Determine whether the following statement forms are logically equivalent.
a) p  ( p  q ) and p
b) ( p  q )  r and p  ( q  r )
c) ( p  q )  ( p  r ) and ( p  q )  r
2. Use truth tables to establish which of the following statement forms are tautologies and
which are contradictions.
a) ( p  q )  ( p  ( p  q ) ) .
b) (( p  q )  ( q  r ))  q.
3. Use the logical equivalences laws to verify the following logical equivalences. Supply a
reason for each step.
a) ( p ( ( )
p  q ))  ( p  q )  p .
b) (( p  q )  ( p q ))  ( p  q )  p .
4. Use the truth table to determine whether the following argument forms are valid. Indicate
which columns represent the premises and which represent the conclusion, and include a
sentence explaining how the truth table supports your answer. Your explanation should
show that you understand what it means for a form of argument to be valid or invalid.
p→q
a) q→ p
pq

pq
p→ q
b)
p→r
r

pq → r
p q
c)
q→ p
 r

5. Let E = 1, 2,3 and F = −2, −1, 0 , and define a relation T from E to F as follows.

1|Page
x− y
For all ( x, y ) E  F , ( x, y ) T means that is an integer.
3
a) Write T as a set of ordered pairs.
b) Write the domain and range of T .
6. Determine whether the following relations are reflexive, symmetry and transitive. Give a
counter example in each case in which the relation does not satisfy one of the properties.
a) R1 = ( 0, 0 ) , ( 0,1) , ( 0,3) , (1,1) , (1, 0 ) , ( 2,3) , ( 3,3)
b) R2 = ( 0, 0 ) , ( 0,1) , (1,1) , (1, 2 ) , ( 2, 2 ) , ( 2,3) .
c) R3 = (1, 2 ) , ( 2,1) , (1,3) , ( 3,1) .
7. Determine whether the following relation is equivalence relation on set A.
A = 0,1, 2,3, 4
a)
R = ( 0, 0 ) , ( 0, 4 ) , (1,1) , (1,3) , ( 2, 2 ) , (3,1) , (3,3) , ( 4, 0 ) , ( 4, 4 )
A = a, b, c, d 
b)
R = ( a, a ) , ( b, b ) , ( b, d ) , ( c, c ) , ( d , b ) , ( d , d )

2|Page

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy