Is hyper-extensionality preservable under deletions of graph elements?
type: Item
instance of: scholarly article
title: Is hyper-extensionality preservable under deletions of graph elements?
zbMATH Open document ID: 1345.03096
author: Alberto Casagrande
author: Carla Piazza
author: Alberto Policriti
publication date: 2016-08-05T00:00:00Z
Mathematics Subject Classification ID: 03E20
zbMATH DE Number: 6609750
zbMATH Keywords: set theory
zbMATH Keywords: hereditarily finite sets
zbMATH Keywords: non-well-foundedness
zbMATH Keywords: hyper-extensionality
Wikidata QID: Q113317696
describes a project that uses: SageMath
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.entcs.2016.03.008
OpenAlex ID: W2337156096
cites work: The asymptotic number of acyclic digraphs. I
cites work: The asymptotic number of acyclic digraphs. II
cites work: The Number of Structures of Finite Relations
cites work: An efficient algorithm for computing bisimulation equivalence
cites work: Q5682013
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Random Generation of Directed Acyclic Graphs
cites work: Generating connected acyclic digraphs uniformly at random
cites work: A calculus of communicating systems
cites work: Three Partition Refinement Algorithms
cites work: Markov chain algorithms for generating sets uniformly at random
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Asymptotic enumeration of extensional acyclic digraphs
DOI: 10.1016/J.ENTCS.2016.03.008
description: scientific article; zbMATH DE number 6609750