{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:43:54Z","timestamp":1749725034016},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562825"},{"type":"electronic","value":"9783540475057"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56282-6_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:59:45Z","timestamp":1330253985000},"page":"235-249","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical meta-logics: Intuitions, proof theory and semantics"],"prefix":"10.1007","author":[{"given":"Fausto","family":"Giunchiglia","sequence":"first","affiliation":[]},{"given":"Luciano","family":"Serafini","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Simpson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"16_CR1","first-page":"153","volume-title":"Logic Programming","author":"K. A. Bowen","year":"1982","unstructured":"K.A. Bowen and R.A. Kowalski. Amalgamating language and meta-language in logic programming. In S. Tarlund, editor, Logic Programming, pages 153\u2013173, New York, 1982. Academic Press."},{"key":"16_CR2","unstructured":"R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series."},{"key":"16_CR3","series-title":"DAI Research Paper No. 349, Dept. of Artificial Intelligence","volume-title":"Proc. of the 9th Conference on Automated Deduction","author":"A. Bundy","year":"1988","unstructured":"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."},{"issue":"2","key":"16_CR4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(81)90010-2","volume":"16","author":"A. Bundy","year":"1981","unstructured":"A. Bundy and B. Welham. Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation. Artificial Intelligence, 16(2):189\u2013212, 1981. Also available as DAI Research Paper 121, Dept. Artificial Intelligence, Edinburgh.","journal-title":"Artificial Intelligence"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.2307\/2964649","volume":"27","author":"S. Feferman","year":"1962","unstructured":"S. Feferman. Transfinite Recursive Progressions of Axiomatic Theories. Journal of Symbolic Logic, 27:259\u2013316, 1962.","journal-title":"Journal of Symbolic Logic"},{"key":"16_CR6","volume-title":"Proceedings 3rd Scandinavian Conference on Artificial Intelligence","author":"F. Giunchiglia","year":"1991","unstructured":"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."},{"key":"16_CR7","volume-title":"Technical Report 9110-07","author":"F. Giunchiglia","year":"1991","unstructured":"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."},{"key":"16_CR8","unstructured":"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."},{"key":"16_CR9","unstructured":"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."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01700692","volume":"38","author":"K. Goedel","year":"1931","unstructured":"K. Goedel. \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatsh. Math. Phys., 38:173\u201398, 1931. English translation in [12].","journal-title":"Monatsh. Math. Phys."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-09724-4"},{"key":"16_CR12","volume-title":"From Frege to G\u00f6del: a source book in Mathematical Logic, 1879\u20131931","author":"J. Heijenoort Van","year":"1967","unstructured":"J. Van Heijenoort. From Frege to G\u00f6del: a source book in Mathematical Logic, 1879\u20131931, Harvard University Press, Cambridge, Mass, 1967."},{"key":"16_CR13","unstructured":"T.B. Knoblock and R.L. Constable. Formalized Metatheory in Type Theory. Technical Report TR 86-742, Dept. Computer Science, Cornell University, 1986."},{"key":"16_CR14","unstructured":"D. Prawitz. Natural Deduction-A proof theoretical study. Almquist and Wiksell, Stockholm, 1965."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"H. Schwichtenberg. Proof theory: Some applications of cut-elimination. In J. Barwise, editor, Handbook of Mathematical Logic. North Holland Publishing Company, 1977.","DOI":"10.1016\/S0049-237X(08)71124-8"},{"key":"16_CR16","unstructured":"A. Simpson. The Semantics of a Multilanguage System. Technical report, IRST, 1990. Ref. no. 9009-05."},{"key":"16_CR17","unstructured":"A. Tarski. Logic, Semantics, Metamathematics. Oxford University Press, 1956."},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"R.W. Weyhrauch. Prolegomena to a theory of Mechanized Formal Reasoning. Artificial Intelligence. Special Issue on Non-monotonic Logic, 13(1), 1980.","DOI":"10.1016\/0004-3702(80)90015-6"}],"container-title":["Lecture Notes in Computer Science","Meta-Programming in Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56282-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:08Z","timestamp":1605646988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56282-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562825","9783540475057"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-56282-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}