recategorized by
1,848 views

3 Answers

Best answer
22 votes
22 votes

Valid: A wff which is always true (tautology) is valid. i.e., its value is true for any set of assignment to its variables.

Satisfiable: A wff which is not a contradiction (always false) is satisfiable. It may be a tautology.

edited by
3 votes
3 votes

A well formed formula is valid means –

  1. The conclusion is inferred from the premises.
  2. The propositional expression is tautological implication.
  3. The argument (an argument is sequence of propositional expressions followed by conclusion) proposed is valid.

Now let us consider the example and show if the argument is valid.

If it is raining Mr. Will will take an umbrella.

It is raining.


Here p: It is raining, q: He will take an umbrella.

$((p \rightarrow q) \wedge (p)) \rightarrow p$

The above written expression is tautological implication. Hence we can say that the argument is valid.

0 votes
0 votes
Valid = Always True.

Consistent/ Satisfiable = We can make the wff true (meaning there can be False results too)

Related questions

1 votes
1 votes
1 answer
1
1 votes
1 votes
1 answer
2
go_editor asked Dec 20, 2016
646 views
Consider the following well-formed formula:$\exists x \forall y [ \neg \: \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(x,y)]$Express the above well-formed formula in c...