Rigorous (original) (raw)
TOPICS
Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics Foundations of Mathematics Geometry History and Terminology Number Theory Probability and Statistics Recreational Mathematics Topology
Alphabetical Index New in MathWorld
A proof or demonstration is said to be rigorous if the validity of each step and the connections between the steps is explicitly made clear in such a way that the result follows with certainty. "Rigorous" proofs often rely on the postulates and results of formal systems that are themselves considered rigorous under stated conditions.
See also
Conclusion, Conjecture,Experimental Mathematics, Proof
Explore with Wolfram|Alpha
More things to try:
- 3-state, 4-color Turing machine rule 8460623198949736
- cos x
- linear independence of {(1,3,-1), (-1,-5,5), (4,7,h)}
Cite this as:
Weisstein, Eric W. "Rigorous." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Rigorous.html