directed acyclic graph

noun1

1. •
   A finite directed graph that contains no directed cycles.

   • A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable. — 2011