Abstract
Although, formally, mathematics is clear that a function is
a single-valued object, mathematical practice is looser, particularly with n-th roots and various inverse functions. In this paper, we point out some
of the looseness, and ask what the implications are, both for Artifcial Intelligence and Symbolic Computation, of these practices. In doing so, we look at the steps necessary to convert existing texts into (a) rigorous statements (b) rigorously proved statements.
In particular we ask whether there might be a constant "de Bruijn factor" [18] as we make these texts more formal, and conclude that the answer
depends greatly on the interpretation being placed on the symbols.
| Original language | English |
|---|---|
| Pages (from-to) | 1-12 |
| Number of pages | 12 |
| Journal | Lecture Notes in Computer Science |
| Volume | 6167 |
| DOIs | |
| Publication status | Published - Jul 2010 |
Bibliographical note
Invited talk at Artificial Intelligence and Symbolic Computation 2010, part of the Conferences in Intelligent Mathematics 2010, 4-10 July 2010. Paris, France.Fingerprint
Dive into the research topics of 'The Challenges of Multivalued "Functions"'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS