Simply defining Gödel Incompleteness away V8
Posted: Sun Jun 21, 2020 10:15 pm
My correction to classical logic:
A valid argument requires that the truth of the conclusion logically
follows from the truth of all of the premises.
If the truth of the conclusion is the same as the truth of the premises
joined together by "and" then the argument is valid otherwise the
argument is invalid.
Mendelson 1997 Introduction to Mathematical Logic page 35: Γ ⊢ 𝒞
Γ = the premises of the proof
𝒞 = the consequence of Γ
The first two axioms are defined by classical logic.
The last two axioms are my correction to classical logic.
(1) (All-True(Γ) ∧ False(𝒞)) ↔ ¬Valid-Argument(Γ, 𝒞)
(2) (All-True(Γ) ∧ True(𝒞)) ↔ Sound-Argument(Γ, 𝒞)
(3) (¬All-True(Γ) ∧ True(𝒞)) ↔ ¬Valid-Argument(Γ, 𝒞)
(4) (¬All-True(Γ) ∧ False(𝒞)) ↔ Valid-Argument(Γ, 𝒞)
This gets rid of the principle-of-explosion.
Only the conclusion of a sound argument counts as true making true and
unprovable impossible refuting Gödel's 1931 Incompleteness Theorem.
Copyright 2020 Pete Olcott
A valid argument requires that the truth of the conclusion logically
follows from the truth of all of the premises.
If the truth of the conclusion is the same as the truth of the premises
joined together by "and" then the argument is valid otherwise the
argument is invalid.
Mendelson 1997 Introduction to Mathematical Logic page 35: Γ ⊢ 𝒞
Γ = the premises of the proof
𝒞 = the consequence of Γ
The first two axioms are defined by classical logic.
The last two axioms are my correction to classical logic.
(1) (All-True(Γ) ∧ False(𝒞)) ↔ ¬Valid-Argument(Γ, 𝒞)
(2) (All-True(Γ) ∧ True(𝒞)) ↔ Sound-Argument(Γ, 𝒞)
(3) (¬All-True(Γ) ∧ True(𝒞)) ↔ ¬Valid-Argument(Γ, 𝒞)
(4) (¬All-True(Γ) ∧ False(𝒞)) ↔ Valid-Argument(Γ, 𝒞)
This gets rid of the principle-of-explosion.
Only the conclusion of a sound argument counts as true making true and
unprovable impossible refuting Gödel's 1931 Incompleteness Theorem.
Copyright 2020 Pete Olcott