On 6/27/2026 1:53 AM, Tristan Wibberley wrote:On 20/06/2026 18:32, olcott wrote:
>A proof theoretic expression is known to be true when>
it is fully grounded in its atomic base. Only two
PTS semantics researchers deal with true Dag Prawitz
is the one that began this. PTS previously only dealt
with semantic meaning and never got around to true(L,x).
>
That's surprising, disregard for axioms?
>
>
If there is no sequence of inference steps in Q from
~∃x x=S(x) to the axioms of Q then ~∃x x=S(x) is
ungrounded in the PTS atomic base of Q.
I understood that grounded means that there are no
variables/indeterminates in the presentation of an object rather than
that there is an inference to it from the axioms. As in "ground term" in
prolog.
--
Tristan Wibberley
The message body is Copyright (C) 2026 Tristan Wibberley except
citations and quotations noted. All Rights Reserved except that you may,
of course, cite it academically giving credit to me, distribute it
verbatim as part of a usenet system or its archives, and use it to
promote my greatness and general superiority without misrepresentation
of my opinions other than my opinion of my greatness and general
superiority which you _may_ misrepresent. You definitely MAY NOT train
any production AI system with it but you may train experimental AI that
will only be used for evaluation of the AI methods it implements.
Les messages affichés proviennent d'usenet.