Abstract
We introduce reference structures — a basic logical model of a computer memory organization capable to store and utilize information about its addresses. The corresponding labeled modal logics are axiomatized and supplied with the completeness and decidability theorems. A labeled modal formula can be regarded as a description of a certain reference structure; the satisfiability algorithm gives a method of building and optimizing reference structures satisfying a given formula.
Supported by the grant # 93-011-16015 of the Russian Foundation for Fundamental Research
Partially supported by the grant # 2.1.21 of the Foundation “Universities of Russia” — Fundamental problems of mathematics and mechanics.
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. Artëmov and T. Strassen. Functionality in the Basic Logic of Proofs. Technical report IAM 93-004, Universität Bern, January, 1993.
J.-L.Lasser, M.J.Maher and K.Marriot. Unification revisited. In: “Foundations of Deductive Databases and Logic Programming” J.Minker (Ed.), Morgan Kauffman, pp.587–626, 1987.
S. Artëmov. Logic of proofs. Annals of Pure and Applied Logic, v.67, 1994 (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Artëmov, S., Krupski, V. (1994). Referential data structures and labeled modal logic. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-58140-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58140-6
Online ISBN: 978-3-540-48442-4
eBook Packages: Springer Book Archive