constructive+proof

См. также в других словарях:

• Constructive proof — In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object with certain properties by creating or providing a method for creating such an object. This is in contrast to a nonconstructive… …   Wikipedia

• constructive — A constructive proof is one that enables one to give an example, or give a rule for finding an example, of a mathematical object with some property. A nonconstructive proof might result in us knowing that an example exists, but having no idea how …   Philosophy dictionary

• Constructive set theory — is an approach to mathematical constructivism following the program of axiomatic set theory. That is, it uses the usual first order language of classical set theory, and although of course the logic is constructive, there is no explicit use of… …   Wikipedia

• Constructive analysis — In mathematics, constructive analysis is mathematical analysis done according to the principles of constructive mathematics. This contrasts with classical analysis, which (in this context) simply means analysis done according to the (ordinary)… …   Wikipedia

• Constructive dismissal — In employment law, constructive dismissal, also called constructive discharge, occurs when employees resign because their employer s behaviour has become so intolerable or heinous or made life so difficult that the employee has no choice but to… …   Wikipedia

• constructive notice — Not actual notice; such circumstances as the law deems the equivalent of actual notice since they are such as, under the law, put a party upon inquiry. 55 Am J1st V & P § 697. The substitute in law for actual notice, being based upon a… …   Ballentine's law dictionary

• Constructive dilemma — Rules of inference Propositional calculus Modus ponens (A→B, A ⊢ B) Modus tollens (A→B, ¬B ⊢ ¬A) …   Wikipedia

• Mathematical proof — In mathematics, a proof is a convincing demonstration (within the accepted standards of the field) that some mathematical statement is necessarily true.[1][2] Proofs are obtained from deductive reasoning, rather than from inductive or empirical… …   Wikipedia

• Bijective proof — In combinatorics, bijective proof is a proof technique that finds a bijective function f : A → B between two sets A and B , thus proving that they have the same number of elements, | A | = | B |. One place the technique is useful is where we wish …   Wikipedia

• Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… …   Wikipedia

• Gentzen's consistency proof — Gentzen s theoremIn 1936 Gerhard Gentzen proved the consistency of first order arithmetic using combinatorial methods. Gentzen s proof shows much more than merely that first order arithmetic is consistent. Gentzen showed that the consistency of… …   Wikipedia