# First-Order Logic According to Fitting

 Title: First-Order Logic According to Fitting Author: Stefan Berghofer Contributor: Asta Halkjær From Submission date: 2007-08-02 Abstract: We present a formalization of parts of Melvin Fitting's book "First-Order Logic and Automated Theorem Proving". The formalization covers the syntax of first-order logic, its semantics, the model existence theorem, a natural deduction proof calculus together with a proof of correctness and completeness, as well as the Löwenheim-Skolem theorem. Change history: [2018-07-21]: Proved completeness theorem for open formulas. Proofs are now written in the declarative style. Enumeration of pairs and datatypes is automated using the Countable theory. BibTeX: @article{FOL-Fitting-AFP, author = {Stefan Berghofer}, title = {First-Order Logic According to Fitting}, journal = {Archive of Formal Proofs}, month = aug, year = 2007, note = {\url{http://isa-afp.org/entries/FOL-Fitting.html}, Formal proof development}, ISSN = {2150-914x}, } License: BSD License Used by: FOL_Seq_Calc1 Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.