The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets. Moreover, every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand models of the program and the least fixed-point of an immediate consequence operator. We also propose an SLD-resolution proof procedure which is proven sound and complete with respect toarXiv:1106.3457v1 fatcat:qmgckht2ifbz3llo7kclbvjcxi