Inner Models for Set Theory - Part I. - John C. Shepherdson (J. Symb. Log., 1951)

Inner Models for Set Theory-Part II. - John C. Shepherdson (J. Symb. Log., 1952)

Inner Models for Set Theory - Part III. - John C. Shepherdson (J. Symb. Log., 1953)

On the Interpretation of Aristotelian Syllogistic. - John C. Shepherdson (J. Symb. Log., 1956)

Note on a System of Myhill. - John C. Shepherdson (J. Symb. Log., 1956)

The Reduction of Two-Way Automata to One-Way Automata. - John C. Shepherdson (IBM J. Res. Dev., 1959)

Computability of Recursive Functions. - John C. Shepherdson; Howard E. Sturgis (J. ACM, 1963)

Meeting of the Association for Symbolic Logic. - John C. Shepherdson; S. Korner; M. D. Gladstone (J. Symb. Log., 1964)

R70-20 Sequential Boolean Equations. - John C. Shepherdson (IEEE Trans. Computers, 1970)

European Meeting of the Association for Symbolic Logic: Bristol, England, 1973. - H. E. Rose; John C. Shepherdson (J. Symb. Log., 1974)

Godel's Second Incompleteness Theorem for Q. - A. Bezboruah; John C. Shepherdson (J. Symb. Log., 1976)

On the Definition of Computable Function of a Real Variable. - John C. Shepherdson (Math. Log. Q., 1976)

A Semantically Meaningful Characterization of Reducible Flowchart Schemes. - Calvin C. Elgot; John C. Shepherdson (Theor. Comput. Sci., 1979)

Some diophantine forms of gödel's theorem. - Verena H. Dyson; James P. Jones; John C. Shepherdson (Arch. Math. Log., 1980)

In Memoriam Calvin C. Elgot. - John C. Shepherdson (Theor. Comput. Sci., 1981)

Graph Theoretic Characterization of G-Schemes and TL-Schemes. - John C. Shepherdson (Theor. Comput. Sci., 1982)

Variants of Robinson's essentially undecidable theoryR. - James P. Jones; John C. Shepherdson (Arch. Math. Log., 1983)

Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. - John C. Shepherdson (J. Log. Program., 1984)

Negation as Failure II. - John C. Shepherdson (J. Log. Program., 1985)

Negation in Logic Programming. - John C. Shepherdson (Foundations of Deductive Databases and Logic Programming., 1988)

A Sound and Complete Semantics for a Version of Negation as Failure. - John C. Shepherdson (Theor. Comput. Sci., 1989)

Properties of a Pruning Operator. - Patricia M. Hill; John W. Lloyd; John C. Shepherdson (J. Log. Comput., 1990)

Unfold/Fold Transformations of Logic Programs. - Philippa Gardner; John C. Shepherdson (Computational Logic - Essays in Honor of Alan Robinson, 1991)

Partial Evaluation in Logic Programming. - John W. Lloyd; John C. Shepherdson (J. Log. Program., 1991)

Unsolvable Problems for SLDNF Resolution. - John C. Shepherdson (J. Log. Program., 1991)

Correct Answers to Allowed Programs and Queries are Ground. - John C. Shepherdson (J. Log. Program., 1991)

Mints Type Deductive Calculi for Logic Programming. - John C. Shepherdson (Ann. Pure Appl. Log., 1992)

SLDNF-Resolution with Equality. - John C. Shepherdson (J. Autom. Reason., 1992)

Unfold/Fold Transformations of Logic Programs. - John C. Shepherdson (Math. Struct. Comput. Sci., 1992)

Partial Deduction of Updateable Definite Logic Programs. - Kerima Benkerimi; John C. Shepherdson (J. Log. Program., 1994)

The Role of Standardising Apart in Logic Programming. - John C. Shepherdson (Theor. Comput. Sci., 1994)

W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra. - John C. Shepherdson (Machine Intelligence 15, 1995)

The Liar Paradox and Fuzzy Logic. - Petr Hájek 001; Jeff B. Paris; John C. Shepherdson (J. Symb. Log., 2000)

Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate Logic. - Petr Hájek 001; Jeff B. Paris; John C. Shepherdson (J. Symb. Log., 2000)

A note on the notion of truth in fuzzy logic. - Petr Hájek 001; John C. Shepherdson (Ann. Pure Appl. Log., 2001)