You are not currently logged in.
Access JSTOR through your library or other institution:
Reasoning about Partial Functions with the Aid of a Computer
William M. Farmer
Vol. 43, No. 3, Varia with a Workshop on the Foundations of Partial Functions and Programming (Nov., 1995), pp. 279-294
Published by: Springer
Stable URL: http://www.jstor.org/stable/20012659
Page Count: 16
You can always find the topics here!Topics: Mathematical functions, Mathematics, Reasoning, Predicate logic, Type theory, Mathematical set theory, Computer science, Mathematical logic, Mathematical formalism, Mechanical systems
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
Partial functions are ubiquitous in both mathematics and computer science. Therefore, it is imperative that the underlying logical formalism for a general-purpose mechanized mathematics system provide strong support for reasoning about partial functions. Unfortunately, the common logical formalisms -- first-order logic, type theory, and set theory -- are usually only adequate for reasoning about partial functions in theory. However, the approach to partial functions traditionally employed by mathematicians is quite adequate in practice. This paper shows how the traditional approach to partial functions can be formalized in a range of formalisms that includes first-order logic, simple type theory, and Von-Neumann-Bernays-Gödel set theory. It argues that these new formalisms allow one to directly reason about partial functions; are based on natural, well-understood, familiar principles; and can be effectively implemented in mechanized mathematics systems.
Erkenntnis (1975-) © 1995 Springer