logo

Crowdly

Browser

Add to Chrome

338.002/4/5/8/22/23/24/25/28/29, UE Logic, Wolfgang Windsteiger et al., 2025W

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!

Which of the following formulas can be shown to be satisfiable/unsatisfiable by just applying BCP (and nothing else)?

0%
0%
0%
0%
0%
View this question

Given the following formula:

¬(¬a \to (b ∧ c)) ∧ (a

\leftrightarrow b)

How many clauses do we obtain when we transform the formula into a semantically equivalent CNF (approach 1 of the lecture)?

View this question

Given the following syntax tree of a propositional formula. This tree is annotated with labels to be used in the transformation to CNF.

formula tree

Which clauses occur in the CNF when using approach 2 as presented in the lecture to translate the formula to CNF?

0%
0%
0%
0%
0%
0%
0%
View this question
Specify the following problem (you may use any text representation for logical/mathematical symbols):

Given two finite integer sequences a and b that have at least one element in common (possibly at different positions), compute the sequence c that results from appending a and b.

For example, for legal inputs a=[1,2,1] and b=[3,1], output c=[1,2,1,3,1] is legal.

View this question
View this question

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"?

0%
0%
0%
0%
0%
View this 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?

View this question
View this question

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?

0%
100%
0%
0%
0%
0%
0%
0%
0%
0%
View this question
View this question

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

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Browser

Add to Chrome