We review the concept of logical relations and how they interact with structural induction; furthermore we give examples of their use, and of particular interest is the combination with the PER-idea (partial equivalence relations). This is then generalized to Kripke-logical relations; the major application is to show that in combination with the PER-idea this solves the problem of establishing a substitution property in a manner conducive to structural induction. Finally we introduce the concept of Kripke-layered predicates; this allows a modular definition of predicates and supports a methodology of “proofs in stages” where each stage focuses on only one aspect and thus is more manageable. All of these techniques have been tested and refined in “realistic applications” that have been documented elsewhere.
CITATION STYLE
Nielson, F., & Nidson, H. R. (1993). Layered predicates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 666 LNCS, pp. 425–456). Springer Verlag. https://doi.org/10.1007/3-540-56596-5_43
Mendeley helps you to discover research relevant for your work.