John C. Shepherdson

Publication Activity (10 Years)

Years Active: 1951-2001
Publications (10 Years): 0

Publications

Petr Hájek, John C. Shepherdson
A note on the notion of truth in fuzzy logic. Ann. Pure Appl. Log. 109 (1-2) (2001)
Petr Hájek, Jeff B. Paris, John C. Shepherdson
The Liar Paradox and Fuzzy Logic. J. Symb. Log. 65 (1) (2000)
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) (2000)
John C. Shepherdson
W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra. Machine Intelligence 15 (1995)
John C. Shepherdson
The Role of Standardising Apart in Logic Programming. Theor. Comput. Sci. 129 (1) (1994)
Kerima Benkerimi, John C. Shepherdson
Partial Deduction of Updateable Definite Logic Programs. J. Log. Program. 18 (1) (1994)
John C. Shepherdson
Mints Type Deductive Calculi for Logic Programming. Ann. Pure Appl. Log. 56 (1-3) (1992)
John C. Shepherdson
Unfold/Fold Transformations of Logic Programs. Math. Struct. Comput. Sci. 2 (2) (1992)
John C. Shepherdson
SLDNF-Resolution with Equality. J. Autom. Reason. 8 (2) (1992)
Philippa Gardner, John C. Shepherdson
Unfold/Fold Transformations of Logic Programs. Computational Logic - Essays in Honor of Alan Robinson (1991)
John C. Shepherdson
Correct Answers to Allowed Programs and Queries are Ground. J. Log. Program. 11 (3&4) (1991)
John W. Lloyd, John C. Shepherdson
Partial Evaluation in Logic Programming. J. Log. Program. 11 (3&4) (1991)
John C. Shepherdson
Unsolvable Problems for SLDNF Resolution. J. Log. Program. 10 (1) (1991)
Patricia M. Hill, John W. Lloyd, John C. Shepherdson
Properties of a Pruning Operator. J. Log. Comput. 1 (1) (1990)
John C. Shepherdson
A Sound and Complete Semantics for a Version of Negation as Failure. Theor. Comput. Sci. 65 (3) (1989)
John C. Shepherdson
Negation as Failure II. J. Log. Program. 2 (3) (1985)
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) (1984)
James P. Jones, John C. Shepherdson
. Arch. Math. Log. 23 (1) (1983)
John C. Shepherdson
Graph Theoretic Characterization of G-Schemes and TL-Schemes. Theor. Comput. Sci. 17 (1982)
John C. Shepherdson
In Memoriam Calvin C. Elgot. Theor. Comput. Sci. 16 (1981)
Verena H. Dyson, James P. Jones, John C. Shepherdson
Some diophantine forms of gödel's theorem. Arch. Math. Log. 22 (1-2) (1980)
Calvin C. Elgot, John C. Shepherdson
A Semantically Meaningful Characterization of Reducible Flowchart Schemes. Theor. Comput. Sci. 8 (1979)
A. Bezboruah, John C. Shepherdson
Godel's Second Incompleteness Theorem for Q. J. Symb. Log. 41 (2) (1976)
John C. Shepherdson
On the Definition of Computable Function of a Real Variable. Math. Log. Q. 22 (1) (1976)
H. E. Rose, John C. Shepherdson
European Meeting of the Association for Symbolic Logic: Bristol, England, 1973. J. Symb. Log. 39 (2) (1974)
John C. Shepherdson
R70-20 Sequential Boolean Equations. IEEE Trans. Computers 19 (7) (1970)
John C. Shepherdson, S. Korner, M. D. Gladstone
Meeting of the Association for Symbolic Logic. J. Symb. Log. 29 (4) (1964)
John C. Shepherdson, Howard E. Sturgis
Computability of Recursive Functions. J. ACM 10 (2) (1963)
John C. Shepherdson
The Reduction of Two-Way Automata to One-Way Automata. IBM J. Res. Dev. 3 (2) (1959)
John C. Shepherdson
On the Interpretation of Aristotelian Syllogistic. J. Symb. Log. 21 (2) (1956)
John C. Shepherdson
Note on a System of Myhill. J. Symb. Log. 21 (3) (1956)
John C. Shepherdson
Inner Models for Set Theory - Part III. J. Symb. Log. 18 (2) (1953)
John C. Shepherdson
Inner Models for Set Theory-Part II. J. Symb. Log. 17 (4) (1952)
John C. Shepherdson
Inner Models for Set Theory - Part I. J. Symb. Log. 16 (3) (1951)