Proof by contradiction is a mathematical method where you assume the opposite of what you want to prove, and then show that this assumption leads to a contradiction, thereby proving the original statement. This technique is particularly useful when direct proof is difficult or when dealing with statements involving negations or inequalities.
Formal logic is a system of reasoning that uses structured and symbolic representation to deduce the validity of arguments. It provides a framework for distinguishing between valid and invalid reasoning through rules and principles that are universally applicable across different contexts.
A mathematical proof is a logical argument that establishes the truth of a mathematical statement beyond any doubt by using a sequence of deductive reasoning steps based on axioms, definitions, and previously established theorems. The rigor and structure of a proof ensure that the conclusion follows necessarily from the premises, making it a cornerstone of mathematical validity and understanding.