- Algorithms
- >
- Recursion
- >
- Mathematical induction
- >
- Wellfoundedness

- Arithmetic
- >
- Comparison (mathematical)
- >
- Order theory
- >
- Wellfoundedness

- Binary operations
- >
- Comparison (mathematical)
- >
- Order theory
- >
- Wellfoundedness

- Computability theory
- >
- Recursion
- >
- Mathematical induction
- >
- Wellfoundedness

- Elementary arithmetic
- >
- Comparison (mathematical)
- >
- Order theory
- >
- Wellfoundedness

- Fields of mathematics
- >
- Mathematical logic
- >
- Set theory
- >
- Wellfoundedness

- Logical consequence
- >
- Deductive reasoning
- >
- Mathematical induction
- >
- Wellfoundedness

- Mathematical logic
- >
- Proof theory
- >
- Mathematical induction
- >
- Wellfoundedness

- Mathematical logic
- >
- Recursion
- >
- Mathematical induction
- >
- Wellfoundedness

- Mathematical proofs
- >
- Proof theory
- >
- Mathematical induction
- >
- Wellfoundedness

- Mathematics
- >
- Fields of mathematics
- >
- Order theory
- >
- Wellfoundedness

- Mathematics
- >
- Mathematical proofs
- >
- Mathematical induction
- >
- Wellfoundedness

- Metalogic
- >
- Proof theory
- >
- Mathematical induction
- >
- Wellfoundedness

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Set theory
- >
- Wellfoundedness

- Proof theory
- >
- Methods of proof
- >
- Mathematical induction
- >
- Wellfoundedness

- Theorems
- >
- Mathematical proofs
- >
- Mathematical induction
- >
- Wellfoundedness

Hereditarily well-founded set

No description available.

Infinite descending chain

No description available.

Non-well-founded set theory

Non-well-founded set theories are variants of axiomatic set theory that allow sets to be elements of themselves and otherwise violate the rule of well-foundedness. In non-well-founded set theories, th

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. Every better-quasi-ordering is a well-quasi-ordering.

Scott–Potter set theory

An approach to the foundations of mathematics that is of relatively recent origin, Scott–Potter set theory is a collection of nested axiomatic set theories set out by the philosopher Michael Potter, b

Well-quasi-ordering

In mathematics, specifically order theory, a well-quasi-ordering or wqo is a quasi-ordering such that any infinite sequence of elements from contains an increasing pair with

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. That is, if is an infinite seque

Structural induction

Structural induction is a proof method that is used in mathematical logic (e.g., in the proof of Łoś' theorem), computer science, graph theory, and some other mathematical fields. It is a generalizati

Dickson's lemma

In mathematics, Dickson's lemma states that every set of -tuples of natural numbers has finitely many minimal elements. This simple fact from combinatorics has become attributed to the American algebr

Kőnig's lemma

Kőnig's lemma or Kőnig's infinity lemma is a theorem in graph theory due to the Hungarian mathematician Dénes Kőnig who published it in 1927. It gives a sufficient condition for an infinite graph to h

Prewellordering

In set theory, a prewellordering on a set is a preorder on (a transitive and strongly connected relation on ) that is wellfounded in the sense that the relation is wellfounded. If is a prewellordering

Noetherian topological space

In mathematics, a Noetherian topological space, named for Emmy Noether, is a topological space in which closed subsets satisfy the descending chain condition. Equivalently, we could say that the open

Ascending chain condition

In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutativ

Well-structured transition system

In computer science, specifically in the field of formal verification, well-structured transition systems (WSTSs) are a general class of infinite state systems for which many verification problems are

Ordinal number

In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, nth, etc.) aimed to extend enumeration to infinite sets. A finite set can be enumerated by success

Universal set

In set theory, a universal set is a set which contains all objects, including itself. In set theory as usually formulated, it can be proven in multiple ways that a universal set does not exist. Howeve

Kleene–Brouwer order

In descriptive set theory, the Kleene–Brouwer order or Lusin–Sierpiński order is a linear order on finite sequences over some linearly ordered set , that differs from the more commonly used lexicograp

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. The set

Axiom of regularity

In mathematics, the axiom of regularity (also known as the axiom of foundation) is an axiom of Zermelo–Fraenkel set theory that states that every non-empty set A contains an element that is disjoint f

Friedman's SSCG function

In mathematics, a simple subcubic graph (SSCG) is a finite simple graph in which each vertex has degree at most three. Suppose we have a sequence of simple subcubic graphs G1, G2, ... such that each g

Well-ordering principle

In mathematics, the well-ordering principle states that every non-empty set of positive integers contains a least element. In other words, the set of positive integers is well-ordered by its "natural"

Newman's lemma

In mathematics, in the theory of rewriting systems, Newman's lemma, also commonly called the diamond lemma, states that a terminating (or strongly normalizing) abstract rewriting system (ARS), that is

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 s

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.

Epsilon-induction

In set theory, -induction, also called epsilon-induction or set-induction, is a principle that can be used to prove that all sets satisfy a given property. Considered as an axiomatic principle, it is

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. E

Mostowski collapse lemma

In mathematical logic, the Mostowski collapse lemma, also known as the Shepherdson–Mostowski collapse, is a theorem of set theory introduced by Andrzej Mostowski and.

© 2023 Useful Links.