Relative Consistency Proof

Relative Consistency Proof Overview

A relative consistency proof establishes that the consistency of a mathematical system S implies the consistency of an extension of S by adding new axioms. This technique is fundamental for comparing the foundational strength of different theories without necessarily proving the absolute consistency of any single system.

Key Concepts

• Consistency: A system is consistent if it does not lead to contradictions.
• Axiom Extension: Adding new statements (axioms) to an existing system.
• Foundational Strength: The level of certainty or the minimal assumptions required for a theory’s consistency.

Deep Dive

The core idea is to show that if we assume system S is consistent, then a more complex system S’ (which includes S plus new axioms) is also consistent. This is often achieved by demonstrating that any contradiction derivable in S’ can be translated into a contradiction in S. If S is consistent, no contradiction can be derived, thus S’ must also be consistent.

Applications

These proofs are vital in mathematical logic and the foundations of mathematics. For example, they were used to show that systems like Peano Arithmetic (PA) are relatively consistent with Zermelo-Fraenkel set theory (ZF), implying that if ZF is consistent, then PA is also consistent.

Challenges & Misconceptions

A common misconception is that a relative consistency proof establishes absolute consistency. However, it only proves consistency relative to another system. If the base system is itself inconsistent, the proof offers no guarantee about the extension.

FAQs

Q: What is the main purpose of a relative consistency proof?
A: To compare the foundational strength of different mathematical theories by showing one’s consistency depends on another’s.