List of important and influential publications in logic

Question

Wikipedia surprisingly does not contain a good list. Under philosophy of mathematics it is rather vacant too. A graduate level list is here, but I was curious more about the most influential papers. Manually one could search here. But all in all, the database out there is rather barren.

Edit: For some reason when I was typing the title it did not suggest me this math.SE question. (will delete if duplicate).

Answer 1

All these lists are bound to be incomplete and more subjective than one would like, but a truly excellent selection of landmark papers can be found in the book "Mathematical logic in the 20th century", edited by Gerald Sacks, World Scientific, 2003.

Here is the table of contents:

1. The Independence of the Continuum Hypothesis. Cohen, Paul J.
2. The Independence of the Continuum Hypothesis II. Cohen, Paul J.
3. Marginalia to a Theorem of Silver. Devlin, K. I. and Jensen, R. B.
4. Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration without Duplication. Friedberg, Richard M.
5. Higher Set Theory and Mathematical Practice. Friedman, Harvey M.
6. Introduction to $\Pi^1_2$-Logic. Girard, Jean-Yves.
7. Consistency-Proof for the Generalized Continuum-Hypothesis. Gödel, Kurt.
8. The Mordell-Lang Conjecture for Function Fields. Hrushovski, Ehud.
9. Model-Theoretic Invariants: Applications to Recursive and Hyperarithmetic Operations. Kreisel, G.
10. Recursive Functionals and Quantifiers of Finite Types I. Kleene, S. C.
11. A Recursively Enumerable Degree which will not Split over all Lesser Ones. Lachlan, A. H.
12. Measurable Cardinals and Analytic Games. Martin, Donald A.
13. Enumerable Sets are Diophantine. Matijasevic, Ju. V.
14. Categoricity in Power. Morley, Michael.
15. Hyperanalytic Predicates. Moschovakis, Y. N.
16. Solution of Post's Reduction Problem and Some Other Problems of the Theory of Algorithms. Muchnik, A. A.
17. Recursively Enumerable Sets of Positive Integers and Their Decision Problems. Post, Emil L.
18. Non-Standard Analysis. Robinson, Abraham.
19. The Recursively Enumerable Degrees are Dense. Sacks, Gerald E.
20. Measurable Cardinals and Constructible Sets. Scott, Dana.
21. Stable Theories. Shelah, S.
22. The Problem of Predicativity. Shoenfield, J. R.
23. On the Singular Cardinals Problem. Silver, Jack.
24. Automorphisms of the Lattice of Recursively Enumerable Sets. Part I: Maximal Sets. Soare, Robert
25. A Model of Set-Theory in which Every Set of Reals is Lebesgue Measurable. Solovay, Robert M.
26. On Degrees of Recursive Unsolvability. Spector, Clifford.
27. A Decision Method for Elementary Algebra and Geometry. Tarski, Alfred.
28. Denumerable Models of Complete Theories. Vaught, R. L.
29. Model Completeness Results for Expansions of the Ordered Field of Real Numbers by Restricted Pfaffian Functions and the Exponential Function. Wilkie, A. J.
30. Supercompact Cardinals, Sets of Reals, and Weakly Homogeneous Trees. Woodin, W. Hugh.
31. Structural Properties of Models of $\aleph_1$-Categorical Theories. Zil'ber, B. I.

(Full bibliographical details for each paper can be found in the book, of course.)