contrapositive
31Supertask — In philosophy, a supertask is a task occurring within a finite interval of time involving infinitely many steps (subtasks). A hypertask is a supertask with an uncountable number of subtasks. The term supertask was coined by the philosopher James… …
32List of basic discrete mathematics topics — Discrete mathematics, also called finite mathematics, is the study of mathematical structures that are fundamentally , in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite… …
33Deduction theorem — In mathematical logic, the deduction theorem is a metatheorem of first order logic.[1] It is a formalization of the common proof technique in which an implication A → B is proved by assuming A and then proving B from this assumption.… …
34Euclidean minimum spanning tree — The Euclidean minimum spanning tree or EMST is a minimum spanning tree of a set of points in the plane (or more generally in Bbb{R}^n), where the weight of the edge between each pair of points is the distance between those two points. In simpler… …
35Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected …
36Gauss's lemma (polynomial) — This article is about Gauss s lemma for polynomials. See also Gauss s lemma. In algebra, in the theory of polynomials, Gauss s lemma, named after Carl Friedrich Gauss, is either of two related statements about polynomials with integral… …
37HNN extension — In mathematics, the HNN extension is a basic construction of combinatorial group theory.Introduced in a 1949 paper Embedding Theorems for Groups [ cite journal|title=Embedding Theorems for Groups|journal=Jornal of the London Mathematical… …
38Additive identity — In mathematics the additive identity of a set which is equipped with the operation of addition is an element which, when added to any element x in the set, yields x . One of the most familiar additive identities is the number 0 from elementary… …
39Weighted matroid — In combinatorics, a branch of mathematics, a weighted matroid is a matroid endowed with function with respect to which one can perform a greedy algorithm.There is a simple algorithm for finding a basis:* Let A be the empty set. * For each x in E… …
40ThinkUKnow — Infobox Website name = ThinkUKnow url = http://www.thinkuknow.co.uk/ caption = The ThinkUKnow homepage, with links to the main sections of the website and tabs linking to other related websites. commercial = No type = Government registration = No …
