Use Proof by Structural Induction

Structure

We want to show that set is complete

  1. Define set that uoc or
  2. Use Proof by Structural Induction to prove that for every forumla s.t uoc

Example

Prove that Zero Identity and implication forma complete set.

Step 1

Define set of formulas that uoc

  • Let be the smallest set such that:
    • Basis: is a propositional variable, then
    • Induction step: If , then

Step 2

Now we prove that for all formula , formula s.t uoc and

Basis

Let where is a propositional variable Then uoc (F’ uses no connectives at all) And () As wanted

Induction Step

Suppose that are formulas and s.t uoc and and (IH) Then, there are two cases:

  • Case 1:
  • For , let
    • Then, uoc by IH as uoc
    • and, by IH as
    • as is always falsified so is satisfied when is false
    • ’ Case 2:
  • For let
  • Then, uoc
  • and
  • As wanted

Step 3

Since is complete, therefore is also complete