Determine if the logical equivalent is valid for all predicates P and Q.

In summary, the techniques used in solving the sub-problems 8a, 8c, and 8d are based on the outermost operator. If it is ∀ (as in d, LHS), then it is usually easier to proceed by reductio ad absurdum, i.e. suppose it is false. However, if it is ∃ (as in a, LHS), then assuming it is true allows you to proceed that way. If it is ∨ (a, RHS and d, RHS), then you can break it into two cases. If it is ∧ then you can follow both paths at once.
  • #1
s3a
818
8

Homework Statement



There are four (sub)problems in the attached PDF file, but I don’t see the common pattern that the solutions to these kinds of problems have; see “3. The Attempt at a Solution ”.

Homework Equations


Logical equivalence

The Attempt at a Solution


I am trying to find the common pattern that the solutions to these kinds of problems have, and for example, for 8a, the solutions PDF is showing that (i) if the LHS is true, then the RHS is true as well as (ii) if the RHS is true, then the LHS is also true, whereas, for 8d, the solutions PDF is showing that (i) if the RHS is true, then the LHS is true and (ii) if the RHS is false, then the LHS is also false.

Basically, why aren’t both 8a and 8d showing that (i) if the LHS is true, then the RHS is true as well as (ii) if the RHS is true, then the LHS is also true (the "technique", for the lack of a better word, used in 8a), or alternatively, that (i) if the RHS is true, then the LHS is true and (ii) if the RHS is false, then the LHS is also false. (=the technique used in 8d)?

What’s the logic behind the using of different techniques?

I feel like I can follow the solutions for 8a,8c and 8d, but I cannot replicate them (without memorizing), because I don’t understand the common pattern they share, so any help in fully understanding these problems would be GREATLY appreciated!

P.S.
The (sub)problem 8b seems to make sense to me, but it seems to not share the type of techniques used for 8a, 8c and 8d (probably since it’s just about finding values to disprove the stated logical equivalence, which is different from showing that a stated logical equivalence always holds true).

P.P.S.
If anything I typed is unclear, please let me know.
 

Attachments

  • 8.pdf
    75.9 KB · Views: 309
Physics news on Phys.org
  • #2
s3a said:

Homework Statement



There are four (sub)problems in the attached PDF file, but I don’t see the common pattern that the solutions to these kinds of problems have; see “3. The Attempt at a Solution ”.

Homework Equations


Logical equivalence

The Attempt at a Solution


I am trying to find the common pattern that the solutions to these kinds of problems have, and for example, for 8a, the solutions PDF is showing that (i) if the LHS is true, then the RHS is true as well as (ii) if the RHS is true, then the LHS is also true, whereas, for 8d, the solutions PDF is showing that (i) if the RHS is true, then the LHS is true and (ii) if the RHS is false, then the LHS is also false.

Basically, why aren’t both 8a and 8d showing that (i) if the LHS is true, then the RHS is true as well as (ii) if the RHS is true, then the LHS is also true (the "technique", for the lack of a better word, used in 8a), or alternatively, that (i) if the RHS is true, then the LHS is true and (ii) if the RHS is false, then the LHS is also false. (=the technique used in 8d)?

What’s the logic behind the using of different techniques?

I feel like I can follow the solutions for 8a,8c and 8d, but I cannot replicate them (without memorizing), because I don’t understand the common pattern they share, so any help in fully understanding these problems would be GREATLY appreciated!

P.S.
The (sub)problem 8b seems to make sense to me, but it seems to not share the type of techniques used for 8a, 8c and 8d (probably since it’s just about finding values to disprove the stated logical equivalence, which is different from showing that a stated logical equivalence always holds true).

P.P.S.
If anything I typed is unclear, please let me know.
It tends to be driven by the outermost operator.
If it is ∀ (as in d, LHS) then it is usually easier to proceed by reductio ad absurdum, i.e. suppose it is false. That allows you to say "so ∃ ...".
Conversely, if it is ∃ (as in a, LHS), assuming it is true allows you to proceed that way.
If it is ∨ (a, RHS and d, RHS) then you can break it into two cases.
If it is ∧ then you can follow both paths at once.
 
  • #3
Thanks for your input, and sorry for my very-late reply!

Okay, so for parts c and d, we want to show that (i) RHS being true implies that LHS is true and (ii) the LHS being true implies that RHS is true, but we show (ii) by showing its contrapositive, right?

Assuming I'm correct (so please confirm), what I just said above clarifies my confusion a lot (in addition to what you typed in your reply).
 

FAQ: Determine if the logical equivalent is valid for all predicates P and Q.

What does it mean for a logical statement to be valid for all predicates P and Q?

For a logical statement to be valid for all predicates P and Q, it means that the statement holds true for every possible combination of values for the variables P and Q. In other words, the statement must be true regardless of the specific values assigned to P and Q.

How do you determine if a logical statement is valid for all predicates P and Q?

To determine if a logical statement is valid for all predicates P and Q, you can use a truth table or a logical equivalency proof. A truth table lists all possible combinations of truth values for the variables in the statement and checks if the statement holds true for each combination. A logical equivalency proof uses logical rules and principles to show that the statement is equivalent to a tautology, meaning it is always true.

Can a logical statement be valid for some predicates but not for others?

Yes, a logical statement can be valid for some predicates but not for others. This means that the statement may hold true for certain values of the variables, but not for all possible combinations of values. In order for a statement to be considered valid for all predicates, it must hold true for every possible combination of values for the variables.

What are some common mistakes when determining the validity of a logical statement for all predicates P and Q?

Some common mistakes when determining the validity of a logical statement for all predicates P and Q include not considering all possible combinations of values for the variables, using incorrect logical rules or principles, and assuming that a statement is valid without proper proof. It is important to carefully analyze the statement and use valid logical reasoning to determine its validity for all predicates P and Q.

Can a valid logical statement for all predicates P and Q be rewritten in a different form?

Yes, a valid logical statement for all predicates P and Q can be rewritten in a different form using logical equivalencies. As long as the new form is logically equivalent to the original statement, it will still be valid for all predicates P and Q. However, it is important to ensure that the logical equivalency is valid and properly proven in order to maintain the statement's validity for all predicates.

Back
Top