Tarski Undefinability Theorem Succinct Refutation

Known unknowns and unknown unknowns!

Moderators: AMod, iMod

Post Reply
PeteOlcott
Posts: 970
Joined: Mon Jul 25, 2016 6:55 pm

Tarski Undefinability Theorem Succinct Refutation

Post by PeteOlcott »

Modal Logic
◊P ↔ ¬□¬P // Possibly(P) ↔ ¬Necessarily(¬P)
□P ↔ ¬◊¬P // Necessarily(P) ↔ ¬Possibly(¬P)
∀P (P ∈ Analytical_Knowledge(P) ↔ □P)

A universal truth predicate that refutes the Tarski Undefinability Theorem can be easily derived simply as membership in the set of Analytical_Knowledge.

∀P (□P ≡ Sound_Deductive_Proof(P) ≡ Theorem(P))
Assumes Haskell Curry definition of axiom (see linked paper).

Copyright 2020 Pete Olcott

https://www.researchgate.net/publicatio ... bout_Godel
Post Reply