Skip to content
Carmelics
Topics
Thinkers
Changes
Contributors
Loading account…
Statements
321,452
Perspectives
108,905
Topics
42
Home
/
Original
/
inverse
See Original
Inverse View
It is not the case that Formal deductive systems like Peano arithmetic generate theorems that their axioms do not explicitly contain, as Gödel's incompleteness results demonstrate.
?
Set your confidence on the premises below to see your aggregate.
Reasons For
1 perspective
Reason for
?
1.
Unprovable statements like the Gödel sentence are arguably *contained* in axioms as logical consequences, just not derivable by finite proof.
?
How convincing is this?
Think about whether this reason is strong or weak
2.
The incompleteness theorems address what's *provable*, not what's *contained*; containment is a semantic, not syntactic, property.
?
How convincing is this?
Think about whether this reason is strong or weak
3.
Even unprovable truths follow necessarily from axioms, so claiming they're 'not contained' conflates logical derivability with conceptual generation.
?
How convincing is this?
Think about whether this reason is strong or weak
Reasons Against
1 perspective
Reason against
?
1.
Gödel proved PA cannot prove all true statements about natural numbers, demonstrating genuine limits to axiomatic systems.
?
How convincing is this?
Think about whether this reason is strong or weak
2.
Theorems derived through valid inference rules represent knowledge not present in axioms alone, only implicit in their logical consequences.
?
How convincing is this?
Think about whether this reason is strong or weak
3.
The incompleteness theorems reveal that formal systems cannot be simultaneously complete, consistent, and effectively axiomatizable.
?
How convincing is this?
Think about whether this reason is strong or weak
Next step
Based on where you are in your exploration
Strongest counterpoint
Explore the most compelling reason on the other side.