@article{gurevich1984toward,
author = {Gurevich, Yuri},
title = {Toward Logic Tailored for Computational Complexity},
year = {1984},
month = {July},
abstract = {The pathos of this paper is that classical logic, developed to confront the infinite, is ill prepared to deal with finite structures whereas finite structures, e.g. databases, are of so much importance in computer science. We show that famous theorems about first-order logic fail in the finite case, and discuss various alternatives to classical logic. The message has been heard.},
url = {http://approjects.co.za/?big=en-us/research/publication/toward-logic-tailored-computational-complexity/},
pages = {175-216},
journal = {"Computation and Proof Theory" (Ed. M. Richter et al.) Springer Lecture Notes in Math},
volume = {1104},
edition = {In "Computation and Proof Theory" (Ed. M. Richter et al.) Springer Lecture Notes in Math},
}