XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   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.   
      
   --   
   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-DOS v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)