3 ms·
Axioms can be used in proofs, and they are not provable. If a proposition is not provable, yet raises no issues if regarded as true, then it can be added as an
by kazinator 6y ago
Axioms can be used in proofs, and they are not provable.
If a proposition is not provable, yet raises no issues if regarded as true, then it can be added as an axiom and used in theorems.
- ProfHewitt 6y agoIt turns out that for powerful theories of Computer Science, there must exist infinitely many propositions that are inferentially undecidable, that is, can be neither proved nor disproved. However, the propositions cannot be specified constructively and so are not very interesting. Currently, there seem to be no propositions interesting to practical Computer Science that are provably inferentially undecidable.