Ultimate approximation and its application in nonmonotonic knowledge representation systems

A logic for default reasoning

Raymond Reiter · Artificial Intelligence · 1980 · 3.9K citations

Reasoning, Engineering, Reasoning System +6

A lattice-theoretical fixpoint theorem and its applications

Alfred Tarski · Pacific Journal of Mathematics · 1955 · 2.7K citations · Full text

Mathematical Programming, Lattice (Order), Topological Combinatorics +3

The well-founded semantics for general logic programs

Allen Van Gelder, Kenneth A. Ross, John S. Schlipf · Journal of the ACM · 1991 · 1.7K citations

Applied Logic, Engineering, Data Science +11

The Semantics of Predicate Logic as a Programming Language

M. H. van Emden, Robert Kowalski · Journal of the ACM · 1976 · 1.5K citations · Full text

Declarative Programming, Engineering, Operational Semantics +11

Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165 pp. - C. Smoryński. D.1. The incompleteness theorems. Pp. 821–865. - Helmut Schwichtenberg. D.2. Proof theory: some applications of cut-elimination. Pp. 867–895. - Richard Statman. D.3. Herbrand's theorem and Gentzen's notion of a direct proof. Pp. 897–912. - Solomon Feferman. D.4. Theories of finite type related to mathematical practice. Pp. 913–971. - A. S. Troelstra. D.5. Aspects of constructive mathematics. Pp. 973–1052. - Michael P. Fourman. D.6. The logic of topoi. Pp. 1053–1090. - Henk P. Barendregt. D.1. The type free lambda calculus. Pp. 1091–1132. - Jeff Paris and Leo Harrington. D.8. A mathematical incompleteness in Peano arithmetic. Pp. 1133–1142.

William A. Howard · Journal of Symbolic Logic · 1984 · 837 citations