## User login## Navigation |
## archives## Continuation of Discussion: "Mathematics self-proves its own Consistency (contra GÃ¶del et. al.)"DRUPL limitations truncated previous ongoing discussion. So I have re-posted here. BTW, I would like to thank LtU for previous discussion that was Some readers might be interested in the following abstract from Mathematics self-proves its own Consistency: Mathematics self-proves its own Consistency (contra GÃ¶del et. al.) Carl Hewitt http://carlhewitt.info That mathematics is thought to be consistent justifies the use of Proof by Contradiction. In addition, Proof by Contradiction can be used to infer the consistency of mathematics by the following simple proof: The self-proof is a proof by contradiction. Suppose to obtain a contradiction, that mathematics is inconsistent. Then there is some proposition Î¦ such that âŠ¢Î¦ and âŠ¢Â¬Î¦. Consequently, both Î¦ and Â¬Î¦ are theorems that can be used in the proof to produce an immediate contradiction. Therefore mathematics is consistent. The above theorem means that the assumption of consistency is deeply embedded in the structure of classical mathematics. The above proof of consistency is carried out in Direct Logic [Hewitt 2010] (a powerful inference system in which theories can reason about their own inferences). Having a powerful system like Direct Logic is important in computer science because computers must be able to carry out all inferences (including inferences about their own inference processes) without requiring recourse to human intervention. Self-proving consistency raises that possibility that mathematics could be inconsistent because of contradiction with the result of GÃ¶del et. al. that â€œif mathematics is consistent, then it cannot infer its own consistency.â€ The resolution is not to allow self-referential propositions that are used in the proof by GÃ¶del et. al. that mathematics cannot self-prove its own consistency. This restriction can be achieved by using type theory in the rules for propositions so that self-referential propositions cannot be constructed because fixed points do not exist. Fortunately, self-referential propositions do not seem to have any important practical applications. (There is a very weak theory called Provability Logic that has been used for self-referential propositions coded as integers, but it is not strong enough for the purposes of computer science.) It is important to note that disallowing self-referential propositions does not place restrictions on recursion in computation, e.g., the Actor Model, untyped lambda calculus, etc. The self-proof of consistency in this paper does not intuitively increase our confidence in the consistency of mathematics. In order to have an intuitively satisfactory proof of consistency, it may be necessary to use Inconsistency Robust Logic (which rules out the use of proof by contradiction, excluded middle, etc.). Existing proofs of consistency of substantial fragments of mathematics (e.g. [Gentzen 1936], etc.) are not Inconsistency Robust. A mathematical theory is an extension of mathematics whose proofs are computationally enumerable. For example, group theory is obtained by adding the axioms of groups to Direct Logic. If a mathematical theory T is consistent, then it is inferentially undecidable, i.e. there is a proposition Î¨ such that âŠ¬
The full paper is published at the following location: |
## Browse archives## Active forum topics- Looking for references on the expressiveness and computational completeness of a relational programming language
- Programming Languages as Mathematical Representations
- language handling of memory and other resource failures
- Whither FRP?
- Is there a language with the ability to write arbitrary type functions?
## New forum topics |

## Recent comments

3 hours 13 min ago

4 hours 21 min ago

4 hours 52 min ago

5 hours 1 sec ago

5 hours 22 min ago

5 hours 26 min ago

5 hours 34 min ago

9 hours 41 min ago

11 hours 26 min ago

12 hours 42 min ago