Editing Proof Theory (section)

== <span style="color: #FFFFFF;">Understanding</span> ==
Proof Theory is the study of the '''Grammar of Truth'''.

'''1. Proofs as Objects''':
In proof theory, a "Proof" is not just an argument; it is a '''Data Structure''' (usually a Tree). The roots are the '''Axioms''', and each branch is an '''Inference Rule'''. By analyzing the "Shape" of this tree, we can understand the complexity of the math.

'''2. Cut-Elimination (The "Magic" of Simplification)''':
Mathematicians often use "Lemmas"—small proofs used as shortcuts for a larger proof. This is called a "Cut." Gerhard Gentzen proved that you can always rewrite a proof to remove these shortcuts, creating a "Direct" proof. This is the foundation of '''Automated Reasoning'''; it tells a computer that it doesn't need to "guess" shortcuts to find the truth.

'''3. Constructivism vs. Classicalism''':
* '''Classical''': If I prove that "It is impossible for there to be no $X$," then $X$ must exist. (Proof by Contradiction).
* '''Constructive''': I only believe $X$ exists if you give me the coordinates to find it.
Proof theory studies the difference between these two "Levels" of truth. Constructive proofs are much more valuable for computer science because they provide an '''Algorithm'''.

'''The Curry-Howard Correspondence''': This is one of the most beautiful ideas in logic. It states that a "Proof" of a mathematical theorem is exactly the same thing as a "Program" that performs a specific task.
* A '''Theorem''' is like a '''Type Definition'''.
* A '''Proof''' is like the '''Source Code'''.
This is why modern software (like for flight controls) is often "Proven" to be correct rather than just "Tested."
</div>

<div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">