Re: The philosophy of logic reformulates existing ideas on a new basis ---

Liste des GroupesRevenir à c theory 
Sujet : Re: The philosophy of logic reformulates existing ideas on a new basis ---
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theory
Date : 08. Nov 2024, 20:14:35
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <2bdfeba9ce48ef508e2b7f7f4c94ab7921e91763@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Fri, 08 Nov 2024 09:15:29 -0600 schrieb olcott:
On 11/8/2024 9:05 AM, Alan Mackenzie wrote:
olcott <polcott333@gmail.com> wrote:
On 11/8/2024 5:58 AM, Alan Mackenzie wrote:
In comp.theory olcott <polcott333@gmail.com> wrote:
On 11/6/2024 2:34 PM, Alan Mackenzie wrote:
In comp.theory olcott <polcott333@gmail.com> wrote:
On 11/6/2024 10:45 AM, Alan Mackenzie wrote:

As I have continually made clear in my posts "like 2 + 2 = 4" includes
the halting theorem, Gödel's theorem, and Tarski's theorem.
Your misconceptions are not my errors.
You cannot possibly prove that they are infallible that best that you
can show is that you believe they are infallible.
They are proven. Show the error.

When the operations are limited to applying truth preserving
operations to expressions of language that are stipulated to be true
then True(L,x) ≡ (L ⊢ x) and False(L, x) ≡ (L ⊢ ~x)
Then (Incomplete(L) ≡  ∃x ∈ Language(L) ((L ⊬ x) ∧ (L ⊬ ¬x))) becomes
(¬TruthBearer(L,x) ≡  ∃x ∈ Language(L) ((L ⊬ x) ∧ (L ⊬ ¬x)))
Incompleteness utterly ceases to exist
Incompleteness is an essential property of logic systems
What I said about is a semantic tautology just like 2 + 3 = 5. Formal
systems are only incomplete when the term "incomplete" is a dysphemism
for the inability of formal systems to correctly determine the truth
value of non-truth-bearers.
What is the truth value of non-truth-bearers then?

which can do anything at all.  If what you assert is true (which I
doubt), then your system would be incapable of doing anything useful.
--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.

Date Sujet#  Auteur
11 Jul 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal