p = q
Nothing at all! It depends on the context.
The truth values.
true or false = true
p=q
Any fraction p/q where p is an integer and q is a non-zero integer is rational.
The relational operators: ==, !=, =.p == q; // evaluates true if the value of p and q are equal, false otherwise.p != q; // evaluates true of the value of p and q are not equal, false otherwise.p < q; // evaluates true if the value of p is less than q, false otherwise.p q; // evaluates true if the value of p is greater than q, false otherwise.p >= q; // evaluates true of the value of p is greater than or equal to q, false otherwiseNote that all of these expressions can be expressed logically in terms of the less than operator alone:p == q is the same as NOT (p < q) AND NOT (q < p)p != q is the same as (p < q) OR (q < p)p < q is the same as p < q (obviously)p q is the same as (q < p)p >= q is the same as NOT (p < q)
Not sure I can do a table here but: P True, Q True then P -> Q True P True, Q False then P -> Q False P False, Q True then P -> Q True P False, Q False then P -> Q True It is the same as not(P) OR Q
Nothing at all! It depends on the context.
The truth values.
Ifp < q and q < r, what is the relationship between the values p and r? ________________p
If p is true and q is false, p or q would be true. I had a hard time with this too but truth tables help. When using P V Q aka p or q, all you need is for one of the answers to be true. Since p is true P V Q would also be true:)
Comparative operators are used to compare the logical value of one object with another and thus establish the rank (ordering) of those objects. There are six comparative operators in total: p<q : evaluates true when p is less than q p>q : evaluates true when p is greater than q p<=q : evaluates true when p is less than or equal to q p>=q : evaluates true when p is greater than or equal to q p!=q : evaluates true when p is not equal to q p==q : evaluates true when p is equal to q
Assuming that you mean not (p or q) if and only if P ~(PVQ)--> P so now construct a truth table, (just place it vertical since i cannot place it vertical through here.) P True True False False Q True False True False (PVQ) True True True False ~(PVQ) False False False True ~(PVQ)-->P True True True False if it's ~(P^Q) -->P then it's, P True True False False Q True False True False (P^Q) True False False False ~(P^Q) False True True True ~(P^Q)-->P True True False False
true or false = true
Law of Detachment states if p→q is true and p is true, then q must be true. p→q p therefore, q Ex: If Charlie is a sophomore (p), then he takes Geometry(q). Charlie is a sophomore (p). Conclusion: Charlie takes Geometry(q).
p=q
Think of 'not' as being an inverse. Not 1 = 0. Not 0 = 1. Using boolean algebra we can look at your question. 'and' is a test. It wants to know if BOTH P and Q are the same and if they are 1 (true). If they are not the same, or they are both 0, then the result is false or 0. not P and Q is rewritten like so: (P and Q)' = X not P and not Q is rewritten like: P' and Q' = X (the apostrophe is used for not) We will construct a truth table for each and compare the output. If the output is the same, then you have found your equivalency. Otherwise, they are not equivalent. P and Q are the inputs and X is the output. P Q | X P Q | X ------ 0 0 | 1 0 0 | 1 0 1 | 1 0 1 | 0 1 0 | 1 1 0 | 0 1 1 | 0 1 1 | 0 Since the truth tables are not equal, not P and Q is not equivalent to not P and not Q. Perhaps you meant "Is NOT(P AND Q) equivalent to NOT(P) AND NOT(Q)?" NOT(P AND Q) can be thought of intuitively as "Not both P and Q." Which if you think about, you can see that it would be true if something were P but not Q, Q but not P, and neither P nor Q-- so long as they're not both true at the same time. Now, "NOT(P) AND NOT(Q)" is clearly _only_ true when BOTH P and Q are false. So there are cases where NOT(P AND Q) is true but NOT(P) AND NOT(Q) is false (an example would be True(P) and False(Q)). NOT(P AND Q) does have an equivalence however, according to De Morgan's Law. The NOT can be distributed, but in doing so we have to change the "AND" to an "OR". NOT(P AND Q) is equivalent to NOT(P) OR NOT(Q)