Title: Formal Logic - Week 1 - 3

Q: Which of the following examples are statements?
A: 1,2,3,4 are statements. Items number 5 and 6 are not statements, since they are neither “true” nor “false”. Such examples are
out of our scope.

How do we define a formula in propositional logic?

??? ???

How do we define a valuation (or truth assignment) formally?

When does a valuation satisfy a formula? When is a Formula a tautology / unsatisfiable / equivalent to another formula?

Give examples for a tautology and an unsatisfiable formula in propositional logic.

How many possible valuations are there for a formula with n atomic formulas?

What are the following calculation rules?
And why are they true?

What is the Replacemente Theorem? And what does it mean?

What is a literal?
When is a formula in disjunctive normal form (DNF)?
What is a conjunctive clause?
When is a formula in conjunctive normal form (CNF)?
What is a conjunctive clause?

Describe the algorithm, that yields a CNF, given any formula F.
What steps need to be changed, if we want to generate a DNF?

What is the generalized distributivity law?

What is the DNF of F?!
What is the CNF of F?!