Abstract
The operational logic of proofs LP was introduced by S. Artemov [1] as an operational version of S4. In this paper, we define a model for LP and prove the corresponding completeness theorem. Using this model, we prove the decidability of a variant of LP axiomatized by a finite set of schemes.
Cite
CITATION STYLE
APA
Mkrtychev, A. (1997). Models for the logic of proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1234, pp. 266–275). Springer Verlag. https://doi.org/10.1007/3-540-63045-7_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free