This is an old revision of the document!
Interpolation for Propositional Logic
Given two propositional formulas and
, an interpolant is a propositional formula
such that:
1)
2)
3)
denotes the set of free variables in the given propositional formula (see Propositional Logic Syntax).
Note that by transitivity of
. The interpolant extracts what makes
imply
.
Here are two easy ways to create an interpolant.
- We can quantify existentially all variables in
that are not in
. We obtain the weakest interpolant:
where
- We can quantify universally all variables in
that are not in
. We obtain the /strongest interpolant:
where
We can also derive interpolants from resolution proofs, as we will see in lecture07.