On 10/5/2026 3:19 AM, Mikko wrote:
On 01/10/2026 17:47, olcott wrote:
On 10/1/2026 5:03 AM, Mikko wrote:
On 29/09/2026 19:31, olcott wrote:
On 9/29/2026 11:01 AM, Python wrote:
No, Pete. Calling an undecidable sentence "out-of-scope" does not
make undecidability disappear.
For a formal theory T, "G is undecidable in T" simply means
-a-a-a T |-/- G-a-a-a and-a-a-a T |-/- ~G
That is a statement entirely about proofs. No model theory is
involved.
And G is not "out-of-scope": it is a perfectly well-formed
sentence of the language of T. What is out-of-scope, apparently,
is merely anything for which your proposed semantics fails to
supply an answer.
Within PTS any expression that is neither provable nor refutable
never acquires any semantic meaning.
There is one more thing one needs to consider: there is no complete
method to find out whether a sentence or its negation can be proven.
Consequently, it is not possible to construct a system that rejects
all undecidable sentences.
If back-chained inference from expression X to axioms
has a loop it is rejected.
Irrelevant. Proofs are finite strings and strings don't contain
loops.
Unprovable and irrefutable in PA entails that
G never acquires semantic meaning in PA.
Semantic meaning is only acquired by two types
of relations between finite strings.
(a) Stipulated relations provide the axiomatic basis.
(b) Semantic relations specified syntactically are
-a-a-a the only inference step that is allowed.
The above is the way that
"true on the basis of meaning expressed in language"
has always worked in actual reality.
-a-a ... the diagonal lemma, with B(x) instantiatedThis applies to
...We are therefore confronted with a proposition which
asserts its own unprovability. rCa (G||del 1931:40/43)
No, it does not. The quote is about a sentence and its interpretation,
not about any inference.
-a-a-a It would then be possible to reconstruct the
-a-a-a antinomy of the liar in the metalanguage, by
-a-a-a forming in the language itself a sentence x
-a-a-a such that the sentence of the metalanguage
-a-a-a which is correlated with x asserts that x is
-a-a-a not a true sentence.
-a-a-a https://liarparadox.org/Tarski_247_248.pdf
Maybe, maybe mot. But whther it would be possible does not matter
as it was not done.
-a-a to -4True(x), yields a counterexample to this
-a-a equivalence, by giving a "liar" formula S such
-a-a that S rf| -4True(g(S)) holds in N.
-a-a https://en.wikipedia.org/wiki/Tarski%27s_undefinability_theorem
He implements this as the basis of his whole proof.
Formalized as:
x ree True if and only if p
where the symbol 'p' represents the whole sentence x https://liarparadox.org/Tarski_275_276.pdf
adapted to become this
x ree Pr if and only if p-a // line 1 of the proof
Here is the Tarski Undefinability Theorem proof
(1) x ree Provable if and only if p-a-a-a-a-a-a // assumption (see above)
(2) x ree True if and only if p-a-a-a-a-a-a-a-a-a-a-a-a-a // Tarski's convention T
(3) x ree Provable if and only if x ree True. // (1) and (2) combined
(4) either x ree True or x|a ree True;-a-a-a-a-a // axiom: ~True(x) re? ~True(~x)
(5) if x ree Provable, then x ree True;-a // axiom: Provable(x) raA True(x) (6) if x|a ree Provable, then x|a ree True;-a // axiom: Provable(~x) raA True(~x)
(7) x ree True
(8) x ree Provable
(9) x|a ree Provable
This is the final resolution to the Liar Paradox that
conclusively proves that it never had a truth value.
No final resolution of the Lair Paradox has ever been accepted.
It remains an open problem because the people that understand
the Liar Paradox and Prolog are a mutually exclusive set.
On 10/6/2026 11:35 AM, Ross Finlayson wrote:
Tarski is also a sort of retro-finitist reductionist.
Do you ever have any substantial original thought that
does not conform to some conventional textbook view?
On 10/6/2026 1:14 PM, Blaine wrote:[...]
Ross Finlayson wrote:
Anybody has their own philosophy and psychology.This is the first post I've seen by you that I have understood. Well,
at least until I got to the word, 'monism'.
Speaking with clarity is not his strongest skill.
A heno-theory is any account of a theory that intends to
interpret any other theory, in terms of their "primary elements".
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 55:54:38 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
3 files (2,684K bytes) |
| Messages: | 285,712 |