John C. Shepherdson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2001

A note on the notion of truth in fuzzy logicPetr Hájek, John C. Shepherdson. APAL, 109(1-2):65-69, 2001.

2000

The Liar Paradox and Fuzzy LogicPetr Hájek, Jeff B. Paris, John C. Shepherdson. JSYML, 65(1):339-346, 2000.

Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate LogicPetr Hájek, Jeff B. Paris, John C. Shepherdson. JSYML, 65(2):669-682, 2000.

1995

W. S. Jevons: his Logical Machine and Work Induction and Boolean AlgebraJohn C. Shepherdson. mi 1999: 489-505

1994

Partial Deduction of Updateable Definite Logic ProgramsKerima Benkerimi, John C. Shepherdson. jlp, 18(1):1-26, 1994.

The Role of Standardising Apart in Logic ProgrammingJohn C. Shepherdson. TCS, 129(1):143-142, 1994.

1992

Mints Type Deductive Calculi for Logic ProgrammingJohn C. Shepherdson. APAL, 56(1-3):7-17, 1992.

SLDNF-Resolution with EqualityJohn C. Shepherdson. JAR, 8(2):297-306, 1992.

Unfold/Fold Transformations of Logic ProgramsJohn C. Shepherdson. mscs, 2(2):143-157, 1992.

1991

Unfold/Fold Transformations of Logic ProgramsP. A. Gardner, John C. Shepherdson. BIRTHDAY 1991: 565-583

Partial Evaluation in Logic ProgrammingJohn W. Lloyd, John C. Shepherdson. jlp, 11(3&4):217-242, 1991.

Unsolvable Problems for SLDNF ResolutionJohn C. Shepherdson. jlp, 10(1/2/3&4):19-22, 1991.

Correct Answers to Allowed Programs and Queries are GroundJohn C. Shepherdson. jlp, 11(3&4):359-362, 1991.

1990

Properties of a Pruning OperatorPatricia M. Hill, John W. Lloyd, John C. Shepherdson. logcom, 1(1):99-143, 1990.

1989

A Sound and Complete Semantics for a Version of Negation as FailureJohn C. Shepherdson. TCS, 65(3):343-371, 1989.

1988

Negation in Logic ProgrammingJohn C. Shepherdson. In Foundations of Deductive Databases and Logic Programming.. pages 19-88, 1988.

1985

Negation as Failure IIJohn C. Shepherdson. jlp, 2(3):185-202, 1985.

1984

Negation as Failure: A Comparison of Clark s Completed Data Base and Reiter s Closed World AssumptionJohn C. Shepherdson. jlp, 1(1):51-79, 1984.

1983

RJames P. Jones, John C. Shepherdson. AML, 23(1):61-64, 1983. [doi]

1982

Graph Theoretic Characterization of G-Schemes and TL-SchemesJohn C. Shepherdson. TCS, 17:217-228, 1982.

1981

In Memoriam Calvin C. ElgotJohn C. Shepherdson. TCS, 16:1-4, 1981.

1980

Some diophantine forms of gödel's theoremVerena H. Dyson, James P. Jones, John C. Shepherdson. AML, 22(1-2):51-60, 1980. [doi]

1979

A Semantically Meaningful Characterization of Reducible Flowchart SchemesCalvin C. Elgot, John C. Shepherdson. TCS, 8:325-357, 1979.

1976

Godel s Second Incompleteness Theorem for QA. Bezboruah, John C. Shepherdson. JSYML, 41(2):503-512, 1976.

On the Definition of Computable Function of a Real VariableJohn C. Shepherdson. mlq, 22(1):391-402, 1976. [doi]

1974

European Meeting of the Association for Symbolic Logic: Bristol, England, 1973H. E. Rose, John C. Shepherdson. JSYML, 39(2):406-432, 1974.

1970

R70-20 Sequential Boolean EquationsJohn C. Shepherdson. TC, 19(7):658, 1970. [doi]

1964

Meeting of the Association for Symbolic LogicJohn C. Shepherdson, S. Korner, M. D. Gladstone. JSYML, 29(4):218-228, 1964.

1963

Computability of Recursive FunctionsJohn C. Shepherdson, Howard E. Sturgis. JACM, 10(2):217-255, 1963. [doi]

1959

The Reduction of Two-Way Automata to One-Way AutomataJohn C. Shepherdson. ibmrd, 3(2):198-200, 1959. [doi]

1956

Note on a System of MyhillJohn C. Shepherdson. JSYML, 21(3):261-264, 1956.

On the Interpretation of Aristotelian SyllogisticJohn C. Shepherdson. JSYML, 21(2):137-147, 1956.

1953

Inner Models for Set Theory - Part IIIJohn C. Shepherdson. JSYML, 18(2):145-167, 1953.

1952

Inner Models for Set Theory--Part IIJohn C. Shepherdson. JSYML, 17(4):225-237, 1952.

1951

Inner Models for Set Theory - Part IJohn C. Shepherdson. JSYML, 16(3):161-190, 1951.

Sign in or sign up to see more results.

runs on WebDSL