John C. Shepherdson

According to our database1, John C. Shepherdson authored at least 35 papers between 1951 and 2001.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2001
A note on the notion of truth in fuzzy logic.
Ann. Pure Appl. Logic, 2001

2000
Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate Logic.
J. Symb. Log., 2000

The Liar Paradox and Fuzzy Logic.
J. Symb. Log., 2000

1995
W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra.
Proceedings of the Machine Intelligence 15, 1995

1994
The Role of Standardising Apart in Logic Programming.
Theor. Comput. Sci., 1994

Partial Deduction of Updateable Definite Logic Programs.
J. Log. Program., 1994

1992
Unfold/Fold Transformations of Logic Programs.
Mathematical Structures in Computer Science, 1992

SLDNF-Resolution with Equality.
J. Autom. Reasoning, 1992

Mints Type Deductive Calculi for Logic Programming.
Ann. Pure Appl. Logic, 1992

1991
Correct Answers to Allowed Programs and Queries are Ground.
J. Log. Program., 1991

Unsolvable Problems for SLDNF Resolution.
J. Log. Program., 1991

Partial Evaluation in Logic Programming.
J. Log. Program., 1991

Unfold/Fold Transformations of Logic Programs.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990
Properties of a Pruning Operator.
J. Log. Comput., 1990

1989
A Sound and Complete Semantics for a Version of Negation as Failure.
Theor. Comput. Sci., 1989

1988
Negation in Logic Programming.
Proceedings of the Foundations of Deductive Databases and Logic Programming, 1988

1985
Negation as Failure II.
J. Log. Program., 1985

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

1983
Variants of Robinson's essentially undecidable theoryR.
Arch. Math. Log., 1983

1982
Graph Theoretic Characterization of G-Schemes and TL-Schemes.
Theor. Comput. Sci., 1982

1981
In Memoriam Calvin C. Elgot.
Theor. Comput. Sci., 1981

1980
Some diophantine forms of gödel's theorem.
Arch. Math. Log., 1980

1979
A Semantically Meaningful Characterization of Reducible Flowchart Schemes.
Theor. Comput. Sci., 1979

1976
On the Definition of Computable Function of a Real Variable.
Math. Log. Q., 1976

Godel's Second Incompleteness Theorem for Q.
J. Symb. Log., 1976

1974
European Meeting of the Association for Symbolic Logic: Bristol, England, 1973.
J. Symb. Log., 1974

1970
R70-20 Sequential Boolean Equations.
IEEE Trans. Computers, 1970

1964
Meeting of the Association for Symbolic Logic.
J. Symb. Log., 1964

1963
Computability of Recursive Functions.
J. ACM, 1963

1959
The Reduction of Two-Way Automata to One-Way Automata.
IBM Journal of Research and Development, 1959

1956
Note on a System of Myhill.
J. Symb. Log., 1956

On the Interpretation of Aristotelian Syllogistic.
J. Symb. Log., 1956

1953
Inner Models for Set Theory - Part III.
J. Symb. Log., 1953

1952
Inner Models for Set Theory-Part II.
J. Symb. Log., 1952

1951
Inner Models for Set Theory - Part I.
J. Symb. Log., 1951


  Loading...