XPost: comp.theory, sci.math, comp.ai.philosophy   
   XPost: comp.lang.prolog   
   From: polcott333@gmail.com   
      
   The system uses proof-theoretic semantics, where the   
   meaning of a statement is determined entirely by its   
   inferential role within a theory. A theory T consists   
   of a finite set of basic statements together with   
   everything that can be derived from them using the   
   inference rules. The statements derivable in this   
   way are the theorems of T. A statement is true in   
   T exactly when T proves it. A statement is false   
   in T exactly when T proves its negation. Some   
   statements are neither true nor false in T. These   
   are the non-well-founded statements: statements   
   whose inferential justification cannot be grounded   
   in a finite, well-founded proof structure. This includes   
   self-referential constructions such as Gödel-type sentences.   
      
   *Proof Theoretic Semantics Blocks Pathological Self-Reference*   
   https://philpapers.org/archive/OLCPTS.pdf   
      
   --   
   Copyright 2026 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning expressed in language"
   
   reliably computable.

   
      
   This required establishing a new foundation
   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)