Acyclic hypergraphs are analogues of forests in graphs. They are very usefu
l in the design of databases. The number of distinct acyclic uniform hyperg
raphs with n labeled vertices is studied. With the aid of the principle of
inclusion-exclusion, two formulas are presented. One is the explicit formul
a for strict ( d)-connected acyclic hypergraphs, the other is the recurrenc
e formula for linear acyclic hypergraphs.