Skolem Machines and Geometric Logic

Abstract

Inspired by the wonderful design and implementation of the Prolog language afforded by the Warren Abstract Machine (WAM), this paper describes an extended logical language which can compute larger realms of first-order logic, based upon theories for finitary geometric logic. The paper describes a Geolog language for expressing first-order geometric logic in tidy closed form, a mathematical Skolem Machine that computes the language, and an implementation prototype that intimately mimics the abstract machine, and which also reformulates expensive bottom-up inference into efficient top-down inference. There are promising mathematical theorem proving applications for geometric logic systems, collected on the website [5]. The emphasis of this paper is theory, abstract machine design and direct implementation of the abstract machine.KeywordsConjunctive Normal FormAbstract MachineSkolem FunctionExistential VariableInteractive Theorem ProveThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.