John C. Shepherdson
#151,968
Most Influential Person Now
John C. Shepherdson's AcademicInfluence.com Rankings
John C. Shepherdsoncomputer-science Degrees
Computer Science
#8070
World Rank
#8489
Historical Rank
Programming
#84
World Rank
#87
Historical Rank
Algorithms
#317
World Rank
#321
Historical Rank
Database
#5111
World Rank
#5308
Historical Rank
Download Badge
Computer Science
Why Is John C. Shepherdson Influential?
(Suggest an Edit or Addition)John C. Shepherdson's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Partial Evaluation in Logic Programming (1991) (507)
- Computability of Recursive Functions (1963) (410)
- The Reduction of Two-Way Automata to One-Way Automata (1959) (301)
- Effective procedures in field theory (1956) (269)
- Set Theory and Its Logic. (1965) (243)
- Unfold/fold transformations of logic programs (1992) (241)
- Computer programming and formal systems (1965) (220)
- Computational Complexity of Real Functions (1985) (164)
- Negation in Logic Programming (1988) (155)
- Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption (1984) (145)
- Negation as Failure II (1985) (91)
- Effective operations on partial recursive functions (1955) (91)
- Mathematical Logic and Programming Languages (1985) (91)
- The liar paradox and fuzzy logic (2000) (81)
- A Sound and Complete Semantics for a Version of Negation as Failure (1989) (60)
- Inner models for set theory – Part III (1951) (56)
- Inverses and Zero Divisors in Matrix Rings (1951) (53)
- Sets recognized by n-tape automata (1969) (51)
- Machine Configuration and Word Problems of Given Degree of Unsolvability (1965) (46)
- Gödel's Second incompleteness theorem for Q (1976) (43)
- Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic (2000) (38)
- Representability of recursively enumerable sets in formal theories (1961) (37)
- Unsolvable Problems for SLDNF Resolution (1990) (33)
- Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory (1985) (31)
- On the interpretation of Aristotelian syllogistic (1956) (29)
- On the Definition of Computable Function of a Real Variable (1976) (27)
- On the factorisation of polynomials in a finite number of steps (1955) (27)
- Computation Over Abstract Structures: Serial and Parallel Procedures and Friedman's Effective Definitional Schemes (1975) (26)
- Variants of Robinson's essentially undecidable theoryR (1983) (26)
- Extracting programs from proofs by an extension of the Curry-Howard process (1993) (24)
- Properties of a Pruning Operator (1990) (19)
- A Semantically Meaningful Characterization of Reducible Flowchart Schemes (1979) (19)
- Some diophantine forms of gödel's theorem (1980) (16)
- Theoretical considerations in continuous flow analysis. (1971) (16)
- Inner models for set theory—Part I (1951) (16)
- Logics for Negation as Failure (1992) (15)
- On the Addition of Elements of a Sequence (1947) (15)
- Mechanism for computing over arbitrary structures (1988) (15)
- Language and Equality Theory in Logic Programming (2001) (14)
- Inner models for set theory—Part II (1952) (12)
- An Equational Axiomatization of the Algebra of Reducible Flowchart Schemes (1982) (12)
- The Role of Standardising Apart in Logic Programming (1994) (12)
- Mints Type Deductive Calculi for Logic Programming (1992) (11)
- Introduction to the Theory of Logic Programming (1987) (10)
- Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages (1985) (10)
- SLDNF-resolution with equality (1992) (9)
- Utility theory based on rational probabilities (1980) (8)
- A note on the notion of truth in fuzzy logic (2001) (8)
- Well‐Ordered Sub‐Series of General Series (1951) (7)
- Correct Answers to Allowed Programs and Queries are Ground (1991) (5)
- Weak and Strong Induction (1969) (3)
- The rule of induction in the three variable arithmetic based on $+$ and $-$ (1967) (3)
- Automata and Finite Automata. (1971) (3)
- Review: David Maier, David S. Warren, Computing with Logic. Logic Programming with Prolog (1991) (3)
- Partial Deduction of Updateable Definite Logic Programs (1994) (3)
- On two problems of Kurepa (1954) (2)
- NON-STANDARD MODELS FOR FRAGMENTS OF NUMBER THEORY (2014) (2)
- Review: Michael O. Rabin, On Recursively Enumerable and Arithmetic Models of Set Theory (1963) (1)
- 2813. A historical note on Note 2726 (1958) (1)
- W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra (1995) (1)
- Logic Colloquium '73 Proceedings of the Logic Colloquium, Bristol, July 1973 (1975) (1)
- Classification of Quantifier Prefixes Over Diophantine Equations.Some Diophantine Forms of Godel's Theorem.Universal Diophantine Equation.Exponential Diophantine Representation of Recursively Enumerable Sets.Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerabl (1986) (0)
- Review: C. Y. Lee, Automata and Finite Automata (1971) (0)
- Review: Michael J. Beeson, Computerizing Mathematics: Logic and Computation (1991) (0)
- Meeting of the Association for Symbolic Logic (1964) (0)
- From Logic to Logic Programming (1995) (0)
- SET THEORY FOR THE MATHEMATICIAN (1969) (0)
- Mathematical Logic (1968) (0)
- ELEMENTS OF MATHEMATICAL LOGIC (1964) (0)
- Review: G. P. Zykin, Comment on a Theorem of Hao Wang (1971) (0)
- Review of Subrecursion : Functions and Hierarchies (2003) (0)
- Calvin C. Elgot 1922–1980☆ (1983) (0)
- Review: C. R. J. Clapham, An Embedding Theorem for Finitely Generated Groups (1970) (0)
- Maier David and Warren David S.. Computing with logic. Logic programming with Prolog . The Benjamin/Cummings Publishing Company, Menlo Park, Calif., etc., 1988, xxi + 535 pp. (1991) (0)
- R70-20 Sequential Boolean Equations (1970) (0)
- Review: E. W. Beth, Some Consequences of the Theorem of Lowenheim-Skolem-Godel-Malcev (1954) (0)
- In Memoriam Calvin C. Elgot (1981) (0)
- Review: Roger C. Lyndon, Notes on Logic (1973) (0)
- Lévy Azriel. Axiom schemata of strong infinity in axiomatic set theory. Pacific journal of mathematics, vol. 10 (1960), pp. 223–238. (1962) (0)
- Kruse A. H.. Grothendieck universes and the super-complete models of Shepherdson. Composite mathematica, vol. 17 (1965), pp. 96–101. (1972) (0)
- Clapham C. R. J.. An embedding theorem for finitely generated groups. Proceedings of the London Mathematical Society, ser. 3 vol. 17 (1967), pp. 419–430. (1970) (0)
- The Characterization Problem for Hoare Logics [ and Discussion ] (2007) (0)
- Review: E. W. Beth, A Topological Proof of the Theorem of Lowenheim-Skolem-Godel (1954) (0)
- Beth E. W.. A topological proof of the theorem of Löwenheim-Skolem-Gödel. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings , series A, vol. 54 (1951), pp. 436–444; also Indagationes mathematicae, vol. 13 (1951), pp. 436–444. (1954) (0)
- Note on a system of myhill (1956) (0)
- Algorithmic information theory (1988) (0)
- European Meeting of the Association for Symbolic Logic, Bristol, England, 1973 (1974) (0)
- Lloyd J. W.. Foundations of logic programming . Symbolic computation. Artifical intelligence. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1984, x + 124 pp. (1987) (0)
- Review: A. H. Kruse, Grothendieck Universes and the Super-Complete Models of Shepherdson (1972) (0)
- Review: Gaisi Takeuti, Axioms of Infinity of Set Theory (1962) (0)
- Ernst Robert (Peter) Reifenberg (1965) (0)
- Fitting Melvin. Computability theory, semantics, and logic programming . Oxford logic guides, no. 13. Clarendon Press, Oxford University Press, Oxford and New York 1987, xi + 198 pp. (1988) (0)
- Beth E. W.. Some consequences of the theorem of Löwenheim-Skolem-Gödel-Malcev. Ibid., vol. 56 (1953), pp. 66–71; and Ibid., vol. 15 (1953), pp. 66–71. (1954) (0)
- List of officers and members of the association for symbolic logic (1957) (0)
- Review: Melvin Fitting, Computability Theory, Semantics, and Logic Programming (1988) (0)
- Graph Theoretic Characterization of G-Schemes and TL-Schemes (1982) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With John C. Shepherdson?
John C. Shepherdson is affiliated with the following schools:
