Well-quasi-orderings and sets of finite sequences
From MaRDI portal
Publication:4190679
DOI10.1017/S030500410005204XzbMath0405.06001MaRDI QIDQ4190679
Publication date: 1976
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Partial orders, general (06A06) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items
The micro-world of cographs, Better-quasi-orderings and coinduction, On the least exponential growth admitting uncountably many closed permutation classes, Labelled well-quasi-order for permutation classes, An infinite antichain of planar tanglegrams, Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees, Infinitary Noetherian constructions I. Infinite words, A finite model theorem for the propositional \(\mu\)-calculus, Sequences of commutator operations, Analysis of a Double Kruskal Theorem, Complete ordered sets with no infinite antichains, On the number of finite algebraic structures, Better quasi-orders for uncountable cardinals, Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory, Well, Better and In-Between, On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders, Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind, Forbidden substructures and combinatorial dichotomies: WQO and universality, Generalizing Kruskal's theorem to pairs of cohabitating trees, Laver and set theory, On regularity of context-free languages
Cites Work
- On Fraissé's order type conjecture
- Wohlquasigeordnete Klassen endlicher Graphen
- The theory of well-quasi-ordering: a frequently discovered concept
- An order type decomposition theorem
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Ordering by Divisibility in Abstract Algebras
