Hereditarily finite sets; Hypersets; Bisimulation; Membership graphs

A (hereditarily finite) set/hyperset S can be completely depicted by a (finite pointed) graph GS—dubbed its membership graph— in which every node represents an element of the transitive closure of S and every arc represents a membership relation …