Sergei Artemov  Home/Search
Context
Related
Links: ACM DBLP | cornell.edu/~artemov/CADE99.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: cornell.edu/~artemov/publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that the stability requirement for a verification system yields the necessity of some sort of a reection mechanism. However, the traditional reflection rule based on the Gödel implicit provability predicate leads to a "reflection tower" of theories which cannot be formally verified. We found natural lower and upper bounds on a metatheory capable of establishing stability of a given verification system. The paper introduces an explicit reflection mechanism which can be verified... (Update)
Active bibliography (related documents): More All
0.5: Operations on Proofs That Can Be Specified By Means of Modal Logic - Artemov (Correct)
0.4: A Foundation for Metareasoning, Part I: The Proof Theory - Criscuolo, Giunchiglia.. (Correct)
0.4: Deep Isomorphism of Modal Derivations and λ-Terms - Artemov (1999) (Correct)
Similar documents based on text: More All
0.4: An Introduction to Reflection-Oriented Programming - Sobel, al. (1996) (Correct)
0.4: Uniform Provability Realization of Intuitionistic Logic, Modality .. - Artemov (1999) (Correct)
0.4: Architectural Reflection: Concepts, Design, and Evaluation - Cazzola, Savigni, Sosio.. (Correct)
BibTeX entry: (Update)
@inproceedings{ artemov99explicit,
author = "Sergei N. Artemov",
title = "On Explicit Reflection in Theorem Proving and Formal Verification",
booktitle = "Proceedings of the 16th International Conference on Automated Deduction ({CADE}-16)",
publisher = "Springer-Verlag LNAI 1632",
address = "Trento, Italy",
editor = "Harald Ganzinger",
pages = "267--281",
year = "1999",
url = "citeseer.ist.psu.edu/395139.html" }
Citations (may not include all citations):112 Constructivism in Mathematics (context) - Troelstra, van Dalen - 1988
42 Lecture Notes in Computer Science (context) - Pollack - 1995
31 Systems of Logics Based on Ordinals (context) - Turing - 1939
23 Self-Reference and Modal Logic (context) - Smorynski - 1985
22 The Incompleteness Theorems (context) - Smorynski - 1977
21 Formalized Metareasoning in Type Theory (context) - Knoblock, Constable - 1986 ACM DBLP
15 Metamathematical Extensibility for Theorem Veriers and Proof.. (context) - Davis, Schwartz - 1979
14 Operational Modal Logic - Artemov - 1995
13 The Unprovability of Consistency: An Essay in Modal Logic (context) - Boolos - 1979
9 Annals of Pure and Applied Logic (context) - Artemov - 1994
8 The Semantics of Re ected Proofs (context) - Allen, Constable et al. - 1990
6 Arithmetization of Metamathematics in a General Setting (context) - Feferman - 1960
5 Transnite Recursive Progressions of Axiomatic Theories (context) - Feferman - 1962
5 Metatheory and Re ection in Theorem Proving: A Survey and Cr.. (context) - Harrison - 1995
3 Explicit Provability: the Intended Semantics for Intuitionis.. - Artemov - 1998
3 The Basic Logic of Proofs - Artemov, Strassen - 1993 ACM DBLP
1 Re ection Principles and Their Use for Establishing the Comp.. (context) - Kreisel, Levy - 1968
1 Extensions of Theories by the Re ection Principles and the C.. (context) - Artemov - 1979
Documents on the same site (http://www.math.cornell.edu/~artemov/publ.html): More
Deep Isomorphism of Modal Derivations and λ-Terms - Artemov (1999) (Correct)
Logic of Proofs: a Unified Semantics for Modality and lambda-Terms - Artemov (1998) (Correct)
Proof Realizations of Typed lambda-Calculi - Artemov (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC