Explanations 
Textbooks 
Flashcards 
91影视 AI 
Notes 
Study Plans 
Study Sets 
Find a degree 
Magazine Problem 61
Determine whether or not each is a tautology. $$[(p \vee q) \wedge(\sim q)] \rightarrow p$$
Problem 62
The Sheffer stroke / is a binary operator" defined by the following truth table.(Note: On page 25 we used the vertical bar \(|\) to mean is a factor of. The actual meaning should be clear from the context. So be careful.) Verify each. (Note: Exercise 58 shows that the logical operators \(|\) and \(\mathrm{NAND}\) are the same. (TABLE CAN'T COPY) $$\sim(p \vee q) \equiv((p | p)|(q | q))|((p | p)|(q | q))$$
Problem 62
Determine whether or not each is a contradiction. $$p \wedge(\sim p)$$
Problem 63
Determine the truth value of each, where \(P(s)\) denotes an arbitrary predicate. $$\left(\exists^{\prime} x\right) P(x) \rightarrow(\exists x) P(x)$$
Problem 63
The Sheffer stroke / is a binary operator" defined by the following truth table.(Note: On page 25 we used the vertical bar \(|\) to mean is a factor of. The actual meaning should be clear from the context. So be careful.) Verify each. (Note: Exercise 58 shows that the logical operators \(|\) and \(\mathrm{NAND}\) are the same. (TABLE CAN'T COPY) Express \(p\) XOR \(q\) in terms of the Sheffer stroke. (Hint: \(p\) XOR \(q \equiv[(p \vee q) \wedge \sim(p \wedge q)] .\) )
Problem 63
Express \(p\) XOR \(q\) in terms of the Sheffer stroke. (Hint: \(\mathrm{XOR} q=[(p \vee q) \wedge \sim(p \wedge q)] .\)
Problem 63
Determine the truth value of each, where \(\mathrm{P}(\mathrm{s})\) denotes an arbitrary predicate. $$(\exists x) P(x) \rightarrow(\exists x) P(x)$$
Problem 64
The Sheffer stroke / is a binary operator" defined by the following truth table.(Note: On page 25 we used the vertical bar \(|\) to mean is a factor of. The actual meaning should be clear from the context. So be careful.) Verify each. (Note: Exercise 58 shows that the logical operators \(|\) and \(\mathrm{NAND}\) are the same. (TABLE CAN'T COPY) Express \(p \leftrightarrow q\) in terms of the Sheffer stroke. (Hint: \(p \leftrightarrow q \equiv\) \((p \rightarrow q) \wedge(q \rightarrow p) .)[\text {Note}: \text { Exercises } 57-64\) indicate that all boolean operators can be expressed in terms of the Sheffer stroke!]
Problem 64
Determine whether or not each is a contradiction. $$\sim(p \vee \sim p)$$
Problem 64
Determine the truth value of each, where \(P(s)\) denotes an arbitrary predicate. $$(\forall x) \mathrm{P}(x) \rightarrow(\exists ! x) \mathrm{P}(x)$$
