XPost: comp.theory, sci.math, sci.lang   
   From: polcott333@gmail.com   
      
   On 12/1/2025 10:55 AM, Tristan Wibberley wrote:   
   > On 29/11/2025 18:19, dbush wrote:   
   >> On 11/29/2025 1:07 PM, olcott wrote:   
   >>> On 11/29/2025 11:53 AM, Kaz Kylheku wrote:   
   >>>> On 2025-11-29, olcott wrote:   
   >>>>> Any expression of language that is proven true entirely   
   >>>>> on the basis of its meaning expressed in language is   
   >>>>> a semantic tautology.   
   >>>>   
   >>>> A tautology is an expression of logic which is true for all   
   >>>> combinations of the truth values of its variables and propositions,   
   >>>> which is, of course, regardless of what they mean/represent.   
   >>>>   
   >>>   
   >>> I did not say tautology. I said semantic tautology.   
   >>> I am defining a new thing under the Sun.   
   >>>   
   >>> *Semantic tautology is stipulated to mean*   
   >>> Any expression of language that is proven true entirely   
   >>> on the basis of its meaning expressed in language.   
   >>   
   >> So in other words, "semantic tautology" is just another term for   
   >> "definition".   
   >   
   > I think not. I think it's an analytic framework for language. I expect   
   > it's standard. I never got told of it at university but, knowing what I   
   > know now, its description sounds like it's just a way of saying "I do   
   > formal analysis of language continua via something resembling   
   > factorisation" because, well, what else would a semantic tautology be?   
   >   
   > Frankly I think Olcott is careful to say only definitely true things and   
   > he is already aware that lambda calculus has been used for language   
   > analysis for a very long time. He ought to be informed that   
   > computational linguists know about it, what it can do, how to use it to   
   > analyse, how to form tautologies wrt. relations between strings and   
   > models, etc.   
   >   
      
   That is a good analysis.   
   I have switched to Rudolf Carnap Meaning Postulates   
   within a type hierarchy such that semantics is   
   fully integrated into syntax making unprovable   
   merely mean not a member of this formal system.   
      
   --   
   Copyright 2025 Olcott   
      
   My 28 year goal has been to make   
   "true on the basis of meaning" computable.   
      
   This required establishing a new foundation   
   for correct reasoning.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   
|