Is hyper-extensionality preservable under deletions of graph elements?

DOI10.1016/j.entcs.2016.03.008zbMath1345.03096OpenAlexW2337156096WikidataQ113317696 ScholiaQ113317696MaRDI QIDQ737091

Alberto Policriti, Carla Piazza, Alberto Casagrande

Publication date: 5 August 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.03.008

zbMATH Keywords

set theoryhereditarily finite setshyper-extensionalitynon-well-foundedness

Mathematics Subject Classification ID

Other classical set theory (including functions, relations, and set algebra) (03E20)

Uses Software

• SageMath
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic enumeration of extensional acyclic digraphs
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• A calculus of communicating systems
• An efficient algorithm for computing bisimulation equivalence
• Generating connected acyclic digraphs uniformly at random
• Markov chain algorithms for generating sets uniformly at random
• Random Generation of Directed Acyclic Graphs
• Algebraic laws for nondeterminism and concurrency
• Three Partition Refinement Algorithms
• The Number of Structures of Finite Relations