Partial well‐ordering of sets of vectors

DOI10.1112/S0025579300000565zbMath0057.04302MaRDI QIDQ5829880

No author found.

Publication date: 1954

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

Set theory

Related Items (28)

Reverse mathematics, well-quasi-orders, and Noetherian spaces ⋮ The micro-world of cographs ⋮ Labelled well-quasi-order for permutation classes ⋮ Termination of rewriting ⋮ Infinitary Noetherian constructions I. Infinite words ⋮ Handling infinitely branching well-structured transition systems ⋮ The FEP for some varieties of fully distributive knotted residuated lattices ⋮ Fixed points and Noetherian topologies ⋮ Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture ⋮ Complete ordered sets with no infinite antichains ⋮ Finite dimensional scattered posets ⋮ On well-quasi-ordering finite structures with labels ⋮ Unnamed Item ⋮ Better quasi-orders for uncountable cardinals ⋮ 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 ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ From wqo to bqo, via Ellentuck's theorem ⋮ All normal extensions of S5-squared are finitely axiomatizable ⋮ Finite generation of symmetric ideals ⋮ On Better-Quasi-Ordering Countable Series-Parallel Orders ⋮ Linearizing well quasi-orders and bounding the length of bad sequences ⋮ Sur les premeilleurs ordres. (On prémeilleurs orderings) ⋮ The theory of well-quasi-ordering: a frequently discovered concept ⋮ Une généralisation des théorèmes de Higman et de Simon aux mots infinis ⋮ The Erdős-Dushnik-Miller theorem for topological graphs and orders ⋮ Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor

Cites Work

• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Partial well‐ordering of sets of vectors