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

Cited In (only showing first 100 items - show all)

The theory of well-quasi-ordering: a frequently discovered concept
Non-primitive recursive decidability of products of modal logics with expanding domains
Modularity in term rewriting revisited
Graph minors. VIII: A Kuratowski theorem for general surfaces
The narrowing-driven approach to functional logic program specialization
A Biologically Inspired Model with Fusion and Clonation of Membranes
Two forbidden induced subgraphs and well-quasi-ordering
Rank functions on rooted tree quivers.
Title not available (Why is that?)
Inflations of geometric grid classes of permutations
Universally axiomatizable subclasses of locally finite classes of models
Deciding safety properties in infinite-state pi-calculus via behavioural types
Better quasi-orders for uncountable cardinals
An effective proof of the well-foundedness of the multiset path ordering
Proving weak properties of rewriting
Orderings for term-rewriting systems
Graph minors and parameterized algorithm design
On the verification of membrane systems with dynamic structure
What's so special about Kruskal's theorem and the ordinal $\Gamma{}_ 0$? A survey of some results in proof theory
The maximal linear extension theorem in second order arithmetic
An analysis of loop checking mechanisms for logic programs
Unavoidable languages, cuts and innocent sets of words
Well-quasi-ordering and the Hausdorff quasi-uniformity
Forbidden substructures and combinatorial dichotomies: WQO and universality
On well quasi orders of free monoids
Branch-width and well-quasi-ordering in matroids and graphs.
Proving open properties by induction
Analysing the implicit complexity of programs.
An application of graphical enumeration to PA *
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
Labelled induced subgraphs and well-quasi-ordering
A notation for lambda terms. A generalization of environments
Branch-width and Rota's conjecture
Labelled well-quasi-order for permutation classes
Well-quasi-order of relabel functions
On Better-Quasi-Ordering Countable Series-Parallel Orders
Sur les premeilleurs ordres. (On prémeilleurs orderings)
Termination of rewriting
Termination orderings for associative-commutative rewriting systems
Linearizing well quasi-orders and bounding the length of bad sequences
A note on simplification orderings
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
On well-quasi-ordering finite structures with labels
Equivalence between Fraïssé's conjecture and Jullien's theorem
Inventories of unavoidable languages and the word-extension conjecture
Well-quasi-orders in subclasses of bounded treewidth graphs
Using unavoidable set of trees to generalize Kruskal's theorem
Well rewrite orderings and well quasi-orderings
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
Homogeneous families on trees and subsymmetric basic sequences
Well-quasi-orderings and sets of finite sequences
Non-deterministic semantics for dynamic topological logic
Contracting planar graphs to contractions of triangulations
A comparison of well-known ordinal notation systems for $\varepsilon _{0}$
Language equations
Simple termination revisited
Outermost ground termination
History and basic features of the critical-pair/completion procedure
Two applications of analytic functors
Condition de chaîne en théorie des rélations
Structure theorem for tournaments omitting N₅
Recent Progress on Well-Quasi-ordering Graphs
Verification as a parameterized testing (experiments with the SCP4 supercompiler)
An initial segment of the set of polynomial functions with exponentiation
Reactive synthesis from interval temporal logic specifications
Laver and set theory
On Fraïssé's conjecture for linear orders of finite Hausdorff rank
Polynomial time termination and constraint satisfaction tests
Computable linearizations of well-partial-orderings
On the expressive power of process interruption and compensation
Graph minor theory
Relative undecidability in term rewriting. I: The termination hierarchy
Relative undecidability in term rewriting. II: The confluence hierarchy
Regular solutions of language inequalities and well quasi-orders
Semi-unification
Graph minors. IV: Tree-width and well-quasi-ordering
From wqo to bqo, via Ellentuck's theorem
On two classes of hereditarily finitely based semigroup identities
The varieties of arboreal experience
Grid classes and partial well order
Type-based homeomorphic embedding for online termination
Polynomial functions with exponentiation are well ordered
On the modal definability of simulability by finite transitive models
Algorithm for finding structures and obstructions of tree ideals
Topology on semi-well ordered sets
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
Simple termination of rewrite systems
Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered
A Glimpse of $$ \sum_{3} $$-elementarity
Well-quasi-ordering $H$-contraction-free graphs
Certified Kruskal’s Tree Theorem
What you always wanted to know about rigid E-unification
A Mechanized Proof of Higman’s Lemma by Open Induction
A framework for computing finite SLD trees
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture
The Complexity of the Diagonal Problem for Recursion Schemes
FI- and OI-modules with varying coefficients
Wohlquasigeordnete Klassen endlicher Graphen
Title not available (Why is that?)
Deciding atomicity of subword-closed languages

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)