• retagged by
27,261 views
79 79 votes

Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable)

  1. $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$
  2. $(∀x)[α] ⇒ (∃x)[α ∧ β]$
  3. $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$
  4. $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$

8 Answers

–3 –3 votes
Option (D) (∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β]) is valid.

So,(D) is ans.
Answer:
Position:
Show:

Related questions

61 61 votes
5 answers 5 answers
14.7k
14.7k views
Kathleen asked Sep 17, 2014
14,731 views
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
178 178 votes
7 answers 7 answers
28.5k
28.5k views
Kathleen asked Sep 16, 2014
28,500 views
Consider the following formula and its two interpretations \(I_1\) and \(I_2\).\(\alpha: (\forall x)\left[P_x \Leftrightarrow (\forall y)\left[Q_{xy} \Leftrightarrow \neg...
86 86 votes
6 answers 6 answers
26.6k
26.6k views
Kathleen asked Sep 17, 2014
26,565 views
The following resolution rule is used in logic programming.Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$Which of the following statements related to thi...
4 4 votes
0 0 answers
1.3k
1.3k views
Syedarshadali asked Jun 29, 2017
1,301 views
Consider the following logic program P A(x) <- B(x, y), C(y) <- B(x,x) Which of the following first order sentences is equivalent to P?Can anyone explain how it can be s...