Search Results for ""
61 - 70 of 3238 for Goedels Second Incompleteness TheoremSearch Results
Polynomials b_n(x) which form a Sheffer sequence with g(t) = t/(e^t-1) (1) f(t) = e^t-1, (2) giving generating function sum_(k=0)^infty(b_k(x))/(k!)t^k=(t(t+1)^x)/(ln(1+t)). ...
A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...
A number defined by b_n=b_n(0), where b_n(x) is a Bernoulli polynomial of the second kind (Roman 1984, p. 294), also called Cauchy numbers of the first kind. The first few ...
11 21 8 61 22 58 241 52 328 444 1201 114 1452 4400 3708 7201 240 5610 32120 58140 33984 5040 (1) The second-order Eulerian triangle (OEIS A008517) is the number triangle ...
The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...
A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...
Let A_(k,i)(n) denote the number of partitions into n parts not congruent to 0, i, or -i (mod 2k+1). Let B_(k,i)(n) denote the number of partitions of n wherein 1. 1 appears ...
A modified spherical Bessel function of the second kind, also called a "spherical modified Bessel function of the first kind" (Arfken 1985) or (regrettably) a "modified ...
Given two univariate polynomials of the same order whose first p coefficients (but not the first p-1) are 0 where the coefficients of the second approach the corresponding ...
If T is a set of axioms in a first-order language, and a statement p holds for any structure M satisfying T, then p can be formally deduced from T in some appropriately ...
...
View search results from all Wolfram sites (34525 matches)

