Reasoning about partial functions with the aid of a computer

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 functionsin theory. However, the approach to partial functions traditionally employed by mathematicians is quite adequatein 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.

[1]  Dana S. Scott,et al.  Existence and Description in Formal Logic , 1973 .

[2]  Rolf Schock,et al.  Logics without existence assumptions , 1968 .

[3]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[4]  William M. Farmer,et al.  The IMPS User's Manual , 1995 .

[5]  Tyler Burge,et al.  Truth and Singular Terms , 1974 .

[6]  D. Scott.  Identity and existence in intuitionistic logic , 1979 .

[7]  Michael Kohlhase,et al.  A Mechanization of Strong Kleene Logic for Partial Functions , 1994, CADE.

[8]  I. L. Novak,et al.  A construction for consistent systems , 1950 .

[9]  William M. Farmer,et al.  A partial functions version of Church's simple theory of types , 1990, Journal of Symbolic Logic.

[10]  Timothy Smiley.  Sense Without Denotation , 1960 .

[11]  M. Beeson.  Formalizing constructive mathematics: Why and how? , 1981 .

[12]  Karel Lambert.  Philosophical applications of free logic , 1991 .

[13]  Robert L. Constable,et al.  Partial functions in constructive formal theories , 1983, Theoretical Computer Science.

[14]  Hao Wang,et al.  Non-Standard Models for Formal Logics , 1950, J. Symb. Log..

[15]  Henry S. Leonard,et al.  The logic of existence , 1956 .

[16]  Joseph R. Shoenfield,et al.  A relative consistency proof , 1954, Journal of Symbolic Logic.

[17]  Cliff B. Jones,et al.  On the Usability of Logics which Handle Partial Functions , 1991 .

[18]  Richard J. K. Taylor.  Ayer's analysis of negation , 1953 .

[19]  Jan Kuper,et al.  An Axiomatic Theory for Partial Functions , 1993, Inf. Comput..

[20]  Nicholas Rescher.  On the Logic of Existence and Denotation , 1959 .

[21]  William M. Farmer,et al.  Context in Mathematical Reasoning and Computation , 1995, J. Symb. Comput..

[22]  Hugues Leblanc,et al.  Nondesignating singular terms , 1959 .

[23]  K. Gödel.  The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis. , 1938, Proceedings of the National Academy of Sciences of the United States of America.

[24]  William M. Farmer,et al.  A Simple Type Theory with Partial Functions and Subtypes , 1993, Ann. Pure Appl. Log..

[25]  Robert L. Constable,et al.  Partial Objects In Constructive Type Theory , 1987, Logic in Computer Science.

[26]  David Lorge Parnas,et al.  Predicate Logic for Software Engineering , 1993, IEEE Trans. Software Eng..

[27]  Antonio Gavilanes-Franco,et al.  A First Order Logic for Partial Functions , 1990, Theor. Comput. Sci..

[28]  Jaako Hintikka,et al.  Existential Presuppositions and Existential Commitments , 1959 .

[29]  François Lepage.  Partial Functions in Type Theory , 1992, Notre Dame J. Formal Log..

[30]  Karel Lambert,et al.  Existential import revisited , 1963, Notre Dame J. Formal Log..

[31]  Elliott Mendelson,et al.  Introduction to Mathematical Logic , 1979 .

[32]  M. Beeson.  Foundations of Constructive Mathematics , 1985 .

[33]  Th. Skolem,et al.  A Construction for Models of Consistent Systems. , 1951 .

[34]  William M. Farmer,et al.  Theory Interpretation in Simple Type Theory , 1993, HOA.