Equivalence, recursive negation and invariance of the mathematical uncertainty predicate
AbstractIt 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Universita' degli Studi di Firenze, Dipartimento di Scienze per l'Economia e l'Impresa in its series Working Papers - Mathematical Economics with number 2009-07.
Date of creation: Oct 2009
Date of revision:
formalism; intuitionism; uncertainty;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-11-14 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.