I need to give formal proofs with first-order logic and translate English to FOL.

Anonymous
timer Asked: Dec 13th, 2018

Question description

In each of the following, I need to assess whether the argument is valid. If it is, I need to give a formal proof with first-order logic. You may not use AnaCon nor TautCon. You must also simplify Modus Tollens and Modus Ponens, if necessary.

  1. ¬∀x (Cube(x) ∧ Small(x)) from the premise ¬∀x (Cube(x).
  2. ∃x ¬Cube(x) from the premises ∀x((Cube(x) ∧ Large(x)) → FrontOf(x,a)) and ∃x(Large(x) ∧ ¬FrontOf(x,a))
  3. ∀x∃y Smaller(x, y) from the premise ∃y∀x Smaller (x, y)

Second, I need to translate the sentences from English to first-order logic (Translation 1 file), and from first-order logic to English (Translation 2 file).

Studypool has helped 1,244,100 students
flag Report DMCA
Similar Questions
Hot Questions
Related Tags

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors