Faster access than browser!
37 relations: American Journal of Mathematics, Annals of Mathematics, Antichain, Antisymmetric relation, Better-quasi-ordering, Binary relation, Boolean algebra (structure), Closure (mathematics), Cograph, Crispin Nash-Williams, Dickson's lemma, Embedding, Graph minor, Higman's lemma, Induced subgraph, Infinity, Journal of Combinatorial Theory, Kleene star, Kruskal's tree theorem, Lexicographical order, Mathematics, Order theory, Power set, Preorder, Prewellordering, Product order, Ramsey theory, Reflexive relation, Richard Laver, Robertson–Seymour theorem, Scattered order, Subsequence, Total order, Transitive relation, Tree-depth, Well-founded relation, Well-order.
American Journal of Mathematics
The American Journal of Mathematics is a bimonthly mathematics journal published by the Johns Hopkins University Press.
New!!: Well-quasi-ordering and American Journal of Mathematics · See more »
Annals of Mathematics
The Annals of Mathematics is a bimonthly mathematical journal published by Princeton University and the Institute for Advanced Study.
New!!: Well-quasi-ordering and Annals of Mathematics · See more »
Antichain
In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two distinct elements in the subset are incomparable.
New!!: Well-quasi-ordering and Antichain · See more »
Antisymmetric relation
In mathematics, a binary relation R on a set X is anti-symmetric if there is no pair of distinct elements of X each of which is related by R to the other.
New!!: Well-quasi-ordering and Antisymmetric relation · See more »
Better-quasi-ordering
In order theory a better-quasi-ordering or bqo is a quasi-ordering that does not admit a certain type of bad array.
New!!: Well-quasi-ordering and Better-quasi-ordering · See more »
Binary relation
In mathematics, a binary relation on a set A is a set of ordered pairs of elements of A. In other words, it is a subset of the Cartesian product A2.
New!!: Well-quasi-ordering and Binary relation · See more »
Boolean algebra (structure)
In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice.
New!!: Well-quasi-ordering and Boolean algebra (structure) · See more »
Closure (mathematics)
A set has closure under an operation if performance of that operation on members of the set always produces a member of the same set; in this case we also say that the set is closed under the operation.
New!!: Well-quasi-ordering and Closure (mathematics) · See more »
Cograph
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union.
New!!: Well-quasi-ordering and Cograph · See more »
Crispin Nash-Williams
Crispin St.
New!!: Well-quasi-ordering and Crispin Nash-Williams · See more »
Dickson's lemma
In mathematics, Dickson's lemma states that every set of n-tuples of natural numbers has finitely many minimal elements.
New!!: Well-quasi-ordering and Dickson's lemma · See more »
Embedding
In mathematics, an embedding (or imbedding) is one instance of some mathematical structure contained within another instance, such as a group that is a subgroup.
New!!: Well-quasi-ordering and Embedding · See more »
Graph minor
In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges.
New!!: Well-quasi-ordering and Graph minor · See more »
Higman's lemma
In mathematics, Higman's lemma states that the set of finite sequences over a finite alphabet, as partially ordered by the subsequence relation, is well-quasi-ordered.
New!!: Well-quasi-ordering and Higman's lemma · See more »
Induced subgraph
In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges connecting pairs of vertices in that subset.
New!!: Well-quasi-ordering and Induced subgraph · See more »
Infinity
Infinity (symbol) is a concept describing something without any bound or larger than any natural number.
New!!: Well-quasi-ordering and Infinity · See more »
Journal of Combinatorial Theory
The Journal of Combinatorial Theory, Series A and Series B, are mathematical journals specializing in combinatorics and related areas.
New!!: Well-quasi-ordering and Journal of Combinatorial Theory · See more »
Kleene star
In mathematical logic and computer science, the Kleene star (or Kleene operator or Kleene closure) is a unary operation, either on sets of strings or on sets of symbols or characters.
New!!: Well-quasi-ordering and Kleene star · See more »
Kruskal's tree theorem
In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding.
New!!: Well-quasi-ordering and Kruskal's tree theorem · See more »
Lexicographical order
In mathematics, the lexicographic or lexicographical order (also known as lexical order, dictionary order, alphabetical order or lexicographic(al) product) is a generalization of the way words are alphabetically ordered based on the alphabetical order of their component letters.
New!!: Well-quasi-ordering and Lexicographical order · See more »
Mathematics
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
New!!: Well-quasi-ordering and Mathematics · See more »
Order theory
Order theory is a branch of mathematics which investigates the intuitive notion of order using binary relations.
New!!: Well-quasi-ordering and Order theory · See more »
Power set
In mathematics, the power set (or powerset) of any set is the set of all subsets of, including the empty set and itself, variously denoted as, 𝒫(), ℘() (using the "Weierstrass p"),,, or, identifying the powerset of with the set of all functions from to a given set of two elements,.
New!!: Well-quasi-ordering and Power set · See more »
Preorder
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive.
New!!: Well-quasi-ordering and Preorder · See more »
Prewellordering
In set theory, a prewellordering is a binary relation \le that is transitive, total, and wellfounded (more precisely, the relation x\le y\land y\nleq x is wellfounded).
New!!: Well-quasi-ordering and Prewellordering · See more »
Product order
In mathematics, given two ordered sets A and B, one can induce a partial ordering on the Cartesian product.
New!!: Well-quasi-ordering and Product order · See more »
Ramsey theory
Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of mathematics that studies the conditions under which order must appear.
New!!: Well-quasi-ordering and Ramsey theory · See more »
Reflexive relation
In mathematics, a binary relation R over a set X is reflexive if every element of X is related to itself.
New!!: Well-quasi-ordering and Reflexive relation · See more »
Richard Laver
Richard Joseph Laver (October 20, 1942 – September 19, 2012) was an American mathematician, working in set theory.
New!!: Well-quasi-ordering and Richard Laver · See more »
Robertson–Seymour theorem
In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem) states that the undirected graphs, partially ordered by the graph minor relationship, form a well-quasi-ordering.
New!!: Well-quasi-ordering and Robertson–Seymour theorem · See more »
Scattered order
In mathematical order theory, a scattered order is a linear order that contains no densely ordered subset with more than one element (Harzheim 2005:193ff.) A characterization due to Hausdorff states that the class of all scattered orders is the smallest class of linear orders which contains the singleton orders and is closed under well-ordered and reverse well-ordered sums.
New!!: Well-quasi-ordering and Scattered order · See more »
Subsequence
In mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.
New!!: Well-quasi-ordering and Subsequence · See more »
Total order
In mathematics, a linear order, total order, simple order, or (non-strict) ordering is a binary relation on some set X, which is antisymmetric, transitive, and a connex relation.
New!!: Well-quasi-ordering and Total order · See more »
Transitive relation
In mathematics, a binary relation over a set is transitive if whenever an element is related to an element and is related to an element then is also related to.
New!!: Well-quasi-ordering and Transitive relation · See more »
Tree-depth
In graph theory, the tree-depth of a connected undirected graph G is a numerical invariant of G, the minimum height of a Trémaux tree for a supergraph of G. This invariant and its close relatives have gone under many different names in the literature, including vertex ranking number, ordered chromatic number, and minimum elimination tree height; it is also closely related to the cycle rank of directed graphs and the star height of regular languages.
New!!: Well-quasi-ordering and Tree-depth · See more »
Well-founded relation
In mathematics, a binary relation, R, is called well-founded (or wellfounded) on a class X if every non-empty subset S ⊆ X has a minimal element with respect to R, that is an element m not related by sRm (for instance, "s is not smaller than m") for any s ∈ S. In other words, a relation is well founded if Some authors include an extra condition that R is set-like, i.e., that the elements less than any given element form a set.
New!!: Well-quasi-ordering and Well-founded relation · See more »
Well-order
In mathematics, a well-order (or well-ordering or well-order relation) on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering.
New!!: Well-quasi-ordering and Well-order · See more »
Redirects here:
WQO, Well partial order, Well quasi order, Well quasi ordering, Well-partial-order, Well-quasi order, Well-quasi-order, Wellquasiorder, Wqo.
References
[1] https://en.wikipedia.org/wiki/Well-quasi-ordering
