.@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.
Replying to @TheMichaelBurge @TaurineAndCode
If there are infinitely many axioms, the theorems of L' might not be recursively enumerable.
10:45 AM - 28 Jan 2018
0 replies
0 retweets
1 like
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.