exhaustive subsets

[Brett Calcott]

I've found some python solutions to find the set of subsets for a given set,
but how do you find the set of the set of subsets whose union is the given
set and whose intersections is the empty set.

ie. Given a cake divided into 6 unique pieces (0-5), how many different ways
can I distribute the cake so that there are no pieces left. eg.

((0), (1,2,3,4))
or ((0),(1),(2,3,4))
or ((0,1),(2,3),(4))
or ((0,4),(1),(2,3))

Is there a name for this problem?

Cheers,
Brett

--
Brett Calcott
Philosophy Program, RSSS, ANU
Canberra, ACT 0200, AUSTRALIA