Content
Propositional Logic

Week 1

Implications

There is a multitude of meanings when it comes to the use of the word "implication". There is a good detailed explanation in the script. To provide an overview consider the following:

Implications between Mathematical statements

🚧

we will add some more stuff from the first week here

The arrow "    \implies" can be used between mathematical statements to form a new mathematical statement. For example, let SS and TT be mathematical statements. Then we can form the mathematical statement S    TS \implies T. The new statement can be translated into natural language by saying that "that if SS is true, then TT is also true" (which is a statement that can be false). It does not mean that because SS is true, TT is also true.

For example, consider the following statements:

  • SS: "22 is an even number"
  • TT: "5+10=155 + 10 = 15"

In this case, S    TS \implies T is true. This may seem counterintuitive, but it is a true mathematical statement. The statement S    TS \implies T does not mean that there is a derivation from SS to TT.

Additionally, it can be quite counterintuitive to consider the statement S    TS \implies T when you know that the statement SS is actually false. This automatically makes S    TS \implies T true because we essentially don't care about the truth value of the statement TT. Since SS is false, the implication "if SS is true, then TT is also true" is vacuously true because SS is not true — we don't need to check whether TT is true.

For example, consider the following statements:

  • SS: "22 is an odd number"
  • TT: "33 is an even number"

If we now consider S    TS \implies T, we would find that S    TS \implies T is indeed a true statement because we know SS is false.

Note that the only case where the statement S    TS \implies T is false is when SS is a true statement and TT is a false statement.

Derivation step arrow

    \overset{\cdot}{\implies}

Implication as formula operator

\to

Logical consequence

\vDash

EBNF: Statements vs Formulas

This tries to define formulas and statements with EBNF. Bold symbols are used to denote EBNF syntax elements ( ) [ ] . References to existing rules are made using Rulename… element.

RuleExpression
PropSymbolAA BB CC ••• ZZ
SymbolPropSymbol \top \bot
LogicOp\land \lor \leftrightarrow \to
Negation¬\lnot
Combination(Formula ((Combination))) LogicOp (Formula ((Combination)))
Formula[Negation]Symbol Combination Negation((Combination))
FormulaStatementFormula ( \equiv \models ) Formula \models Formula
StatementOp    \implies     \iff  and \text{ and }  or \text{ or }
PropositionFormulaStatement Statement PropSymbol Mathematical statement
StatementFormulaStatement Proposition (StatementOp Proposition is false\text{is false})

You can try it out in the EBNF Lab (opens in a new tab).

Exercises

Problem 1Source:  Tobias Steinbrecher

Define logical binary operator \circ as follows:

AABBABA \circ B
000011
001111
110011
111100

For each of the following formulas, write an equivalent formula using only the \circ operator. Prove the equivalence in each case.

  1. ¬A\lnot A
  2. ABA \land B
  3. ABA \lor B
Equivalence TransformationsSource:  Philipp Barski

Consider the formula F=(BA)¬CF = (B \lor A) \lor \neg C. Find a formula GG such that GG only contains the logical operation \to and propositional symbols A,B,CA,B,C (Note that parentheses are allowed as well).
Solve this problem either by using equivalence transformations from Lemma 2.1 and the rules

F¬F, F, FF, F¬F, FF, FF \land \neg F \equiv \bot, \ F \land \bot \equiv \bot, \ F \lor \bot \equiv F,\ F \lor \neg F \equiv \top, \ F \land \top \equiv F, \ F \lor \top \equiv \top

or drawing the truth table and trying to find a formula fulfilling the upper constraints.