Register

MadeEasy Workbook: Mathematical Logic - Propositional Logic

• edited by
419 views
1 votes
1 votes
<p>what is the negation of:</p> <p>x is prime iff x is not composite.</p> <p>a.x is prime and x is not composite or x is not prime and x is composite.</p> <p>b.x is prime and x is composite or x is not prime and x is not composite.</p>
• edited by
User Avatar

1 Answer

1 votes
1 votes
1) x is prime and x is composite or x is not prime and x is not composite.

2)  x is not prime or x is composite and x is prime or x is not composite.

3) x is not prime or x is not composite and x is prime or x is composite
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Agnel A asked Sep 3, 2017
326 views
MadeEasy Workbook: Mathematical Logic - Propositional Logic
Show that each of the conditional statement is a tautology NOT using a truth table $r\vee (p\vee q)$ is the conclusion from the premises $(p \vee q) \wedge(q\rightarrow r)\wedge (p\rightarrow m) \wedge (m')$
Show that each of the conditional statement is a tautology NOT using a truth table$r\vee (p\vee q)$ is the conclusion from the premises $(p \vee q) \wedge(q\rightarrow r)...
User Avatar
0 votes
0 votes
0 answers
2
Kartik jain 1 asked Jan 8, 2019
343 views
Madeeasy Workbook
Prove that : ∀x(P(x) => Q(x)) ==> ( ∃x(P(x)) => ∃x(Q(x)) ) Why it does not holds?
Prove that :∀x(P(x) = Q(x)) == ( ∃x(P(x)) = ∃x(Q(x)) )Why it does not holds?
User Avatar
Link Copied!