Skip to main content
Conference Proceedings

The basic logic of proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 702 LNCS 14-28
DOI: 10.1007/3-540-56992-8_3
13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Propositional Provability Logic was axiomatized in [5]. This logic describes the behaviour of the arithmetical operator “y is provable”. The aim of the current paper is to provide propositional axiomatizations of the predicate “x is a proof of y”by means of modal logic, with the intention of meeting some of the needs of computer science.

Cite

CITATION STYLE

APA

Artëmov, S., & Straßen, T. (1993). The basic logic of proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 702 LNCS, pp. 14–28). Springer Verlag. https://doi.org/10.1007/3-540-56992-8_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free