A Foundation for Metareasoning Part I: The Proof Theory

We propose a framework, called OM pairs, for the formalization of metareasoning. OM pairs allow us to generate deductively pairs composed of an object theory and a metatheory related via a so called reflection principle. This is done by imposing, via appropriate reflection rules, the relation we want to hold between the object theory and the metatheory. In this paper we concentrate on the proof theory of OM pairs. We study them from various points of view: we compare the strength of the object theory and the metatheories generated by different combination of reflection rules; for each combination we characterize the object theory and metatheory, both axiomatically (when possible), and by means of fix-point equations. Finally we present four important case studies.

[1]  Harvey Abramson,et al.  Meta-programming in logic programming , 1989 .

[2]  Richard W. Weyhrauch,et al.  Prolegomena to a Theory of Mechanized Formal Reasoning , 1980, Artif. Intell..

[3]  Donald Perlis,et al.  On the consistency of commonsense reasoning , 1986, Comput. Intell..

[4]  Fausto Giunchiglia,et al.  A Metatheory of a Mechanized Object Theory , 1996, Artif. Intell..

[5]  John W. Lloyd,et al.  The Gödel programming language , 1994 .

[6]  Robert L. Constable,et al.  Metalogical frameworks , 1993 .

[7]  J. McCarthy,et al.  Formalizing Context (Expanded Notes) , 1994 .

[8]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[9]  Robert A. Kowalski,et al.  A Metalogic Programming Approach to Multi-Agent Knowledge and Belief , 1991, Artificial and Mathematical Theory of Computation.

[10]  Kenneth A. Bowen,et al.  A Meta-Level Extension of Prolog , 1985, SLP.

[11]  V. S. Subrahmanian.  A Simple Formulation of the Theory of Metalogic Programming , 1989, International Workshop on Meta-Programming in Logic.

[12]  LogicJonas BarklundBox.  Metaprogramming in Logic , 1994 .

[13]  Maria Simi,et al.  Reflections about Reflection , 1991, KR.

[14]  G. Boolos,et al.  Self-Reference and Modal Logic , 1985 .

[15]  J. Harrison.  Metatheory and Reflection in Theorem Proving: A Survey and Critique , 1995 .

[16]  Luca Spalazzi,et al.  METAFOL: Program tactics and logic tactics plus reflection , 1996, Future Gener. Comput. Syst..

[17]  Fausto Giunchiglia,et al.  Local Models Semantics, or Contextual Reasoning = Locality + Compatibility , 1998, KR.

[18]  Alfred Tarski,et al.  Der Wahrheitsbegriff in den formalisierten Sprachen , 1935 .

[19]  Fausto Giunchiglia,et al.  Reflection in Constructive and Non-constructive Automated Reasoning , 1988, META.

[20]  V. S. Subrahmanian,et al.  Meta-languages, reflection principles, and self-reference , 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

[21]  Margus Veanes,et al.  Meta-programming with theory systems , 1995 .

[22]  Donald Perlis,et al.  Languages with Self-Reference II: Knowledge, Belief, and Modality , 1988, Artif. Intell..

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

[24]  Antonio Brogi,et al.  Meta-logic for program composition: semantics issues , 1995 .

[25]  Solomon Feferman,et al.  Transfinite recursive progressions of axiomatic theories , 1962, Journal of Symbolic Logic.

[26]  P. M. Hill,et al.  Meta-Programming in Logic Progamming , 1998 .

[27]  Danny De Schreye,et al.  Two semantics for definite meta-programs, using the non-ground representation , 1995 .

[28]  Fausto Giunchiglia,et al.  ML Systems: A Proof Theory for Contexts , 2002, J. Log. Lang. Inf..

[29]  Fausto Giunchiglia,et al.  Multilanguage hierarchical logics (or: how we can do without modal logics) , 1994, CNKBS.

[30]  Robert A. Kowalski,et al.  Amalgamating language and metalanguage in logic programming , 1982 .

[31]  A. R. Turquette,et al.  Logic, Semantics, Metamathematics , 1957 .

[32]  Carolyn L. Talcott,et al.  Towards a Theory of Mechanizable Theories: I, FOL Contexts: The Extensional View , 1990, ECAI.