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

Cited in

(only showing first 100 items - show all)

A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
Laver and set theory
An analysis of loop checking mechanisms for logic programs
A Biologically Inspired Model with Fusion and Clonation of Membranes
Analysing the implicit complexity of programs.
On Fraïssé's conjecture for linear orders of finite Hausdorff rank
What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
Using unavoidable set of trees to generalize Kruskal's theorem
Graph minor theory
Graph minors. VIII: A Kuratowski theorem for general surfaces
Unavoidable languages, cuts and innocent sets of words
An application of graphical enumeration to PA *
Relative undecidability in term rewriting. I: The termination hierarchy
Relative undecidability in term rewriting. II: The confluence hierarchy
Type-based homeomorphic embedding for online termination
Proving weak properties of rewriting
Outermost ground termination
Termination orderings for associative-commutative rewriting systems
The varieties of arboreal experience
Graph minors. IV: Tree-width and well-quasi-ordering
Deciding safety properties in infinite-state pi-calculus via behavioural types
An initial segment of the set of polynomial functions with exponentiation
Polynomial time termination and constraint satisfaction tests
Regular solutions of language inequalities and well quasi-orders
Labelled well-quasi-order for permutation classes
Well-quasi-ordering and the Hausdorff quasi-uniformity
Grid classes and partial well order
Polynomial functions with exponentiation are well ordered
Language equations
Orderings for term-rewriting systems
A notation for lambda terms. A generalization of environments
Two applications of analytic functors
On the modal definability of simulability by finite transitive models
Condition de chaîne en théorie des rélations
Linearizing well quasi-orders and bounding the length of bad sequences
Reactive synthesis from interval temporal logic specifications
Better quasi-orders for uncountable cardinals
Algorithm for finding structures and obstructions of tree ideals
A note on simplification orderings
Inventories of unavoidable languages and the word-extension conjecture
Computable linearizations of well-partial-orderings
Well-quasi-order of relabel functions
Recent progress on well-quasi-ordering graphs
Semi-unification
Verification as a parameterized testing (experiments with the SCP4 supercompiler)
Graph minors and parameterized algorithm design
Two forbidden induced subgraphs and well-quasi-ordering
On the verification of membrane systems with dynamic structure
Well rewrite orderings and well quasi-orderings
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
From wqo to bqo, via Ellentuck's theorem
History and basic features of the critical-pair/completion procedure
On well quasi orders of free monoids
Forbidden substructures and combinatorial dichotomies: WQO and universality
Rank functions on rooted tree quivers.
The theory of well-quasi-ordering: a frequently discovered concept
On Better-Quasi-Ordering Countable Series-Parallel Orders
Well-quasi-orderings and sets of finite sequences
Branch-width and Rota's conjecture
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
The narrowing-driven approach to functional logic program specialization
On well-quasi-ordering finite structures with labels
Non-primitive recursive decidability of products of modal logics with expanding domains
An effective proof of the well-foundedness of the multiset path ordering
Homogeneous families on trees and subsymmetric basic sequences
Branch-width and well-quasi-ordering in matroids and graphs.
Inflations of geometric grid classes of permutations
Labelled induced subgraphs and well-quasi-ordering
Equivalence between Fraïssé's conjecture and Jullien's theorem
Non-deterministic semantics for dynamic topological logic
Sur les premeilleurs ordres. (On prémeilleurs orderings)
Proving open properties by induction
The maximal linear extension theorem in second order arithmetic
scientific article; zbMATH DE number 3821100 (Why is no real title available?)
Modularity in term rewriting revisited
On the expressive power of process interruption and compensation
Termination of rewriting
Universally axiomatizable subclasses of locally finite classes of models
Well-quasi-orders in subclasses of bounded treewidth graphs
Contracting planar graphs to contractions of triangulations
Structure theorem for tournaments omitting N₅
Simple termination revisited
On two classes of hereditarily finitely based semigroup identities
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
A Mechanized Proof of Higman’s Lemma by Open Induction
The tree alternative conjecture under the topological minor relation
Programming by predicates: a formal model for interactive synthesis
Graphs without \(K_ 4\) and well-quasi-ordering
Minimal bad sequences are necessary for a uniform Kruskal theorem
An infinite antichain of planar tanglegrams
Finite structure for Friedman ideals of finite trees
Obituary: Ernest Corominas
Forward analysis for WSTS, part I: completions
On approximately identifying concept classes in the limit
Critical properties and complexity measures of read-once Boolean functions
The ideal approach to computing closed subsets in well-quasi-orderings
The reverse mathematics of wqos and bqos
A framework for computing finite SLD trees
On better quasi-ordering countable trees

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)