![]()
vol 2: Synopsis part IV: Divine dynamics Page 26: Kurt Goedel
Site map
1: About
Next: page 27: Turing
|
This site is part of the natural religion project The natural religion project A new theology A commentary on the Summa The theology company
Kurt Goedel(1906 - 1978) For thousands of years people equated consistency with determinism, holding that a logically consistent sequence of propositions could have only one outcome. This feeling lies behind the notion that God knows and controls everything. Kurt Goedel, working on a question asked by David Hilbert, showed that consistency does not always mean determinism. Goedel's discovery is consistent with the probabilistic nature of quantum mechanics, and indeed of all processes in the universe. One of Aristotle's greatest contributions to our culture was the invention and application of logic to the construction of knowledge. The medieval theologians and philosophers relied as heavily on Aristotle's logic as on his physics and metaphysics. In the twelfth century, Peter Abelard (1079-1142) realized the advantage of refining all problems down to yes/no questions. In the seventeenth century Leibniz (1646-1716) dreamt of a universal logical calculus, but the modern period in logic did not develop until the nineteenth century when George Boole (1815-1864) and others founded mathematical logic. Logic is about proof. A proof is a linguistic structure which establishes that if statement A is true, then statement B is true. Mathematical proof has been existence since the beginning of recorded history. Two classic proofs are that of Pythagoras' theorem, (proposition 47 in Book I of Euclid's Elements) and the proof for the existence of irrational numbers that follows from Pythagoras' theorem. Proofs are held together by rules of inference, which allow us to decide whether or not a certain statement follows from other statements. A good proof establishes 'logical continuity' between elements of a set of statements. By 1928 Hilbert was able to encapsulate his thoughts on the nature of mathematics in three questions: Is mathematics consistent? A system is consistent if no contradictory statements can be proved within it. Is mathematics complete? That is, can every valid mathematical statement be either proved or disproved? Is mathematics computable? Is there a definite process that will yield every mathematical proof? Hilbert felt that the answer to all three questions would be yes, proving that there were no limits to mathematics. He was to claim in 1930 that there is no such thing as an unsolvable problem. Goedel showed that if arithmetic (and by extension, mathematics) is consistent, it is incomplete. There are statements that can be neither proved nor disproved. In other words, in any system of a certain size, the domain of possible statements is larger than the domain of provable statements. If we assume that the only statements that are determined in such a system are those that are provable, this is equivalent to saying that every such system has an non-determinate halo of valid statements. Before Goedel proved that arithmetic in incomplete, he proved that propositional calculus is complete. There exists a determinate process (like the application of truth tables) by which one can decide whether any statement in propositional calculus is true or false. This difference between propositional calculus and arithmetic serves as a model of the divide between deterministic and nondeterministic processes in the universe. Our hypothesis is that the universe is at least as big as arithmetic, so that it is affected by incompleteness. This is consistent with the idea that there are elements of the future that are not determined by the present, and so can not be foretold. Goedel's incompleteness theorem, like Cantor's theorem, tells us that the future is bigger than the past and not fully constrained by it. If we model such a system as a probability space, we can attribute certainty (probability 1) to the provable statements, and probabilities less than one to statements that cannot be proved or disproved. This sets the stage for the understanding the role of probability in quantum mechanics. Incompleteness also opens the door for evolution by selection, since the existence of a certain statement may be established not by its logical necessity, but by its utility in the overall scheme of things. Finally, incompleteness opens the door to the distinction between hardware and software. The essence of good hardware is not to determine particular states from the set of possible states of the software. The software, in other words, is free to do what it must without interference from the hardware. This reminds us of the idea of orthogonality which is very important in quantum mechanics. Books
|
Click on an "Amazon" link in the booklist at the foot of the page to buy the book, see more details or search for similar items
Related sites:
Concordat Watch Revealing Vatican attempts to propagate its religion by international treaty Copyright: You may copy this material freely provided only that you quote fairly and provide a link (or reference) to your source.
|
next: page 27: Turing previous: page 25: God |