Abstract
The operational logic of proofs \(\mathcal{L}\mathcal{P}\)was introduced by S. Artemov [1] as an operational version of 54. In this paper, we define a model for \(\mathcal{L}\mathcal{P}\)and prove the corresponding completeness theorem. Using this model, we prove the decidability of a variant of \(\mathcal{L}\mathcal{P}\)axiomatized by a finite set of schemes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Artemov, Operational modal logic, Tech. Rep. 95-29, Mathematical Sciences Institute, Cornell University, December 1995.
S. Artemov, Logic of proofs, Annals of pure and applied logic 67 (1994) 29–59
A. Nerode, “Some Lectures on Modal Logic”, Tech. Rep 90-25, Mathematical Sciences Institute, Cornell University, April 1990.
F. Baader and J. Siekman, Unification Theory, in D. M. Gabbay, C. J. Hogger, and J. A. Robinson (ed.) Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mkrtychev, A. (1997). Models for the logic of proofs. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_27
Download citation
DOI: https://doi.org/10.1007/3-540-63045-7_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63045-6
Online ISBN: 978-3-540-69065-8
eBook Packages: Springer Book Archive