An acyclic graph is defined to be a graph that contains no cycles. When extending the concept of acyclicity to hypergraphs, there are several nonequivalent definitions that, when reduced to graphs, are equivalent. We will look at some of these defintions.