Is hyper-extensionality preservable under deletions of graph elements?

DOI10.1016/J.ENTCS.2016.03.008zbMATH Open1345.03096OpenAlexW2337156096WikidataQ113317696 ScholiaQ113317696MaRDI QIDQ737091FDOQ737091

Authors: Alberto Casagrande, Carla Piazza, Alberto Policriti 

Publication date: 5 August 2016

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

Recommendations

• Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
• Well-quasi-ordering hereditarily finite sets
• Digraph parameters and finite set arithmetic
• Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
• Set graphs. II. Complexity of set graph recognition and similar problems

zbMATH Keywords

set theoryhereditarily finite setshyper-extensionalitynon-well-foundedness

Mathematics Subject Classification ID

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

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Three Partition Refinement Algorithms
• A calculus of communicating systems
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Asymptotic enumeration of extensional acyclic digraphs
• An efficient algorithm for computing bisimulation equivalence
• Generating connected acyclic digraphs uniformly at random
• Random Generation of Directed Acyclic Graphs
• The Number of Structures of Finite Relations
• Markov chain algorithms for generating sets uniformly at random

Uses Software

• SageMath
• OEIS

This page was built for publication: Is hyper-extensionality preservable under deletions of graph elements?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q737091)