Stephen Cook & Phuong Nguyen (2010):
Logical Foundations of Proof Complexity.
Cambridge University Press,
doi:10.1017/CBO9780511676277.
René Cori, Daniel Lascar & Donald H. Pelletier (2000):
Mathematical logic: a course with exercises; Pt. 1: Propositional calculus, Boolean algebras, predicate calculus.
Oxford University Press.
William F. Dowling & Jean H. Gallier (1984):
Linear-time algorithms for testing the satisfiability of propositional Horn formulae.
Journal of Logic Programming 1(3),
pp. 267–284,
doi:10.1016/0743-1066(84)90014-1.
Jean H. Gallier (1987):
Logic for Computer Science: Foundations of Automatic Theorem Proving.
Wiley,
doi:10.2307/2275035.
Shawn Hedman (2004):
A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity.
Oxford University Press,
doi:10.2178/bsl/1203350881.
Alfred Horn (1951):
On Sentences Which are True of Direct Unions of Algebras.
Journal of Symbolic Logic 16(1),
pp. 14–21,
doi:10.2307/2268661.
Michael Huth & Mark Ryan (2004):
Logic in Computer Science - Modelling and Reasoning about Systems (2. ed.).
Cambridge University Press,
doi:10.1017/CBO9780511810275.
Alfred Tarski (1955):
A Lattice-Theoretical Fixpoint Theorem and its Applications.
Pacific Journal of Mathematics 5(2),
pp. 285–309,
doi:10.2140/pjm.1955.5.285.
eptcs@eptcs.org