Definition
In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object by creating or providing a method for creating the object. This is in contrast to a non-constructive proof, which proves the existence of a particular kind of object without providing an example. For avoiding confusion with the stronger concept that follows, such a constructive proof is sometimes called an effective proof.
Related concepts
AlgorithmAn Introduction to the Theory of NumbersAnne Sjerp TroelstraAxiom of choiceAxiom of infinityBrouwer–Heyting–Kolmogorov interpretationCalculus of constructionsCauchy sequenceComplex numberConstructive logicConstructive mathematicsConstructive reverse mathematicsConstructive set theoryConstructivism (mathematics)Constructivism (philosophy of mathematics)CounterexampleCurry–Howard correspondenceDiaconescu's theoremDirk van DalenE. M. WrightErrett BishopEuclidEuclid's theoremExistence theoremForbidden minorsG.H. HardyGelfond–Schneider theoremGeorg CantorGoldbach's conjectureGraph (discrete mathematics)Graph minor theoremGrete HermannGérard HuetHilbert's NullstellensatzHilbert's basis theoremInfinite setIntuitionismIntuitionistic type theoryIrrational numberJ. Roger HindleyJames Franklin (philosopher)Law of excluded middleLaw of the excluded middleLimited principle of omniscienceLogarithmsMathematical objectMathematical proofMathematicsMinor (graph theory)Non-constructive algorithm existence proofsPaul GordanPer Martin-LöfPolynomialPrime numberPrinciple of explosionProbabilistic methodProof by contradictionRational numberReal numberScripta MathematicaSquare root of 2System of linear equationsThierry CoquandTorusZero of a function
12 concepts already in your glossary