Question about provability logic
Posted: Fri Apr 29, 2022 5:08 pm
Let □ be the operator "it is provable in ZFC".
Let 'P' mean that the Continuum Hypothesis is the case.
Take the following Natural Deduction argument in GL provability logic:
1.□(~□P→(□P→P) Theorem Intro. (Prop. Logic)
2.□(~□~P→(□~P→~P)) Theorem Intro. (Prop. Logic)
3.□~□P→□(□P→P) 1, Distribution
4.□~□~P→□(□~P→~P) 2, Distribution
5.□(□P→P)→□P Löb's Rule
6.□(□~P→~P)→□~P Löb's Rule
7.□~□P ∧ □~□~P Theorem Intro. (Independence of the Continuum Hypothesis from ZFC)
8.(□~□P ∧ □~□~P)→(□P ∧ □~P) Theorem Intro. (Prop. Logic)
9.□(P ∧ ~P) 7,8 Modus Ponens; Theorem Intro. (System K)
Is this kind of result already known? What does it mean? Is it just equivalent to Gödel's Theorems? Any feedback would be appreciated!
Let 'P' mean that the Continuum Hypothesis is the case.
Take the following Natural Deduction argument in GL provability logic:
1.□(~□P→(□P→P) Theorem Intro. (Prop. Logic)
2.□(~□~P→(□~P→~P)) Theorem Intro. (Prop. Logic)
3.□~□P→□(□P→P) 1, Distribution
4.□~□~P→□(□~P→~P) 2, Distribution
5.□(□P→P)→□P Löb's Rule
6.□(□~P→~P)→□~P Löb's Rule
7.□~□P ∧ □~□~P Theorem Intro. (Independence of the Continuum Hypothesis from ZFC)
8.(□~□P ∧ □~□~P)→(□P ∧ □~P) Theorem Intro. (Prop. Logic)
9.□(P ∧ ~P) 7,8 Modus Ponens; Theorem Intro. (System K)
Is this kind of result already known? What does it mean? Is it just equivalent to Gödel's Theorems? Any feedback would be appreciated!