XPost: comp.theory, sci.math, comp.lang.prolog   
   XPost: sci.lang, comp.software-eng   
   From: polcott333@gmail.com   
      
   Source code of fully operational system   
   https://github.com/plolcott/x86utm/blob/master/Halt7.c   
      
   int DD()   
   {   
      int Halt_Status = HHH(DD);   
      if (Halt_Status)   
        HERE: goto HERE;   
      return Halt_Status;   
   }   
      
   HHH simulates DD step-by-step according to   
   the semantics of the C programming language.   
      
   HHH correctly determines that DD does not have a well-founded   
   justification tree within Proof theoretic semantics.   
      
   When HHH is construed as a proof theoretic halting prover   
   HHH detects the pathological-self-reference of its input and   
   rejects DD as non-well-founded on this basis.   
      
   % This sentence is not true.   
   ?- LP = not(true(LP)).   
   LP = not(true(LP)).   
   ?- unify_with_occurs_check(LP, not(true(LP))).   
   false.   
      
   The Liar Paradox is formally rejected by Prolog   
   occurs_check for this same reason.   
      
   occurs_check correctly determines that LP does not   
   have a well-founded justification tree within Proof   
   theoretic semantics.   
      
   --   
   Copyright 2026 Olcott

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

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