Skip to main content

Hierarchical meta-logics: Intuitions, proof theory and semantics

  • Conference paper
  • First Online:
Meta-Programming in Logic (META 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 649))

Included in the following conference series:

  • 549 Accesses

Abstract

The goal of this paper is to provide a possible foundation for meta-reasoning in the fields of artificial intelligence and computer science. We first investigate the relationship that we want to hold between meta-theory and object-theory. We then outline a methodology in which reflection rules serve to deductively generate a meta-theory from its object theory. Finally, we apply this methodology and define a hierarchical meta-logic, namely a formal system generating an entire meta-hierarchy, which is sound and complete with respect to a semantics formalising the desired meta/object relationship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.A. Bowen and R.A. Kowalski. Amalgamating language and meta-language in logic programming. In S. Tarlund, editor, Logic Programming, pages 153–173, New York, 1982. Academic Press.

    Google Scholar 

  2. R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series.

    Google Scholar 

  3. A. Bundy. The Use of Explicit Plans to Guide Inductive Proofs. In R. Luck and R. Overbeek, editors, Proc. of the 9th Conference on Automated Deduction. Springer-Verlag, 1988. Longer version available as DAI Research Paper No. 349, Dept. of Artificial Intelligence, Edinburgh.

    Google Scholar 

  4. A. Bundy and B. Welham. Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation. Artificial Intelligence, 16(2):189–212, 1981. Also available as DAI Research Paper 121, Dept. Artificial Intelligence, Edinburgh.

    Google Scholar 

  5. S. Feferman. Transfinite Recursive Progressions of Axiomatic Theories. Journal of Symbolic Logic, 27:259–316, 1962.

    Google Scholar 

  6. F. Giunchiglia and L. Serafini. Multilanguage first order theories of propositional attitudes. In Proceedings 3rd Scandinavian Conference on Artificial Intelligence, Roskilde University, Denmark, 1991. IRST-Technical Report 9001-02, IRST, Trento, Italy.

    Google Scholar 

  7. F. Giunchiglia and L. Serafini. Multilanguage hierarchical logics (or: how we can do without modal logics). Technical Report 9110-07, IRST, Trento, Italy, 1991. Submitted to Artificial Intelligence Journal. Extended abstract in Proc. META-92, Uppsala, Sweden, 1992.

    Google Scholar 

  8. F. Giunchiglia and A. Smaill. Reflection in constructive and non-constructive automated reasoning. In J. Lloyd, editor, Proc. Workshop on Meta-Programming in Logic Programming. MIT Press, 1989. IRST Technical Report 8902-04. Also available as DAI Research Paper 375, Dept. of Artificial Intelligence, Edinburgh.

    Google Scholar 

  9. F. Giunchiglia and P. Traverso. Plan formation and execution in a uniform architecture of declarative metatheories. In M. Bruynooghe, editor, Proc. Workshop on Meta-Programming in Logic, 1990. IRST Technical Report 9003-12.

    Google Scholar 

  10. K. Goedel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatsh. Math. Phys., 38:173–98, 1931. English translation in [12].

    Google Scholar 

  11. M.J. Gordon, A.J. Milner, and C.P. Wadsworth. Edinburgh LCF-A mechanised logic of computation, volume 78 of Lecture Notes in Computer Science. Springer Verlag, 1979.

    Google Scholar 

  12. J. Van Heijenoort. From Frege to Gödel: a source book in Mathematical Logic, 1879–1931, Harvard University Press, Cambridge, Mass, 1967.

    Google Scholar 

  13. T.B. Knoblock and R.L. Constable. Formalized Metatheory in Type Theory. Technical Report TR 86-742, Dept. Computer Science, Cornell University, 1986.

    Google Scholar 

  14. D. Prawitz. Natural Deduction-A proof theoretical study. Almquist and Wiksell, Stockholm, 1965.

    Google Scholar 

  15. H. Schwichtenberg. Proof theory: Some applications of cut-elimination. In J. Barwise, editor, Handbook of Mathematical Logic. North Holland Publishing Company, 1977.

    Google Scholar 

  16. A. Simpson. The Semantics of a Multilanguage System. Technical report, IRST, 1990. Ref. no. 9009-05.

    Google Scholar 

  17. A. Tarski. Logic, Semantics, Metamathematics. Oxford University Press, 1956.

    Google Scholar 

  18. R.W. Weyhrauch. Prolegomena to a theory of Mechanized Formal Reasoning. Artificial Intelligence. Special Issue on Non-monotonic Logic, 13(1), 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Pettorossi

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giunchiglia, F., Serafini, L., Simpson, A. (1992). Hierarchical meta-logics: Intuitions, proof theory and semantics. In: Pettorossi, A. (eds) Meta-Programming in Logic. META 1992. Lecture Notes in Computer Science, vol 649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56282-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-56282-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56282-5

  • Online ISBN: 978-3-540-47505-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics