- sketch of proof
- мат. набросок доказательства
Большой англо-русский и русско-английский словарь. 2001.
sketch of proof
Смотреть что такое "sketch of proof" в других словарях:
Proof of concept — is a short and/or incomplete realization (or ) of a certain method or idea(s) to demonstrate its feasibility, or a demonstration in principle, whose purpose is to verify that some concept or theory is probably capable of exploitation in a useful… … Wikipedia
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
proof — Synonyms and related words: Christophany, Ditto copy, Photostat, Satanophany, Xerox, Xerox copy, absolute indication, account, acid test, acquaintance, affirmation, airtight, ammunition, angelophany, announcement, appearance, argument, assay,… … Moby Thesaurus
Proof of the Euler product formula for the Riemann zeta function — We will prove that the following formula holds::egin{align} zeta(s) = 1+frac{1}{2^s}+frac{1}{3^s}+frac{1}{4^s}+frac{1}{5^s}+ cdots = prod {p} frac{1}{1 p^{ s end{align}where zeta; denotes the Riemann zeta function and the product extends over… … Wikipedia
Untitled Sketch — Infobox Dad s Army episode number episode name=Christmas Night With the Stars Insert: Untitled Sketch script=Jimmy Perry and David Croft director=David Croft producer=David Croft recorded=Sunday 27/10/68 original transmission=Wednesday 25/12/68… … Wikipedia
rough sketch — Synonyms and related words: acid test, assay, blank determination, brouillon, criterion, crucial test, crucible, determination, docimasy, essay, feeling out, first draft, kiteflying, ordeal, probation, proof, rough draft, sounding out, standard,… … Moby Thesaurus
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Consistency — For other uses, see Consistency (disambiguation). In logic, a consistent theory is one that does not contain a contradiction.[1] The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a … Wikipedia
Binomial series — In mathematics, the binomial series is the Taylor series at x = 0 of the function f given by f(x) = (1 + x) α, where α ∈ C is an arbitrary complex number. Explicitly, and the binomial series is the power series… … Wikipedia
Stinespring factorization theorem — In mathematics, Stinespring s dilation theorem, also called Stinespring s factorization theorem, is a result from operator theory that represents any completely positive map on a C* algebra as a composition of two completely positive maps each of … Wikipedia
Approximately finite dimensional C*-algebra — In C* algebras, an approximately finite dimensional, or AF, C* algebra is one that is the inductive limit of a sequence of finite dimensional C* algebras. Approximate finite dimensionality was first defined and described combinatorially by… … Wikipedia
