Liste des Groupes | Revenir à theory |
On 7/7/2024 10:09 PM, olcott wrote:Who says there needs to be a infinite proof, since there is no such thing.On 7/7/2024 10:02 PM, olcott wrote:There cannot possibly be an infinite proof that proves>>
Formal logic is a subset of this.
Not-a-logic-sentence(PA,g) ≡ (~True(PA,g) ∧ ~True(PA,~g))
There are no truth preserving operations in PA to g or to ~g
>
https://liarparadox.org/Tarski_275_276.pdf
>
Within my analytical framework this Tarski sentence is merely
self-contradictory
>
(3) x ∉ Provable if and only if x ∈ True. // (1) and (2) combined
>
There are no truth preserving operations in Tarski's
theory to x if and only if There are truth preserving
operations in Tarski's theory to x
>
that there is no finite proof of Tarski x in Tarski's theory
The infinite proof of the Goldbach conjectureor, it continue to show that there is no counter examples.
(if it is true) continues to find more true
cases than it had before, thus makes progress
towards its never ending goal (if its true).
The cycles in the following two cases never make any progressWhich just means you are on the wrong path. One wrong path doesn't me that there is no path.
towards any goal they are merely stuck in infinite loops.
The Prolog unify_with_occurs_check test means thatWhich is irrelevent, since Prolog can't handle the basics of the field that Traski assumes.
LP is stuck in an infinite loop that makes no progress
towards resolution. I invented Minimal Type Theory to
see this, then I noticed that Prolog does the same thing.
?- LP = not(true(LP)).So?
LP = not(true(LP)).
?- unify_with_occurs_check(LP, not(true(LP))).
false.
LP := ~(L ⊢ LP)
00 ~ 01
01 ⊢ 01, 00
02 L
The cycle in the direct graph of LP is
an infinite loop that make no progress
towards the goal of evaluating LP as
true or false.
Les messages affichés proviennent d'usenet.