David Silberstein wrote: > As I understand it, Goedel's Proof of Incompleteness has > deeper ramifications than just mathematical systems. As I > recall, other famously proofs of unknowability, eg., Turing's > Halting Problem are just mappings of Goedel's Proof onto > other systems. Yes. The way I learned it, any system complex enough to contain simple arithmetic can be (at best) either complete (all things that are true are provable) or correct (all things provable are true) but not both.