Prove that $\vdash p \lor \lnot p$ is true using natural deduction

11.4k Views Asked by At

I'm trying to prove that $p \lor \lnot p$ is true using natural deduction. I want to do this without using any premises.

As it's done in a second using a truth table and because it is so intuitive, I would think that this proof shouldn't be too difficult, but I not able to construct one.

3

There are 3 best solutions below

5
On BEST ANSWER

I would like not to use de morgan law, as you would need to include that as a premise. I was thinking of this proof.

    • $\lnot (p \lor \lnot p) \quad \quad \quad (H)$
      • $p \quad \quad \quad \quad \quad (H)$
      • $p \lor \lnot p \quad \quad \; \;(\lor \text{I} 2)$
      • $ \bot \quad \quad \quad \quad \;\;(\lnot \text{E}1,3)$
    • $\lnot p \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\; \; (\lnot \text{I}2 - 4)$
    • $p \lor \lnot p \;\;\;\;\;\;\;\;\; \;\;\;\;\;\,(\lor \text{I}5)$
    • $\bot \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\,(\lnot \text{E}1,6)$
  1. $p \lor \lnot p \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\,\;\;\;(\bot \text{E}1-7)$
0
On

First assume any thesis $\alpha$ as an assumption. Then show that the thesis can have the same scope as ApNp. Then infer C$\alpha$ApNp. Then prove $\alpha$ and use conditional-out. I use Polish notation, and I can give you formation rules if you like:

    • Cpp assumption
      • NApNp assumption
        • p assumption
        • ApNp 3 A-in
        • ⊥ 3, 4. K-in
      • Np 3-5 N-in
      • ApNp 6 A-in
      • ⊥ 2, 7 K-in
    • ApNp 2-8 N-out
  1. CCppApNp 1-9 C-in
    • p assumption
  2. Cpp 11-11 C-in
  3. ApNp 10, 12 C-out

Note that we did not prove |-ApNp at any point (though we did prove Cpp|-ApNp).

0
On

If you have the definition Cpq := ANpq and you have that A-commutes, and Cpp, then you can do this really quickly. Since we have Cpp, by the definition we have ANpp. By A-commutation we then have ApNp.

More formally, I'll first point out that natural deduction allows for definitions as well as uniform substitution on theses. So, again, here's our definition

Cpq := ANpq. (or C := AN for short)

First one of the lemmas:

    • p hypothesis
  1. Cpp 1-1 C-in

Now for another of the lemmas:

    • Apq hypothesis
      • p hypothesis
      • Aqp 2 A-in
    • CpAqp 2-3 C-in
      • q hypothesis
      • Aqp 5 A-in
    • CqAqp 5-6 A-in
    • Aqp 1, 4, 7 A-out
  1. CApqAqp

Now we have the following sequence of theses:

1 Cpp by the above

2 CApqAqp by the above

3 ANpp definition applied to thesis 1

4 CANppApNp 2 p/Np, q/p (meaning in thesis 2 we substitue p with Np and q with p)

5 ApNp 3, 4 C-out