Search Results for ""

A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...

Lauricella functions are generalizations of the Gauss hypergeometric functions to multiple variables. Four such generalizations were investigated by Lauricella (1893), and ...

A linear equation is an algebraic equation of the form y=mx+b involving only a constant and a first-order (linear) term, where m is the slope and b is the y-intercept. The ...

The sequence composed of 1s and 2s obtained by starting with the number 1, and picking subsequent elements to avoid repeating the longest possible substring. The first few ...

A list is a data structure consisting of an ordered set of elements, each of which may be a number, another list, etc. A list is usually denoted (a_1, a_2, ..., a_n) or ...

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...

The longest increasing (contiguous) subsequence of a given sequence is the subsequence of increasing terms containing the largest number of elements. For example, the longest ...

Throughout abstract algebra, the term "magma" is most often used as a synonym of the more antiquated term "groupoid," referring to a set equipped with a binary operator. The ...

Let there be three polynomials a(x), b(x), and c(x) with no common factors such that a(x)+b(x)=c(x). Then the number of distinct roots of the three polynomials is one or more ...

A function f:X->R is measurable if, for every real number a, the set {x in X:f(x)>a} is measurable. When X=R with Lebesgue measure, or more generally any Borel measure, then ...