CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Open Positions
Highlights
Projects
Software
Publications
Members
Contact
Light
Dark
Automatic
Hereditarily finite sets; Hyper-extensionality; Non-well-foundedness; Set theory; Theoretical Computer Science; Computer Science
Is Hyper-extensionality Preservable under Deletions of Graph Elements?
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 …
Cite
×