Looking for 338.002/4/5/8/22/23/24/25/28/29, UE Logic, Wolfgang Windsteiger et al., 2025W test answers and solutions? Browse our comprehensive collection of verified answers for 338.002/4/5/8/22/23/24/25/28/29, UE Logic, Wolfgang Windsteiger et al., 2025W at moodle.jku.at.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Given the following formula:
¬(¬a (b ∧ c)) ∧ (a
b)
Given the following syntax tree of a propositional formula. This tree is annotated with labels to be used in the transformation to CNF.
Which clauses occur in the CNF when using approach 2 as presented in the lecture to translate the formula to CNF?
Consider the following two formulas interpreted over the domain {1,2}:
∃x: ∀y: p(x,y)
∀y: ∃x: p(x,y)
For which definition of p is the first formula "true" and the second formula "false"?
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?
Take the following statement in natural language:
Every hinny is the offspring of a male horse and of a female donkey.
(Jeder Maulesel ist der Nachkomme eines männlichen Pferdes und eines weiblichen Esels.)
Which of the following formulas in first-order logic formalizes this statement correctly?