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 (33 total)
alternate case: Interpolation theorem
Craig interpolation
(1,037 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 theoremCraig's theorem (679 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, WilliamWilliam Craig (philosopher) (193 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 NovemberMarcel Riesz (1,310 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 byPolynomial interpolation (9,027 words) [view diff] no match in snippet view article find links to article
In numerical analysis, polynomial interpolation is the interpolation of a given data set by the polynomial of lowest possible degree that passes throughRoger 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 factoredR. R. Rockingham Gill (251 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. 2Closed graph theorem (functional analysis) (2,719 words) [view diff] exact match in snippet view article
1/p+1/p'=1} . This result is usually proved using the Riesz–Thorin interpolation theorem and is highly nontrivial. The closed graph theorem can be used toProof theory (2,669 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-eliminationArnold Oberschelp (704 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/2269873Boris 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, ppMeier 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 functionsIndependence-friendly logic (7,126 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 ,\psiConvergence of Fourier series (4,071 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. If the partialShamir's secret sharing (4,345 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 polynomialMultiplier (Fourier analysis) (2,817 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, ppList of theorems (6,296 words) [view diff] exact match in snippet view article find links to article
(mathematical logic) Craig's theorem (mathematical logic) Craig's interpolation theorem (mathematical logic) Cut-elimination theorem (proof theory) DeductionDependence logic (4,500 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 logicLeon Henkin (10,254 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)Glossary of logic (30,237 words) [view diff] exact match in snippet view article find links to article
allowing for distinctions not permissible in classical logic. interpolation theorem A result stating that if a formula A → B {\displaystyle A\rightarrow