aiwiki.page
English

Discrete Math & Logic

150 entriesPage 3 of 3
Set Intersection

Set intersection is the operation that forms a set containing exactly the elements common to every set in a specified collection.

set-intersection
Set Partition

A set partition divides a set into nonempty, mutually disjoint subsets whose union is the entire set.

set-partition
Set Theory

Set theory studies collections of objects, their relationships, and infinite sizes, and provides a standard foundation for mathematics.

set-theory
Set Union

The union of a collection of sets is the set containing exactly those elements that belong to at least one set in the collection.

set-union
Set-builder Notation

Set-builder notation specifies a set by describing the conditions its elements satisfy, rather than listing those elements individually.

set-builder-notation
Seven Bridges of Königsberg

The Seven Bridges of Königsberg is a historical route-finding problem whose impossibility, proved by Leonhard Euler, helped establish graph theory.

seven-bridges-of-konigsberg
Soundness (Logic)

Soundness is the property that a proof system derives only conclusions warranted by its semantics; a sound argument is valid and has true premises.

soundness-logic
Stirling Numbers

Stirling numbers are two families of integers that count permutations by cycles and set partitions by blocks, and connect ordinary powers with factorial powers.

stirling-numbers
Strong Induction

Strong induction proves a statement for every natural number by deriving each case from the assumption that all earlier cases hold.

strong-induction
Strongly Connected Component

A strongly connected component is a maximal set of vertices in a directed graph in which every vertex is reachable from every other vertex.

strongly-connected-component
Subsequence

A subsequence is a sequence formed by selecting terms of another sequence in their original order, without requiring the selected terms to be consecutive.

subsequence
Subset

A subset is a set whose every element also belongs to another specified set, with equality permitted unless the subset is required to be proper.

subset
Symmetric Difference

The symmetric difference of two sets consists of the elements belonging to exactly one of them, connecting set operations with exclusive-or logic, algebra, and measures of disagreement.

symmetric-difference
Theorem

A theorem is a mathematical statement established by proof from specified assumptions and accepted rules of inference.

theorem
Total Order

A total order is a relation that consistently compares every pair of elements, placing them in a single linear arrangement.

total-order
Transfinite Induction

Transfinite induction is a proof method that extends mathematical induction to well-ordered sets, especially ordinal numbers, by using all earlier cases to establish each case.

transfinite-induction
Transitive Closure

The transitive closure of a binary relation is the smallest transitive relation containing it, representing reachability through one or more successive steps.

transitive-closure
Transitive Relation

A transitive relation is a binary relation in which a relation from one element to a second and from the second to a third implies the same relation from the first to the third.

transitive-relation
Tree (graph theory)

A tree is a connected graph without cycles, providing a fundamental model for branching structures, hierarchical organization, and minimally connected networks.

tree-graph
Truth Table

A truth table lists the truth values of a logical expression for every possible assignment of values to its variables.

truth-table
Tuple

A tuple is an ordered collection of entries, distinguished by their positions, that provides a basic representation of coordinates, function inputs, relations, and structured data.

tuple
Type Theory

Type theory studies formal systems that classify expressions by types, connecting mathematical foundations, logic, computation, and machine-checked proofs.

type-theory
Uncountable Set

An uncountable set is a set too large to have its elements listed in a sequence indexed by the natural numbers.

uncountable-set
Undecidability

Undecidability is the impossibility of solving a precisely specified decision problem by an algorithm that always terminates with the correct answer.

undecidability
Venn Diagram

A Venn diagram represents every possible combination of membership in a collection of sets through overlapping enclosed regions.

venn-diagram
Walter Pitts

Walter Pitts was an American logician whose work with Warren McCulloch established foundational mathematical models of neural computation.

walter-pitts
Well-order

A well-order is a total order in which every nonempty subset has a least element, providing the foundation for ordinal numbers and transfinite methods.

well-order
Well-Ordering Theorem

The well-ordering theorem states that every set admits a total order in which every nonempty subset has a least element; over ZF set theory, it is equivalent to the axiom of choice.

well-ordering-theorem
Zermelo–Fraenkel Set Theory

Zermelo–Fraenkel set theory is a first-order axiomatic framework for sets that provides a foundation for much of mathematics.

zermelo-fraenkel-set-theory
Zorn's Lemma

Zorn's lemma is a maximal-element principle for partially ordered sets, equivalent to the axiom of choice and widely used in existence proofs.

zorns-lemma