Strong Types for Direct Logic

Abstract : This article follows on the introductory article “Direct Logic for Intelligent Applications” [Hewitt 2017a]. Strong Types enable new mathematical theorems to be proved including the Formal Consistency of Mathematics. Also, Strong Types are extremely important in Direct Logic because they block all know paradoxes[Cantini and Bruni 2017]. Blocking known paradoxes makes Direct Logic safer for use in Intelligent Applications by preventing security holes. Inconsistency Robustness is performance of information systems with pervasively inconsistent information. Inconsistency Robustness of the community of professional mathematicians is their performance repeatedly repairing contradictions over the centuries. In the Inconsistency Robustness paradigm, deriving contradictions has been a progressive development and not “game stoppers.” Contradictions can be helpful instead of being something to be “swept under the rug” by denying their existence, which has been repeatedly attempted by authoritarian theoreticians (beginning with some Pythagoreans). Such denial has delayed mathematical development. This article reports how considerations of Inconsistency Robustness have recently influenced the foundations of mathematics for Computer Science continuing a tradition developing the sociological basis for foundations. Mathematics here means the common foundation of all classical mathematical theories from Euclid to the mathematics used to prove Fermat's Last [McLarty 2010]. Good evidence for the consistency Classical Direct Logic derives from how it blocks the known paradoxes of classical mathematics. Humans have spent millennia devising paradoxes for classical mathematics. Having a powerful system like Direct Logic is important in computer science because computers must be able to formalize all logical inferences (including inferences about their own inference processes) without requiring recourse to human intervention. Any inconsistency in Classical Direct Logic would be a potential security hole because it could be used to cause computer systems to adopt invalid conclusions.
Type de document :
Communication dans un congrès
Symposium on Logic and Collaboration for Intelligent Applications, Mar 2017, Stanford, United States. College Publications, Symposium on Logic and Collaboration for Intelligent Applications, 52, Inconsistency Robustness, 2nd Ed. 〈https://cmt3.research.microsoft.com/LIA2017/〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01566393
Contributeur : Carl Hewitt <>
Soumis le : mercredi 17 octobre 2018 - 18:04:50
Dernière modification le : samedi 27 octobre 2018 - 01:02:11

Fichier

strong types--394.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Copyright (Tous droits réservés)

Identifiants

  • HAL Id : hal-01566393, version 14

Collections

Citation

Carl Hewitt. Strong Types for Direct Logic. Symposium on Logic and Collaboration for Intelligent Applications, Mar 2017, Stanford, United States. College Publications, Symposium on Logic and Collaboration for Intelligent Applications, 52, Inconsistency Robustness, 2nd Ed. 〈https://cmt3.research.microsoft.com/LIA2017/〉. 〈hal-01566393v14〉

Partager

Métriques

Consultations de la notice

11

Téléchargements de fichiers

7