The validation of a formula can be represented through syntax trees.
- ¬ (A, B∧C)
The reason I am confused is because of the comma. I think the formula is valid.
Let us consider.
A= She eats B= She sleeps C= She drinks
¬ (A, B∧C) <=> She doesn't eat. She doesn't sleep and drink.
- A¬ (B ∧ C)
I think the formula is Wrong. It could have been correct is a comma would have been involved or another biding operator.
A¬ (B ∧ A) <=> She eats She doesn't sleep and eats.
This would not be able to be represented in a Syntax tree