Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

constructive proof

You are here: irt.org | FOLDOC | constructive proof

<mathematics> A proof that something exists that provides an example or a method for actually constructing it.

For example, for any pair of finite real numbers n < 0 and p > 0, there exists a real number 0 < k < 1 such that

	f(k) = (1-k)*n + k*p = 0.

A constructive proof would proceed by rearranging the above to derive an equation for k:

	k = 1/(1-n/p)

From this and the constraints on n and p, we can show that 0 < k < 1.

A few mathematicians actually reject *all* non-constructive arguments as invalid; this means, for instance, that the law of the excluded middle (either P or not-P must hold, whatever P is) has to go; this makes proof by contradiction invalid. See intuitionistic logic.

Constructive proofs are popular in theoretical computer science, both because computer scientists are less given to abstraction than mathematicians and because intuitionistic logic turns out to be an appropriate theoretical treatment of the foundations of computer science.


Nearby terms: constraint satisfaction « constructed type « Constructive Cost Model « constructive proof » constructive solid geometry » constructor » Consul

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb