XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/30/2025 7:05 PM, Jeff Barnett wrote:   
   > On 12/29/2025 4:17 PM, Richard Damon wrote:   
   >> On 12/29/25 6:07 PM, olcott wrote:   
   >>> A DAG (Directed Acyclic Graph) that is also a tree   
   >>> is a specific type of DAG where each node (except   
   >>> the single root) has exactly one parent, creating   
   >>> a hierarchy with no cycles.   
   >>>   
   >>> When building an inheritance hierarchy knowledge   
   >>> ontology There may be a single root node such as   
   >>> {Thing} yet DAG Trees would exclude multiple   
   >>> inheritance.   
   >>>   
   >>> You can still have a DAG with a single root node   
   >>> and have multiple inheritance yet you cannot   
   >>> call it a tree.   
   >>>   
   >>   
   >> So, what "fact" of knowledge needs nothing to base itself on?   
   >>   
   >> "Thing" as a word, doesn't have a meaning by itself.   
   >>   
   >> This is your problem, you NEED to embed your "system" into something   
   >> with givens to establish your "roots".   
   >>   
   >> And, the problem is "Natural Language", your favorite source, is just   
   >> too inconsistant of a source.   
   >   
   > If you are going to criticize that absurd idiot, at least comment on a   
   > Freshmen stupidity. Think before you type. The circle jerk continues.   
   > You both flunk.   
   >   
   > While a tree is a DAG, not all DAG are trees.   
      
   *Maybe you can be the first human to understand this*   
      
   ?- LP = not(true(LP)).   
   LP = not(true(LP)).   
   ?- unify_with_occurs_check(LP, not(true(LP))).   
   false.   
      
   What is actually means is that Prolog detected   
   a cycle in the directed graph of the evaluation   
   sequence of LP.   
      
   I created Minimal Type Theory for this exact same purpose.   
   LP := ~True(LP)   
      
   All that MTT ever did was detect cycles in the   
   evaluation sequence of expressions by first   
   translating these expressions into direct graphs.   
      
   --   
   Copyright 2025 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)