Levationis Laus
Open Access
- 1 January 1993
- journal article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 3 (5) , 487-516
- https://doi.org/10.1093/logcom/3.5.487
Abstract
We present an expression-directed and renaming-invariant approach to linear resolution. eliminating the ‘usual’ annoyances involving the handling of variables and substitutions and culminating in strengthened forms of mgu- and lifting-lemmas. Subsequently, we give a twist to lifting ground derivations, obtaining three basic theorems on the tree of all ground derivations represented by an SLD tree. These provide fast proofs for standard theorems, results on infinite derivations, greatest fixed points, and answer the question of when these are reached after ω steps in the downward fixed-point hierarchy.Keywords
This publication has 0 references indexed in Scilit: