Definitions
1. Knowledge System
Let a knowledge system K be an ordered pair:
K = ⟨A, ℝ⟩
where:
- A = {A₁, A₂, …, Aₘ} is a set of axioms
- ℝ is a set of inference rules
2. Derivability
A proposition P ∈ K is derivable if there exists a finite sequence of applications of ℝ to A that produces P:
P = f(A, ℝ)
3. Internal Demonstrability
An axiom A_j ∈ A is internally demonstrable if it can be derived within K using only the other axioms:
A_j = f(A ∖ {A_j}, ℝ)
Theorem
In any consistent, non-trivial knowledge system K = ⟨A, ℝ⟩, there exists at least one axiom A_j ∈ A that is indemonstrable within K (i.e., cannot be derived from the remaining axioms using ℝ).
Proof
Proof by contradiction:
- Assumption: Suppose all axioms are internally demonstrable. That is:∀A_j ∈ A, A_j = f(A ∖ {A_j}, ℝ)
- Iterative Elimination: If every axiom can be derived from the others, we can systematically eliminate axioms:
- Remove A₁ (derivable from {A₂, …, Aₘ})
- Remove A₂ (derivable from {A₃, …, Aₘ})
- Continue until A = ∅
- Contradiction: An empty axiom set A = ∅ cannot derive any non-trivial propositions, contradicting our assumption that K is non-trivial.
- Alternative Analysis – Circularity: If we cannot reduce to the empty set, then axioms must depend on each other in a circular chain:A₁ depends on A₂, A₂ depends on A₃, …, Aₘ depends on A₁
Such circular dependency provides no ultimate foundation and either:
- Leads to logical contradiction (if the system has non-trivial content)
- Makes the system trivial (everything becomes derivable from everything)
- Conclusion: Our initial assumption must be false.
Therefore:
∃A_j ∈ A such that A_j is not derivable from A ∖ {A_j}
This axiom is indemonstrable within the system K.
Implications
1. Foundational Necessity
Every formal system must “start somewhere.” There must be at least one proposition that is assumed without internal proof.
2. Relationship to Axiomatic Independence
This proof establishes that every consistent knowledge system contains at least one independent axiom – one that cannot be eliminated without loss of expressive power.
3. Distinction from Gödel’s Incompleteness
This result is distinct from Gödel’s theorems:
- This proof: Axioms (by necessity) cannot be proven within the system
- Gödel’s theorems: Some true propositions cannot be proven within sufficiently complex systems
4. Epistemological Consequence
All knowledge systems rest ultimately on unproven assumptions. The choice of axioms determines what can be known within that system.
Corollary
Minimal Axiomatization: Any knowledge system can be reduced to a minimal set A’ ⊆ A where every axiom in A’ is indemonstrable from the others. This A’ forms the irreducible foundation of K.
This proof demonstrates that the quest for absolute, self-justifying knowledge within any formal system is logically impossible. Every system of thought requires a leap of faith in its foundational assumptions.