| 2001 |
|---|
| 30 | | Petr Hájek,
John C. Shepherdson:
A note on the notion of truth in fuzzy logic.
Ann. Pure Appl. Logic 109(1-2): 65-69 (2001) |
| 2000 |
|---|
| 29 | | Petr Hájek,
Jeff B. Paris,
John C. Shepherdson:
The Liar Paradox and Fuzzy Logic.
J. Symb. Log. 65(1): 339-346 (2000) |
| 28 | | Petr Hájek,
Jeff B. Paris,
John C. Shepherdson:
Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate Logic.
J. Symb. Log. 65(2): 669-682 (2000) |
| 1995 |
|---|
| 27 | | John C. Shepherdson:
W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra.
Machine Intelligence 15 1995: 489-505 |
| 1994 |
|---|
| 26 | | Kerima Benkerimi,
John C. Shepherdson:
Partial Deduction of Updateable Definite Logic Programs.
J. Log. Program. 18(1): 1-26 (1994) |
| 25 | | John C. Shepherdson:
The Role of Standardising Apart in Logic Programming.
Theor. Comput. Sci. 129(1): 143-142 (1994) |
| 1992 |
|---|
| 24 | | John C. Shepherdson:
Mints Type Deductive Calculi for Logic Programming.
Ann. Pure Appl. Logic 56(1-3): 7-17 (1992) |
| 23 | | John C. Shepherdson:
SLDNF-Resolution with Equality.
J. Autom. Reasoning 8(2): 297-306 (1992) |
| 22 | | John C. Shepherdson:
Unfold/Fold Transformations of Logic Programs.
Mathematical Structures in Computer Science 2(2): 143-157 (1992) |
| 1991 |
|---|
| 21 | | P. A. Gardner,
John C. Shepherdson:
Unfold/Fold Transformations of Logic Programs.
Computational Logic - Essays in Honor of Alan Robinson 1991: 565-583 |
| 20 | | John C. Shepherdson:
Unsolvable Problems for SLDNF Resolution.
J. Log. Program. 10(1/2/3&4): 19-22 (1991) |
| 19 | | John W. Lloyd,
John C. Shepherdson:
Partial Evaluation in Logic Programming.
J. Log. Program. 11(3&4): 217-242 (1991) |
| 18 | | John C. Shepherdson:
Correct Answers to Allowed Programs and Queries are Ground.
J. Log. Program. 11(3&4): 359-362 (1991) |
| 1990 |
|---|
| 17 | | Patricia M. Hill,
John W. Lloyd,
John C. Shepherdson:
Properties of a Pruning Operator.
J. Log. Comput. 1(1): 99-143 (1990) |
| 1989 |
|---|
| 16 | | John C. Shepherdson:
A Sound and Complete Semantics for a Version of Negation as Failure.
Theor. Comput. Sci. 65(3): 343-371 (1989) |
| 1988 |
|---|
| 15 | | John C. Shepherdson:
Negation in Logic Programming.
Foundations of Deductive Databases and Logic Programming. 1988: 19-88 |
| 1985 |
|---|
| 14 | | John C. Shepherdson:
Negation as Failure II.
J. Log. Program. 2(3): 185-202 (1985) |
| 1984 |
|---|
| 13 | | John C. Shepherdson:
Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption.
J. Log. Program. 1(1): 51-79 (1984) |
| 1982 |
|---|
| 12 | | John C. Shepherdson:
Graph Theoretic Characterization of G-Schemes and TL-Schemes.
Theor. Comput. Sci. 17: 217-228 (1982) |
| 1981 |
|---|
| 11 | | John C. Shepherdson:
In Memoriam Calvin C. Elgot.
Theor. Comput. Sci. 16: 1-4 (1981) |
| 1979 |
|---|
| 10 | | Calvin C. Elgot,
John C. Shepherdson:
A Semantically Meaningful Characterization of Reducible Flowchart Schemes.
Theor. Comput. Sci. 8: 325-357 (1979) |
| 1976 |
|---|
| 9 | | A. Bezboruah,
John C. Shepherdson:
Godel's Second Incompleteness Theorem for Q.
J. Symb. Log. 41(2): 503-512 (1976) |
| 1974 |
|---|
| 8 | | H. E. Rose,
John C. Shepherdson:
European Meeting of the Association for Symbolic Logic: Bristol, England, 1973.
J. Symb. Log. 39(2): 406-432 (1974) |
| 1964 |
|---|
| 7 | | John C. Shepherdson,
S. Korner,
M. D. Gladstone:
Meeting of the Association for Symbolic Logic.
J. Symb. Log. 29(4): 218-228 (1964) |
| 1963 |
|---|
| 6 | EE | John C. Shepherdson,
Howard E. Sturgis:
Computability of Recursive Functions.
J. ACM 10(2): 217-255 (1963) |
| 1956 |
|---|
| 5 | | John C. Shepherdson:
On the Interpretation of Aristotelian Syllogistic.
J. Symb. Log. 21(2): 137-147 (1956) |
| 4 | | John C. Shepherdson:
Note on a System of Myhill.
J. Symb. Log. 21(3): 261-264 (1956) |
| 1953 |
|---|
| 3 | | John C. Shepherdson:
Inner Models for Set Theory - Part III.
J. Symb. Log. 18(2): 145-167 (1953) |
| 1952 |
|---|
| 2 | | John C. Shepherdson:
Inner Models for Set Theory--Part II.
J. Symb. Log. 17(4): 225-237 (1952) |
| 1951 |
|---|
| 1 | | John C. Shepherdson:
Inner Models for Set Theory - Part I.
J. Symb. Log. 16(3): 161-190 (1951) |
