.@ModelOfTheory
A logic L' similar to a standard logic L, except that the only deduction chains allowed are those with length at least 10 and which cannot be shortened in L.
For your proof to be accepted, you must also prove that it is both novel and the shortest proof.
-
-
So axioms are false. Wait, what?
1 reply 0 retweets 0 likes
Replying to @noop_noob @TaurineAndCode
No, axioms are unprovable, but also undisprovable unless L is inconsistent, with the shortest proof of a contradiction having length at least 10.
10:45 AM - 28 Jan 2018
0 replies
0 retweets
2 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.