J. C. Shepherdson

发表

Computation Over Abstract Structures: Serial and Parallel Procedures and Friedman's Effective Definitional Schemes

J. C. Shepherdson, J. Shepherdson, 1975 .

Review: Michael J. Beeson, Computerizing Mathematics: Logic and Computation

J. C. Shepherdson, 1991 .

Logic Colloquium '73 Proceedings of the Logic Colloquium, Bristol, July 1973

J. C. Shepherdson, H. E. Rose, H. E. Rose, 1975 .

Mathematical Logic and Programming Languages

J. C. Shepherdson, Charles Antony Richard Hoare, C. Hoare, 1985 .

Introduction to the Theory of Logic Programming

J. C. Shepherdson, J. Shepherdson, 1987 .

Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages

J. C. Shepherdson, C A.R. Hoare, 1985 .

Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory

J. C. Shepherdson, J. Shepherdson, 1985 .

Review: Roger C. Lyndon, Notes on Logic

J. C. Shepherdson, 1973 .

Review: David Maier, David S. Warren, Computing with Logic. Logic Programming with Prolog

J. C. Shepherdson, 1991 .

Logics for Negation as Failure

J. C. Shepherdson, J. Shepherdson, 1992 .

Reduktionstheorie des Entscheidungsproblems im Pradikatenkalkul der ersten Stufe

J. C. Shepherdson, Janos Suranyi, J. C. Shepherdson, 1961, The Mathematical Gazette.

Algorithmic information theory

J. C. Shepherdson, 1988 .

From Logic to Logic Programming

J. C. Shepherdson, 1995 .

Weak and Strong Induction

J. C. Shepherdson, 1969 .

Representability of recursively enumerable sets in formal theories

J. C. Shepherdson, J. Shepherdson, 1961 .

Machine Configuration and Word Problems of Given Degree of Unsolvability

J. C. Shepherdson, J. Shepherdson, 1965 .

2813. A Historical Note on Note 2726

J. C. Shepherdson, 1958 .

The rule of induction in the three variable arithmetic based on $+$ and $-$

J. C. Shepherdson, 1967 .

Utility theory based on rational probabilities

J. C. Shepherdson, J. Shepherdson, 1980 .