Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Sarason interpolation theorem (view), Marcinkiewicz interpolation theorem (view)

searching for Interpolation theorem 20 found (32 total)

Craig interpolation (1,054 words) [view diff] exact match in snippet view article find links to article

In mathematical logic, Craig's interpolation theorem is a result about the relationship between different logical theories. Roughly stated, the theorem

Craig's theorem (659 words) [view diff] exact match in snippet view article find links to article

axiomatizable. This result is not related to the well-known Craig interpolation theorem, although both results are named after the same logician, William

William Craig (philosopher) (192 words) [view diff] exact match in snippet view article

and the philosophy of science, and he is best known for the Craig interpolation theorem. William Craig was born in Nuremberg, Weimar Republic, on November

Marcel Riesz (1,295 words) [view diff] exact match in snippet view article find links to article

an interpolation theorem to show that the Hilbert transform is a bounded operator in Lp (1 < p < ∞). The generalisation of the interpolation theorem by

Polynomial interpolation (8,159 words) [view diff] no match in snippet view article find links to article

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes

Schwarz lemma (1,503 words) [view diff] case mismatch in snippet view article find links to article

the case that f{\displaystyle f} is univalent. Nevanlinna–Pick interpolation Theorem 5.34 in Rodriguez, Jane P. Gilman, Irwin Kra, Rubi E. (2007). Complex

R. R. Rockingham Gill (254 words) [view diff] case mismatch in snippet view article find links to article

the former head of the Department of Philosophy. The Craig-Lyndon Interpolation Theorem in 3-Valued Logic, The Journal of Symbolic Logic, Vol. 35, No. 2

Roger Lyndon (807 words) [view diff] exact match in snippet view article find links to article

continuous equivariant functions on shift spaces. The Craig–Lyndon interpolation theorem in formal logic states that every logical implication can be factored

Hardy–Littlewood maximal function (1,490 words) [view diff] exact match in snippet view article find links to article

strong-type estimate is an immediate consequence of the Marcinkiewicz interpolation theorem: Theorem (Strong Type Estimate). For d ≥ 1, 1 < p ≤ ∞, and f ∈ Lp(Rd)

Proof theory (2,637 words) [view diff] exact match in snippet view article find links to article

premise, which it is not. Gentzen's midsequent theorem, the Craig interpolation theorem, and Herbrand's theorem also follow as corollaries of the cut-elimination

Meier Eidelheit (752 words) [view diff] exact match in snippet view article find links to article

of Lwów Known for Eidelheit separation theorem (1936), Eidelheit interpolation theorem (1936), Eidelheit theorem concerning rings of continuous functions

Boris Mityagin (550 words) [view diff] exact match in snippet view article find links to article

spaces, Russian Mathematical Surveys, vol. 19, 1964, pp. 65–127 An interpolation theorem for modular spaces, Matematicheskii Sbornik, vol. 108, 1965, pp

Arnold Oberschelp (687 words) [view diff] case mismatch in snippet view article find links to article

S2CID 122569882. Arnold Oberschelp (June 1968). "On the Craig-Lyndon Interpolation Theorem". The Journal of Symbolic Logic. 33 (2): 271–274. doi:10.2307/2269873

Shamir's secret sharing (4,037 words) [view diff] exact match in snippet view article find links to article

formulated the scheme in 1979. The scheme exploits the Lagrange interpolation theorem, specifically that k{\displaystyle k} points on the polynomial uniquely

Convergence of Fourier series (3,456 words) [view diff] exact match in snippet view article find links to article

another proof, due to Salomon Bochner relies upon the Riesz–Thorin interpolation theorem. For p = 1 and infinity, the result is not true. The construction

Independence-friendly logic (6,900 words) [view diff] exact match in snippet view article find links to article

\psi \models ^{+}\lnot \theta }. This is a consequence of Craig's interpolation theorem for FOL. Burgess' theorem: if φ,ψ{\displaystyle \varphi ,\psi }

Multiplier (Fourier analysis) (2,702 words) [view diff] exact match in snippet view article

involving techniques from Calderón–Zygmund theory and the Marcinkiewicz interpolation theorem: for the original proof, see Mikhlin (1956) or Mikhlin (1965, pp

List of theorems (5,993 words) [view diff] exact match in snippet view article find links to article

theorem (probability) Craig's theorem (mathematical logic) Craig's interpolation theorem (mathematical logic) Cramér’s decomposition theorem (statistics)

Dependence logic (4,300 words) [view diff] exact match in snippet view article find links to article

Löwenheim–Skolem theorem are true for dependence logic. Craig's interpolation theorem also holds, but, due to the nature of negation in dependence logic

Leon Henkin (10,313 words) [view diff] exact match in snippet view article find links to article

New York. Henkin, L. (1963). An Extension of the Craig-Lyndon Interpolation theorem. The Journal of Symbolic Logic. 28(3), 201-216. Henkin, L. (1963)