home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   sci.logic      Logic -- math, philosophy & computationa      262,912 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 262,601 of 262,912   
   Tristan Wibberley to olcott   
   =?UTF-8?Q?Glossary_building_=28Was=3A_Re   
   18 Jan 26 11:53:14   
   
   XPost: sci.math   
   From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   "standard model"   
     I saw one hushnow thing on stackoverflow about this, everything else   
   was about quantum physics where "standard" is used in its natural sense   
   of a well known and understood point in a space against which we can   
   reference deviations.   
      
   "predicate"   
     This has a meaning in formal systems as something that joins objects   
   of a system to form a statement of the system.   
     Do you mean to use "propositional function" or, by "truth predicate"   
   do you mean to refer to the former sense in an example such as '⊢' which   
   joins one object to nothing else to form a statement that asserts the   
   object?   
      
   A sensibly weak PA is found with semantics in (I think all of) Haskell,   
   Idris, Agda2, Epigram2 via Algebraic Data Types. There are   
   nonprogramming systems such as System F that contain it along with very   
   much more besides.   
      
      
   Topic formed with reference to:   
      
   On 17/01/2026 21:08, olcott wrote:   
   > For nearly a century, discussions of arithmetic have quietly   
   > relied on a fundamental conflation: the idea that   
   > “true in arithmetic” meant “true in the standard model of ℕ.”   
   > But PA itself has no truth predicate, no internal semantics,   
   > and no mechanism for assigning truth values. So what was   
   > called “true in arithmetic” was always meta-theoretic truth   
   > about arithmetic, imported from an external model and never   
   > grounded inside PA.   
   >   
   > This conflation was rarely acknowledged, and it shaped the   
   > interpretation of Gödel’s incompleteness theorems, independence   
   > results like Goodstein and Paris–Harrington, and the entire   
   > discourse around “true but unprovable” statements.   
   >   
   > My work begins by correcting this foundational error.   
   >   
   > PA has no internal truth predicate, so classical claims of   
   > “true in arithmetic” were always meta-theoretic   
      
   --   
   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.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca