The completeness of Peano multiplicationMark E. Nadel · 1981

Lower bounds for the lengths of refutationsHai-Ping Ko; David McAllester; Mark E. Nadel · 1993

A Transfer Principle for Simple Properties of TheoriesNadel, Mark E. · Proceedings of the American Mathematical Society · 1976

Rapid quantitative analysis using a single molecule counting approachChristina M. D’Antoni; Martin Fuchs; John L. Harris; Hai-Ping Ko; Raymond E. Meyer; Mark E. Nadel; Jeffrey D. Randall; Jenny E. Rooke; Eric A. Nalefski · 2006

Infinitary intuitionistic logic from a classical point of viewMark E. Nadel · 1978

An Arbitrary Equivalence Relation as Elementary Equivalence in an Abstract LogicMark E. Nadel · 1980

Views of Our ReadersPreston M. Simpson, Lawrence F. Codraro, Jerome F. Downs, William Hays Seele, Newton Gresham, Paul N. Luvera, Jr., John D. Hobday, John E. Powers, Mark Nadel, G. Gordon Davis, John M. O'Quinn, Gerald D. McDougall, Roy T. Traynor, Lester T. Proctor, Jr., Lowell J. Myers, Gideon Kanner and Franklin N. Cunningham · American Bar Association Journal · 1974

Computability and λ-DefinabilityA. M. Turing · The Journal of Symbolic Logic · 1937

Definability and Decision Problems in ArithmeticJulia Robinson · The Journal of Symbolic Logic · 1949

Arithmetical Problems and Recursively Enumerable PredicatesMartin Davis · The Journal of Symbolic Logic · 1953

The Interpretability Logic of Peano ArithmeticAlessandro Berarducci · The Journal of Symbolic Logic · 1990

Steps Toward a Constructive NominalismNelson Goodman and W. V. Quine · The Journal of Symbolic Logic · 1947

A Completeness Theorem in Modal LogicSaul A. Kripke · The Journal of Symbolic Logic · 1959

Models and RealityHilary Putnam · The Journal of Symbolic Logic · 1980

A Theory of Restricted Quantification ITheodore Hailperin · The Journal of Symbolic Logic · 1957