Re: How a True(X) predicate can be defined for the set of analytic knowledge

Liste des GroupesRevenir à s logic 
Sujet : Re: How a True(X) predicate can be defined for the set of analytic knowledge
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : sci.logic
Date : 03. Apr 2025, 04:11:25
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <7b2312a71210e65cf978248ff7a9dfaa7c283123@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
User-Agent : Mozilla Thunderbird
On 4/2/25 10:57 PM, olcott wrote:
On 4/2/2025 8:58 PM, Richard Damon wrote:
On 4/2/25 9:33 PM, olcott wrote:
On 4/2/2025 5:07 PM, Richard Damon wrote:
On 4/2/25 12:03 PM, olcott wrote:
On 4/2/2025 4:32 AM, Mikko wrote:
On 2025-04-01 17:56:25 +0000, olcott said:
>
On 4/1/2025 1:33 AM, Mikko wrote:
On 2025-03-31 18:33:26 +0000, olcott said:
>
>
Anything the contradicts basic facts or expressions
semantically entailed from these basic facts is proven
false.
>
Anything that follows from true sentences by a truth preserving
transformations is true. If you can prove that a true sentence
is false your system is unsound.
>
Ah so we finally agree on something.
What about the "proof" that detecting inconsistent
axioms is impossible? (I thought that I remebered this).
>
A method that can always determine whether a set of axioms is inconsistent
does not exist. However, there are methods that can correctly determine
about some axiom systems that they are inconsistent and fail on others.
>
The proof is just another proof that some function is not Turing computable.
>
>
A finite set of axioms would seem to always be verifiable
as consistent or inconsistent.  This may be the same for
a finite list of axiom schemas.
>
>
Think of how many statements can be constructed from a finite alphabet of letters.
>
Can you "test" every statement to see if it is consistant?
>
>
Is "LKNSDFKLWRLKLKNKUKQWEEYIYWQFGFGH" consistent or inconsistent?
Try to come up with a better counter-example.
>
It depends on what each of those letters mean.
>
 So say what they mean to form your counter-example
showing that consistency across a finite set of axioms
is undecidable. PUT UP OR SHUT UP.
No. You are just going off on a Red Herring.
Show where your system defeats Godel's proof of the inability to prove consistancy.
PUT UP OR SHUT UP.
(of course, your problem will be you don't understand that proof, as you just don't understand "complicated" logic since you think Prolog can do anything.

 
You should know better than that, but you don't, because you really are too stupid.
>
 

Date Sujet#  Auteur
17 Jun 26 o  …

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal