Referential data structures and labeled modal logic
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.
Unable to display preview. Download preview PDF.
- S. Artëmov and T. Strassen. Functionality in the Basic Logic of Proofs. Technical report IAM 93-004, Universität Bern, January, 1993.Google Scholar
- 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.Google Scholar
- S. Artëmov. Logic of proofs. Annals of Pure and Applied Logic, v.67, 1994 (to appear).Google Scholar