The theory of well-quasi-ordering: a frequently discovered concept
From MaRDI portal
Publication:2554710
Cites work
- A Class of Partially Ordered Sets
- A Theorem on Partial Well-Ordering of Sets of Vectors
- scientific article; zbMATH DE number 3146886 (Why is no real title available?)
- scientific article; zbMATH DE number 3210032 (Why is no real title available?)
- scientific article; zbMATH DE number 3232673 (Why is no real title available?)
- scientific article; zbMATH DE number 3246258 (Why is no real title available?)
- scientific article; zbMATH DE number 3248824 (Why is no real title available?)
- scientific article; zbMATH DE number 3252233 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- scientific article; zbMATH DE number 3198864 (Why is no real title available?)
- scientific article; zbMATH DE number 3052455 (Why is no real title available?)
- scientific article; zbMATH DE number 3052456 (Why is no real title available?)
- On Fraissé's order type conjecture
- On free monoids partially ordered by embedding
- On Ordered Division Rings
- Ordering by Divisibility in Abstract Algebras
- Partial well‐ordering of sets of vectors
- Partially well ordered sets and partial ordinals
- Some generalizations of metric spaces
- Well-Quasi-Ordering of Sequences of Ordinal Numbers
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(only showing first 100 items - show all)- On canonical antichains
- A new class of unique product monoids with applications to ring theory.
- Definability in the \(h\)-quasiorder of labeled forests
- A regularity test for dual bordered OS systems
- Une généralisation des théorèmes de Higman et de Simon aux mots infinis
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
- Another generalization of Higman's well quasi order result on ^*
- Some quasi-ordered classes of finite commutative semigroups
- On total regulators generated by derivation relations
- Termination of rewriting
- On well-quasi-ordering-finite graphs by immersion
- A notion of branching rank for semilattices with descending chain condition
- Using unavoidable set of trees to generalize Kruskal's theorem
- Inventories of unavoidable languages and the word-extension conjecture
- Basic formulas and languages. I: The theory
- Basic formulas and languages. II: Applications to EOL systems and forms
- Better quasi-orders for uncountable cardinals
- Reduction and covering of infinite reachability trees
- From wqo to bqo, via Ellentuck's theorem
- Well rewrite orderings and well quasi-orderings
- Effective constructions in well-partially-ordered free monoids
- A note on language equations involving morphisms
- Well quasi-ordered sets and ideals in free semigroups and algebras
- On well quasi orders of free monoids
- On quasi orders of words and the confluence property
- Well-quasi-ordering and the Hausdorff quasi-uniformity
- Well quasi-orders and regular languages
- Unification in commutative semigroups
- Well quasi orders in a categorical setting
- Well-quasi-ordering versus clique-width
- On operations and linear extensions of well partially ordered sets
- On power varieties of semigroups
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Degree spectra of structures
- Modal companions of \(K4^+\)
- Remarks on a paper of J. Barát and P. P. Varjú
- The tree alternative conjecture under the topological minor relation
- Subgraph complementation and minimum rank
- An infinite antichain of planar tanglegrams
- Well quasi-orders arising from finite ordered semigroups
- Vietoris hyperspaces over scattered Priestley spaces
- Controlling a random population
- Computable fixpoints in well-structured symbolic model checking
- Well-partial-orderings and the big Veblen number
- Stability in the homology of unipotent groups
- FI- and OI-modules with varying coefficients
- Rules with parameters in modal logic. I.
- Homomorphic image orders on combinatorial structures.
- Computable linearizations of well-partial-orderings
- Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition
- WQO is decidable for factorial languages
- Bounded-rank tensors are defined in bounded degree
- The size of Higman-Haines sets
- Rationality of the Möbius function of a composition poset
- The Möbius function of a composition poset
- Regular solutions of language inequalities and well quasi-orders
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Integer packing sets form a well-quasi-ordering
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Well-quasi-ordering versus clique-width: new results on bigenic classes
- Well-quasi-ordering does not imply bounded clique-width
- Complexity hierarchies beyond elementary
- Linear clique-width for hereditary classes of cographs
- Multiply-recursive upper bounds with Higman's lemma
- Reverse mathematical bounds for the termination theorem
- Well, better and in-between
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
- The ideal approach to computing closed subsets in well-quasi-orderings
- Recent progress on well-quasi-ordering graphs
- A combinatorial bound for a restricted form of the termination theorem
- A Mechanized Proof of Higman’s Lemma by Open Induction
- Well-partial orderings and their maximal order types
- The valuation difference rank of a quasi-ordered difference field
- Graph minor theory
- Well quasi-orders, unavoidable sets, and derivation systems
- On Von Neumann Regular Rings of Skew Generalized Power Series
- Well Quasi-orders in Formal Language Theory
- Finite generation of symmetric ideals
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- The Möbius function of generalized subword order
- Well-quasi-orderings and sets of finite sequences
- Fine hierarchies via Priestley duality
- Varieties of Commutative Semigroups
- A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
- Foundations of BQO Theory
- PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE
- Towards a descriptive theory of cb\(_{0}\)-spaces
- Degree spectra of relations on a cone
- On structural descriptions of lower ideals of series parallel posets
- Unavoidable languages, cuts and innocent sets of words
- Ticket Entailment is decidable
- Testing hereditary properties of sequences
- Controlling a random population
- There are exactly _1 topological types of locally finite trees with countably many rays
- The behavior of ascending chain conditions on submodules of bounded finite generation in direct sums
- Two Robots Patrolling on a Line: Integer Version and Approximability
- Labelled well-quasi-order for permutation classes
- E-unification based on generalized embedding
- Verification of timed asynchronous programs
- The Parametric Complexity of Lossy Counter Machines
This page was built for publication: The theory of well-quasi-ordering: a frequently discovered concept
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2554710)
