Respuesta :
Answer:
The answer is "[tex]\bold{((P_2 \wedge P_3)\longrightarrow P_1 \longrightarrow P_1 }[/tex]".
Step-by-step explanation:
Let assuming the following predicates:
[tex]\to B(x,y)= \text{x barks at y} \\\\\to D (x)= \text{x is a dog} \\\\\to C (x)= \text{x is a cat} \\\\[/tex]
In the given table it calculates the numbered sequence, which is given in the statement and calculates the other details, please find the attached file.
Premise P1 means whether dogs are shouting at cats.
Premise P2 means Maximum is a dog.
Premise P3 means that a cat is Moonbeam.
Unless the assumptions P1, P2, and P3 all are valid, otherwise the conclusion that Maximum starts barking at Moonbeam also is correct.
By both the law of deduction of Modus Ponens, statement 4 is the interpretation of states 1, 2, and 3. That conclusion can thus be conveyed as follows:
so, the final answer is "[tex]\bold{((P_2 \wedge P_3)\longrightarrow P_1 \longrightarrow P_1 }[/tex]"