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

Cited in

(only showing first 100 items - show all)

Non-deterministic semantics for dynamic topological logic
On Fraïssé's conjecture for linear orders of finite Hausdorff rank
The varieties of arboreal experience
Graphs without \(K_ 4\) and well-quasi-ordering
On better quasi-ordering countable trees
Some quasi-ordered classes of finite commutative semigroups
Termination orderings for associative-commutative rewriting systems
Termination of rewriting
History and basic features of the critical-pair/completion procedure
Proving open properties by induction
Using unavoidable set of trees to generalize Kruskal's theorem
Inventories of unavoidable languages and the word-extension conjecture
A notation for lambda terms. A generalization of environments
A note on simplification orderings
On two classes of hereditarily finitely based semigroup identities
Better quasi-orders for uncountable cardinals
Intersection properties of graphs
An analysis of loop checking mechanisms for logic programs
What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
Analyzing Nash-Williams' partition theorem by means of ordinal types
From wqo to bqo, via Ellentuck's theorem
Unprovable combinatorial statements
Obituary: Ernest Corominas
Well rewrite orderings and well quasi-orderings
Skolem functions and constructive models
Polynomial functions with exponentiation are well ordered
An ordinal bound for the set of polynomial functions with exponentiation
An initial segment of the set of polynomial functions with exponentiation
On a problem of R. Halin concerning infinite graphs
Condition de chaîne en théorie des rélations
On well quasi orders of free monoids
Well-quasi-ordering and the Hausdorff quasi-uniformity
Simple termination of rewrite systems
Analysing the implicit complexity of programs.
Branch-width and Rota's conjecture
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
On operations and linear extensions of well partially ordered sets
Parameterized verification of monotone information systems
Ordinals. II: Some applications and a functorial approach
Branch-width and well-quasi-ordering in matroids and graphs.
Relative undecidability in term rewriting. I: The termination hierarchy
Relative undecidability in term rewriting. II: The confluence hierarchy
Better-quasi-orderings and coinduction
Modularity in term rewriting revisited
Pure \(\Sigma_2\)-elementarity beyond the core
Critical properties and complexity measures of read-once Boolean functions
Reactive synthesis from interval temporal logic specifications
Language equations
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
The tree alternative conjecture under the topological minor relation
Minimal bad sequences are necessary for a uniform Kruskal theorem
An infinite antichain of planar tanglegrams
A framework for computing finite SLD trees
Finite structure for Friedman ideals of finite trees
Forbidden substructures and combinatorial dichotomies: WQO and universality
Two forbidden induced subgraphs and well-quasi-ordering
Programming by predicates: a formal model for interactive synthesis
FI- and OI-modules with varying coefficients
Inflations of geometric grid classes of permutations
Equivalence between Fraïssé's conjecture and Jullien's theorem
A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
Algorithm for finding structures and obstructions of tree ideals
Verification as a parameterized testing (experiments with the SCP4 supercompiler)
Computable linearizations of well-partial-orderings
Well-quasi-ordering \(H\)-contraction-free graphs
On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
Non-primitive recursive decidability of products of modal logics with expanding domains
Petri nets with name creation for transient secure association
Universally axiomatizable subclasses of locally finite classes of models
Some special properties of cofinality of ordinal numbers
Wohlquasigeordnete Klassen endlicher Graphen
Sur les premeilleurs ordres. (On prémeilleurs orderings)
The theory of well-quasi-ordering: a frequently discovered concept
Regular solutions of language inequalities and well quasi-orders
Graph minors. IV: Tree-width and well-quasi-ordering
Graph minors. VIII: A Kuratowski theorem for general surfaces
Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
Outermost ground termination
Graph minors and parameterized algorithm design
Certified Kruskal's tree theorem
Analysis of a double Kruskal theorem
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
The ideal approach to computing closed subsets in well-quasi-orderings
Strong WQO Tree Theorems
Recent progress on well-quasi-ordering graphs
The reverse mathematics of wqos and bqos
Well-Quasi Orders and Hierarchy Theory
A Mechanized Proof of Higman’s Lemma by Open Induction
Well-partial orderings and their maximal order types
scientific article; zbMATH DE number 3860380 (Why is no real title available?)
Graph minor theory
Forward analysis for WSTS, part I: completions
Deciding Innermost Loops
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
A Biologically Inspired Model with Fusion and Clonation of Membranes
Skolem + tetration is well-ordered
On the expressive power of process interruption and compensation
Well-quasi-orders in subclasses of bounded treewidth graphs
scientific article; zbMATH DE number 3821100 (Why is no real title available?)
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite 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)