Formalization of the Resolution Calculus for First-Order Logic

Conference paper

DOI: 10.1007/978-3-319-43144-4_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9807)
Cite this paper as:
Schlichtkrull A. (2016) Formalization of the Resolution Calculus for First-Order Logic. In: Blanchette J., Merz S. (eds) Interactive Theorem Proving. ITP 2016. Lecture Notes in Computer Science, vol 9807. Springer, Cham

Abstract

A formalization in Isabelle/HOL of the resolution calculus for first-order logic is presented. Its soundness and completeness are formally proven using the substitution lemma, semantic trees, Herbrand’s theorem, and the lifting lemma. In contrast to previous formalizations of resolution, it considers first-order logic with full first-order terms, instead of the propositional case.

Keywords

First-order logic Resolution Isabelle/HOL Herbrand’s theorem Soundness Completeness 

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.DTU ComputeTechnical University of DenmarkKongens LyngbyDenmark

Personalised recommendations