Hereditarily finite sets; Hyper-extensionality; Non-well-foundedness; Set theory; Theoretical Computer Science; Computer Science

Any hereditarily finite set S can be represented as a finite pointed graph -dubbed membership graph- whose nodes denote elements of the transitive closure of S and whose edges model the membership relation. Membership graphs must be …