One-and-a-halfth-order Logic

The practice of first-order logic is replete with meta-level concepts. Most notably there are meta-variables ranging over formulae, variables, and terms, and properties of syntax such as alpha-equivalence, capture-avoiding substitution and assumptions about freshness of variables with respect to meta-variables. We present one-and-a-halfth-order logic, in which these concepts are made explicit. We exhibit both sequent and algebraic specifications of one-and-a-halfth-order logic derivability, show them equivalent, show that the derivations satisfy cut-elimination, and prove correctness of an interpretation of first-order logic within it. We discuss the technicalities in a wider context as a case-study for nominal algebra, as a logic in its own right, as an algebraisation of logic, as an example of how other systems might be treated, and also as a theoretical foundation for future implementation.

[1]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[2]  J. Benthem,et al.  Higher-Order Logic , 2001 .

[3]  Murdoch James Gabbay,et al.  A Formal Calculus for Informal Equality with Binding , 2007, WoLLIC.

[4]  Maribel Fernández,et al.  Nominal rewriting , 2007, Inf. Comput..

[5]  Frank Pfenning,et al.  Higher-order abstract syntax , 1988, PLDI '88.

[6]  M. Nivat Fiftieth volume of theoretical computer science , 1988 .

[7]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[8]  Christian Urban,et al.  Nominal unification , 2004, Theor. Comput. Sci..

[9]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

[10]  Murdoch James Gabbay,et al.  Capture-avoiding substitution as a nominal algebra , 2007, Formal Aspects of Computing.

[11]  Larry Wos,et al.  Short Single Axioms for Boolean Algebra , 2002, Journal of Automated Reasoning.

[12]  Lawrence C. Paulson,et al.  Isabelle: The Next 700 Theorem Provers , 2000, ArXiv.

[13]  Lawrence C. Paulson,et al.  The foundation of a generic theorem prover , 1989, Journal of Automated Reasoning.

[14]  Charles C. Pinter A simple algebra of first order logic , 1973, Notre Dame J. Formal Log..

[15]  N Brunner 75 YEARS OF INDEPENDENCE PROOFS BY FRAENKEL-MOSTOWSKI PERMUTATION MODELS. , 1996 .

[16]  Stewart Shapiro Systems between First-Order and Second-Order Logics , 2001 .

[17]  Murdoch James Gabbay,et al.  Hierarchical Nominal Terms and Their Theory of Rewriting , 2007, LFMTP@FLoC.

[18]  Murdoch James Gabbay,et al.  The lambda-context Calculus , 2007, LFMTP@CADE.

[19]  Marino Miculan,et al.  Developing (Meta)Theory of λ-calculus in the Theory of Contexts1 1Work partially supported by Italian MURST project tosca and EC-WG types. , 2001 .

[20]  Andrei Voronkov,et al.  Equality Reasoning in Sequent-Based Calculi , 2001, Handbook of Automated Reasoning.

[21]  W. Hodges Elementary Predicate Logic , 1983 .

[22]  Jon Barwise,et al.  An Introduction to First-Order Logic , 1977 .

[23]  Christine Paulin-Mohring,et al.  The Coq Proof Assistant A Tutorial , 2005 .

[24]  Dov M. Gabbay,et al.  Naming Worlds in Modal and Temporal Logic , 2002, J. Log. Lang. Inf..

[25]  Claude Kirchner,et al.  Binding Logic: Proofs and Models , 2002, LPAR.

[26]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[27]  Bruno Courcelle,et al.  On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic , 1996, Descriptive Complexity and Finite Models.