Math by Proof: What is it, and why should we?
Library Home || Full Table of Contents || Library Help
|Formalised mathematics is distinguished from informal mathematics by three features: machine processable languages with precisely defined semantics in which mathematical propositions are expressed; machine checkable reliable criteria for demonstrating the truth of mathematical propositions; machine checkable criteria permitting the introduction of new meaningful formal vocabulary without compromising the consistency of the logical system. These methods are potentially applicable not just in those areas of mathematics where discovering and proving new mathematical results is the central purpose, but in all aspects of mathematics whether or not they are normally associated with proof.|
|Levels:||High School (9-12), College|
|Math Topics:||Logic/Foundations, Philosophy|
© 1994- The Math Forum at NCTM. All rights reserved.