Predicate logic formulas without quantifiers can be verified using derivation. But when it comes to first order logic (predicate logic with quantifiers), the simplest way is to apply logical reasoning. Most of these questions asked will be for very small formulas and we can easily apply logical reasoning to check if they are valid. The method is to convert the logical formula into its corresponding English meaning. This is shown in the following examples:
(1) <math>\forall (x) P(x) \vee \forall(x)Q(x) \implies \forall (x) (P(x) \vee Q(x))</math> (2) <math>\exists (x) P(x) \wedge \forall(x)Q(x) \implies \exists (x) (P(x) \wedge Q(x))</math>
(3) <math>\exists (x) (P(x) \vee Q(x)) \implies \forall (x) P(x) \vee \forall (x) Q(x)</math>
(4) <math>\exists (x) (P(x) \vee Q(x)) \implies \sim \forall (x) </math>
(1) The corresponding English meaning: If P(x) is true for all x, or if Q(x) is true for all x, then for all x, either P(x) is true or Q(x) is true. This is always true and hence valid. To understand deeply, consider X = {3,6,9,12}. For LHS of the formula to be true, either P(x) must be true for all elemnts or Q(x) must be true for all elements. In either case, if we take each element x in X, either one of P(x) or Q(x) will be true.
(2)
Predicate logic formulas without quantifiers can be verified using derivation. But when it comes to first order logic (predicate logic with quantifiers), the simplest way is to apply logical reasoning. Most of these questions asked will be for very small formulas and we can easily apply logical reasoning to check if they are valid. The method is to convert the logical formula into its corresponding English meaning. This is shown in the following examples:
(1) <math>\forall (x) P(x) \vee \forall(x)Q(x) \implies \forall (x) (P(x) \vee Q(x))</math> (2) <math>\exists (x) P(x) \wedge \forall(x)Q(x) \implies \exists (x) (P(x) \wedge Q(x))</math>
(3) <math>\exists (x) (P(x) \vee Q(x)) \implies \forall (x) P(x) \vee \forall (x) Q(x)</math>
(4) <math>\exists (x) (P(x) \vee Q(x)) \implies \sim \forall (x) </math>
(1) The corresponding English meaning: If P(x) is true for all x, or if Q(x) is true for all x, then for all x, either P(x) is true or Q(x) is true. This is always true and hence valid. To understand deeply, consider X = {3,6,9,12}. For LHS of the formula to be true, either P(x) must be true for all elemnts or Q(x) must be true for all elements. In either case, if we take each element x in X, either one of P(x) or Q(x) will be true.
(2)
GATECSE