Equivalence, recursive negation and invariance of the mathematical uncertainty predicate
It is impossible to prove the equivalence of double negation for the Systeme I of Godel. It is possible to deduce the equivalence of double negation with a three valued logic which is coherent with respect to symmetric implication and has the third value as invariant by negation. It is possible to annihilate the third value and switch back to the two valued boundary logic. Brouwer and Godel provide the foundation for the theory of uncertainty.
|Date of creation:||Oct 2009|
|Date of revision:|
|Contact details of provider:|| Postal: Via delle Pandette 9 50127 - Firenze - Italy|
Phone: +39 055 2759707
Fax: +39 055 2759913
Web page: http://www.disei.unifi.it/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:flo:wpaper:2009-07. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michele Gori)
If references are entirely missing, you can add them using this form.