Consider the following formula where the outermost logical connective is "negation":
¬∀x : ((∃y : q(y, x)) → (p(x) ∨ ∃y : (p( y ) ∧ q(x, y)))) Which of the following formulas (where only atomic formulas are negated) is logically equivalent to this formula?

Question

Consider the following formula where the outermost logical connective is "negation": 
 ¬∀x : ((∃y : q(y, x)) → (p(x) ∨ ∃y : (p( y ) ∧ q(x, y)))) Which of the following formulas (where only atomic formulas are negated) is logically equivalent to this formula?

Accepted Answer

None

Answer

∃x : ((∃y : q(y, x)) ∨ (¬p(x) ∨ ∀y : (¬p( y ) ∧ ¬q(x, y))))

Answer

∃x : ((∃y : q(y, x)) ∧ (¬p(x) ∧ ∃y : (¬p( y ) ∨ ¬q(x, y))))

Answer

∃x : ((∀y : q(y, x)) ∧ (¬p(x) ∧ ∃y : (¬p( y ) ∨ ¬q(x, y))))

Answer

∃x : ((∃y : ¬q(y, x)) ∧ (p(x) ∧ ∀y : (p( y ) ∨ q(x, y))))

Answer

∃x : ((∀y : ¬q(y, x)) ∧ (¬p(x) ∧ ∀y : (¬p( y ) ∨ ¬q(x, y))))

Crowdly

Consider the following formula where the outermost logical connective is "negati...

Want instant access to all verified answers on moodle.jku.at?