Equivalences between logics and their representing type theories

We propose a new framework for representing logics, called LF and based on the Edinburgh Logical Framework. The new framework allows us to give, apparently for the first time, general definitions which capture how well a logic has been represented. These definitions are possible since we are able to distinguish in a generic way that part of the LF entailment which corresponds to the underlying logic. This distinction does not seem to be possible with other frameworks. Using our definitions, we show that, for example, natural deduction first-order logic can be well-represented in LF, whereas linear and relevant logics cannot. We also show that our syntactic definitions of representation have a simple formulation as indexed isomorphisms, which both confirms that our approach is a natural one and provides a link between type-theoretic and categorical approaches to frameworks.

[1]  Philippa Gardner,et al.  A New Type Theory for Representing Logics , 1993, LPAR.

[2]  Anne Salvesen The church-rosser property for pure type systems with |?|?-reduction , 1991 .

[3]  F. Dick A survey of the project Automath , 1980 .

[4]  H. Geuvers The Church-Rosser property for βη-reduction in typed λ-calculi , 1992, LICS 1992.

[5]  D. Prawitz Natural Deduction: A Proof-Theoretical Study , 1965 .

[6]  S MacLane Applications of categorical algebra , 1985 .

[7]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[8]  Jean Benabou,et al.  Fibered categories and the foundations of naive category theory , 1985, Journal of Symbolic Logic.

[9]  Robert Paré,et al.  Abstract families and the adjoint functor theorems , 1978 .

[10]  Arnon Avron,et al.  Simple Consequence Relations , 1988, Inf. Comput..

[11]  Lee Naish,et al.  Higher-order logic programming , 1996 .

[12]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[13]  William C. Frederick,et al.  A Combinatory Logic , 1995 .

[14]  Philippa Gardner,et al.  Representing logics in type theory , 1992 .

[15]  Robert Harper,et al.  Structure and representation in LF , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[16]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[17]  J. Michael Dunn,et al.  Relevance Logic and Entailment , 1986 .

[18]  P. Martin-Löf On the meanings of the logical constants and the justi cations of the logical laws , 1996 .

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

[20]  Alex Simpson Kripke Semantics for a Logical Framework , 1993 .

[21]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[22]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[23]  M. Gordon HOL: A Proof Generating System for Higher-Order Logic , 1988 .

[24]  Peter Aczel Schematic consequence , 1994 .

[25]  P. Dangerfield Logic , 1996, Aristotle and the Stoics.

[26]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[27]  Alexander Simpson Workshop on Types for Proofs and Programs , 1993 .