Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

Cited in

(only showing first 100 items - show all)

Fraïssé's conjecture in $\Pi_1^1$-comprehension
The theory of well-quasi-ordering: a frequently discovered concept
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
Modularity in term rewriting revisited
Non-primitive recursive decidability of products of modal logics with expanding domains
Topology on semi-well ordered sets
Graph minors. VIII: A Kuratowski theorem for general surfaces
Simple termination of rewrite systems
A Biologically Inspired Model with Fusion and Clonation of Membranes
Rank functions on rooted tree quivers.
The narrowing-driven approach to functional logic program specialization
Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered
Two forbidden induced subgraphs and well-quasi-ordering
Well-quasi-ordering $H$-contraction-free graphs
A Glimpse of $$ \sum_{3} $$-elementarity
scientific article; zbMATH DE number 3821100 (Why is no real title available?)
A framework for computing finite SLD trees
A Mechanized Proof of Higman’s Lemma by Open Induction
FI- and OI-modules with varying coefficients
Wohlquasigeordnete Klassen endlicher Graphen
The Complexity of the Diagonal Problem for Recursion Schemes
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture
E-unification based on generalized embedding
scientific article; zbMATH DE number 7577570 (Why is no real title available?)
Inflations of geometric grid classes of permutations
Deciding safety properties in infinite-state pi-calculus via behavioural types
Universally axiomatizable subclasses of locally finite classes of models
Better quasi-orders for uncountable cardinals
On a problem of R. Halin concerning infinite graphs
Deciding atomicity of subword-closed languages
An effective proof of the well-foundedness of the multiset path ordering
Certified Kruskal's tree theorem
Proving weak properties of rewriting
Orderings for term-rewriting systems
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
On the verification of membrane systems with dynamic structure
Graph minors and parameterized algorithm design
The tree alternative conjecture under the topological minor relation
Minimal bad sequences are necessary for a uniform Kruskal theorem
SMT-based verification of data-aware processes: a model-theoretic approach
What's so special about Kruskal's theorem and the ordinal $\Gamma{}_ 0$? A survey of some results in proof theory
Strong WQO Tree Theorems
Better-quasi-orderings and coinduction
On functions weakly computable by pushdown Petri nets and related systems
scientific article; zbMATH DE number 7379291 (Why is no real title available?)
The maximal linear extension theorem in second order arithmetic
An analysis of loop checking mechanisms for logic programs
On approximately identifying concept classes in the limit
Well-quasi-ordering and the Hausdorff quasi-uniformity
ASYMPTOTIC ANALYSIS OF SKOLEM’S EXPONENTIAL FUNCTIONS
Forward analysis for WSTS, part I: completions
On well quasi orders of free monoids
Unavoidable languages, cuts and innocent sets of words
Proving open properties by induction
Forbidden substructures and combinatorial dichotomies: WQO and universality
Branch-width and well-quasi-ordering in matroids and graphs.
Analysing the implicit complexity of programs.
An application of graphical enumeration to PA *
Labelled induced subgraphs and well-quasi-ordering
Generalized fusible numbers and their ordinals
On effective construction of the greatest solution of language inequality $XA\subseteq BX$
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
What you always wanted to know about rigid $E$-unification
A notation for lambda terms. A generalization of environments
Branch-width and Rota's conjecture
An infinite antichain of planar tanglegrams
More problems in rewriting
Labelled well-quasi-order for permutation classes
Well-quasi-order of relabel functions
Skolem + tetration is well-ordered
Termination of rewriting
Sur les premeilleurs ordres. (On prémeilleurs orderings)
Finite structure for Friedman ideals of finite trees
On Better-Quasi-Ordering Countable Series-Parallel Orders
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
From Kruskal’s theorem to Friedman’s gap condition
Recent progress on well-quasi-ordering graphs
Deciding Innermost Loops
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
Generalizing Kruskal's theorem to pairs of cohabitating trees
Notes on my scientific life
Analysis of a double Kruskal theorem
Termination orderings for associative-commutative rewriting systems
Une extension d'un théorème de P. Jullien sur les âges de mots
Linearizing well quasi-orders and bounding the length of bad sequences
An ordinal bound for the set of polynomial functions with exponentiation
A note on simplification orderings
On well-quasi-ordering finite structures with labels
A pumping lemma for permitting semi-conditional languages
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
Critical properties and complexity measures of read-once Boolean functions
Equivalence between Fraïssé's conjecture and Jullien's theorem
Inventories of unavoidable languages and the word-extension conjecture
Using unavoidable set of trees to generalize Kruskal's theorem
Well-quasi-orders in subclasses of bounded treewidth graphs
Well rewrite orderings and well quasi-orderings
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
Bachmann-Howard derivatives
Embedding with patterns and associated recursive path ordering
A fast-growing sequence inspired by $\mathrm{TREE}(k)$

This page was built for publication: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

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