John C. Shepherdson

35 papers Journal 32Unranked 2

Year	Rank	Type	Title / Venue / Authors
2001	J	`jnl`	A note on the notion of truth in fuzzy logic. Ann. Pure Appl. Log. Petr Hájek, John C. Shepherdson
2000	J	`jnl`	Rational Pavelka Predicate Logic Is A Conservative Extension of Lukasiewicz Predicate Logic. J. Symb. Log. Petr Hájek, Jeff B. Paris, John C. Shepherdson
2000	J	`jnl`	The Liar Paradox and Fuzzy Logic. J. Symb. Log. Petr Hájek, Jeff B. Paris, John C. Shepherdson
1995	—	`conf`	W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra. Machine Intelligence 15 John C. Shepherdson
1994	J	`jnl`	Partial Deduction of Updateable Definite Logic Programs. J. Log. Program. Kerima Benkerimi, John C. Shepherdson
1994	J	`jnl`	The Role of Standardising Apart in Logic Programming. Theor. Comput. Sci. John C. Shepherdson
1992	J	`jnl`	Mints Type Deductive Calculi for Logic Programming. Ann. Pure Appl. Log. John C. Shepherdson
1992	J	`jnl`	SLDNF-Resolution with Equality. J. Autom. Reason. John C. Shepherdson
1992	J	`jnl`	Unfold/Fold Transformations of Logic Programs. Math. Struct. Comput. Sci. John C. Shepherdson
1991	J	`jnl`	Correct Answers to Allowed Programs and Queries are Ground. J. Log. Program. John C. Shepherdson
1991	J	`jnl`	Partial Evaluation in Logic Programming. J. Log. Program. John W. Lloyd, John C. Shepherdson
1991	—	`conf`	Unfold/Fold Transformations of Logic Programs. Computational Logic - Essays in Honor of Alan Robinson Philippa Gardner, John C. Shepherdson
1991	J	`jnl`	Unsolvable Problems for SLDNF Resolution. J. Log. Program. John C. Shepherdson
1990	J	`jnl`	Properties of a Pruning Operator. J. Log. Comput. Patricia M. Hill, John W. Lloyd, John C. Shepherdson
1989	J	`jnl`	A Sound and Complete Semantics for a Version of Negation as Failure. Theor. Comput. Sci. John C. Shepherdson
1988	—	`ch.`	Negation in Logic Programming. Foundations of Deductive Databases and Logic Programming. John C. Shepherdson
1985	J	`jnl`	Negation as Failure II. J. Log. Program. John C. Shepherdson
1984	J	`jnl`	Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption. J. Log. Program. John C. Shepherdson
1983	J	`jnl`	Variants of Robinson's essentially undecidable theory Arch. Math. Log. James P. Jones, John C. Shepherdson
1982	J	`jnl`	Graph Theoretic Characterization of G-Schemes and TL-Schemes. Theor. Comput. Sci. John C. Shepherdson
1981	J	`jnl`	In Memoriam Calvin C. Elgot. Theor. Comput. Sci. John C. Shepherdson
1980	J	`jnl`	Some diophantine forms of gödel's theorem. Arch. Math. Log. Verena H. Dyson, James P. Jones, John C. Shepherdson
1979	J	`jnl`	A Semantically Meaningful Characterization of Reducible Flowchart Schemes. Theor. Comput. Sci. Calvin C. Elgot, John C. Shepherdson
1976	J	`jnl`	Godel's Second Incompleteness Theorem for Q. J. Symb. Log. A. Bezboruah, John C. Shepherdson
1976	J	`jnl`	On the Definition of Computable Function of a Real Variable. Math. Log. Q. John C. Shepherdson
1974	J	`jnl`	European Meeting of the Association for Symbolic Logic: Bristol, England, 1973. J. Symb. Log. H. E. Rose, John C. Shepherdson
1970	J	`jnl`	R70-20 Sequential Boolean Equations. IEEE Trans. Computers John C. Shepherdson
1964	J	`jnl`	Meeting of the Association for Symbolic Logic. J. Symb. Log. John C. Shepherdson, S. Korner, M. D. Gladstone
1963	J	`jnl`	Computability of Recursive Functions. J. ACM John C. Shepherdson, Howard E. Sturgis
1959	J	`jnl`	The Reduction of Two-Way Automata to One-Way Automata. IBM J. Res. Dev. John C. Shepherdson
1956	J	`jnl`	Note on a System of Myhill. J. Symb. Log. John C. Shepherdson
1956	J	`jnl`	On the Interpretation of Aristotelian Syllogistic. J. Symb. Log. John C. Shepherdson
1953	J	`jnl`	Inner Models for Set Theory - Part III. J. Symb. Log. John C. Shepherdson
1952	J	`jnl`	Inner Models for Set Theory-Part II. J. Symb. Log. John C. Shepherdson
1951	J	`jnl`	Inner Models for Set Theory - Part I. J. Symb. Log. John C. Shepherdson