On explicit reflection in theorem proving and formal verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1632, Issue , 1999, Pages 267-281

  Artemov, Sergei N ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FORMAL VERIFICATION;

LOWER AND UPPER BOUNDS; REFLECTION MECHANISM; RULE BASED; STABILITY REQUIREMENTS; THEOREM PROVING SYSTEMS; VERIFICATION PROCESS; VERIFICATION SYSTEMS;

THEOREM PROVING;

EID: 0040899999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48660-7_23     Document Type: Conference Paper

References (18)

1. Allen, S., Constable R., Howe D., Aitken W.: The Semantics of Reflected Proofs. In: Proceedings of the Fifth Annual Symposium on Logic in Computer Science, Los Alamitos, CA, USA, IEEE Computer Society Press (1990) 95-107.
2. Artemov, S.: Extensions of Theories by the Reflection Principles and the Corresponding Modal Logics. Ph.D. Thesis (in Russian). Moscow (1979)
3. Artemov, S., Strassen, T.: The Basic Logic of Proofs. In.: Lecture Notes in Computer Science. Vol. 702. Springer-Verlag (1993) 14-28.
4. Artemov, S.: Logic of Proofs. Annals of Pure and Applied Logic 67 (1994) 29-59
5. Artemov, S.: Operational Modal Logic. Technical Report MSI 95-29, Cornell University (1995)
6. Artemov, S.: Explicit Provability: the Intended Semantics for Intuitionistic and Modal Logic. Technical Report CFIS 98-10, Cornell University (1998)
7. Boolos, G.: The Unprovability of Consistency: An Essay in Modal Logic. Cambridge University Press (1979)
8. Davis, M., Schwartz, J.: Metamathematical Extensibility for Theorem Verifiers and Proof Checkers. Computers and Mathematics with Applications 5 (1979) 217-230
9. Feferman, S.: Arithmetization of Metamathematics in a General Setting. Fundamenta Mathematicae 49 (1960) 35-92
10. Feferman, S.: Transfinite Recursive Progressions of Axiomatic Theories. Journal of Symbolic Logic 27 (1962) 259-316
11. Harrison, J.: Metatheory and Reflection in Theorem Proving: A Survey and Critique. University of Cambridge (1995) http://www.dcs.glasgow.ac.uk/~tfm/hol-bib.html\#H
12. Knoblock, T., Constable, R.: Formalized Metareasoning in Type Theory. In: Proceedings of the First Annual Symposium on Logic in Computer Science. Cambridge, MA, USA, IEEE Computer Society Press (1986) 237-248
13. Kreisel, G., Levy, A.: Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 14 (1968) 97-142
14. Pollack, R.: On Extensibility of Proof Checkers. Lecture Notes in Computer Science, Vol. 996. Springer-Verlag, Berlin Heidelberg New York (1995) 140-161
15. Smorynski, C.: The Incompleteness Theorems. In: Barwise, J (ed.): Handbook of Mathematical Logic, Vol. 4. North-Holland, Amsterdam (1977) 821-865
16. C. Smorynski, C.: Self-Reference and Modal Logic. Springer-Verlag, Berlin (1985)
17. A.S. Troelstra, A.S., van Dalen, D.: Constructivism in Mathematics. An Introduction, Vol. 1, Amsterdam; North Holland (1988)
18. Turing, A.: Systems of Logics Based on Ordinals. Proceedings of the London Mathematical Society, Ser. 2, Vol. 45 (1939) 161-228