Well-quasi-ordering hereditarily finite sets
From MaRDI portal
Publication:2855754
DOI10.1080/00207160.2012.754434zbMath1273.05091MaRDI QIDQ2855754
Alberto Policriti, Alexandru I. Tomescu
Publication date: 22 October 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.754434
05C83: Graph minors
05C20: Directed graphs (digraphs), tournaments
03E05: Other combinatorial set theory
97E60: Sets, relations, set theory (educational aspects)
Related Items
Cites Work
- Unnamed Item
- A classification of the expressive power of well-structured transition systems
- A well-quasi-order for tournaments
- Graph minors. XX: Wagner's conjecture
- Digraph measures: Kelly decompositions, games, and orderings
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Hypersets
- Directed tree-width
- Well-Quasi-Ordering Hereditarily Finite Sets
- Ackermann encoding, bisimulations and OBDDs
- Decomposition of Graphs into Two-Way Infinite Paths
- Well-structured transition systems everywhere!