64 found
Order:
  1.  37
    Set Theory and Its Logic.J. C. Shepherdson & Willard Van Orman Quine - 1965 - Philosophical Quarterly 15 (61):371.
  2.  66
    A Non-Standard Model for a Free Variable Fragment of Number Theory.J. C. Shepherdson - 1965 - Journal of Symbolic Logic 30 (3):389-390.
    Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  3.  32
    Inner models for set theory—Part I.J. C. Shepherdson - 1951 - Journal of Symbolic Logic 16 (3):161-190.
    One of the standard ways of proving the consistency of additional hypotheses with the basic axioms of an axiom system is by the construction of what may be described as ‘inner models.’ By starting with a domain of individuals assumed to satisfy the basic axioms an inner model is constructed whose domain of individuals is a certain subset of the original individual domain. If such an inner model can be constructed which satisfies not only the basic axioms but also the (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  4.  13
    Effective operations on partial recursive functions.J. Myhill & J. C. Shepherdson - 1955 - Mathematical Logic Quarterly 1 (4):310-317.
  5.  43
    Computability of Recursive Functions.J. C. Shepherdson & H. E. Sturgis - 1967 - Journal of Symbolic Logic 32 (1):122-123.
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  6.  37
    Effective operations on partial recursive functions.J. Myhill & J. C. Shepherdson - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (4):310-317.
  7.  16
    Inner models for set theory—Part II.J. C. Shepherdson - 1952 - Journal of Symbolic Logic 17 (4):225-237.
    In this paper we continue the study of inner models of the type studied inInner models for set theory—Part I.The present paper is concerned exclusively with a particular kind of model, the ‘super-complete models’ defined in section 2.4 of I. The condition of 2.4 and the completeness condition 1.42 imply that such a model is uniquely determined when its universal class Vmis given. Writing condition and the completeness conditions 1.41, 1.42 in terms of Vm, we may state the definition in (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  8.  66
    Gödel's Second incompleteness theorem for Q.A. Bezboruah & J. C. Shepherdson - 1976 - Journal of Symbolic Logic 41 (2):503-512.
  9.  14
    Inner models for set theory – Part III.J. C. Shepherdson - 1953 - Journal of Symbolic Logic 18 (2):145-167.
    In this third and last paper on inner models we consider some of the inherent limitations of the method of using inner models of the type defined in 1.2 for the proof of consistency results for the particular system of set theory under consideration. Roughly speaking this limitation may be described by saying that practically no further consistency results can be obtained by the construction of models satisfying the conditions of theorem 1.5, i.e., conditions 1.31, 1.32, 1.33, 1.51, viz.:This applies (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  10.  25
    On the interpretation of aristotelian syllogistic.J. C. Shepherdson - 1956 - Journal of Symbolic Logic 21 (2):137-147.
  11.  3
    Representability of recursively enumerable sets in formal theories.J. C. Shepherdson - 1961 - Archive for Mathematical Logic 5 (3-4):119-127.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   10 citations  
  12.  24
    On the Definition of Computable Function of a Real Variable.J. C. Shepherdson - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):391-402.
  13.  9
    On the Definition of Computable Function of a Real Variable.J. C. Shepherdson - 1976 - Mathematical Logic Quarterly 22 (1):391-402.
  14.  9
    An Intuitionistic Theory of Types: Predicative Part.H. E. Rose & J. C. Shepherdson - 1984 - Journal of Symbolic Logic 49 (1):311-313.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  15.  7
    Inner Models for Set Theory.J. C. Shepherdson - 1953 - Journal of Symbolic Logic 18 (4):342-343.
  16.  5
    Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson - 1965 - Mathematical Logic Quarterly 11 (2):149-175.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  17.  24
    Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (2):149-175.
  18.  5
    [Omnibus Review].J. C. Shepherdson - 1968 - Journal of Symbolic Logic 33 (2):296-297.
  19.  1
    On the Interpretation of Aristotelian Syllogistic.J. C. Shepherdson - 1957 - Journal of Symbolic Logic 22 (4):381-381.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  20.  3
    Mathematical Logic and Programming Languages.Sir Charles Anthony Richard Hoare & J. C. Shepherdson (eds.) - 1985 - Englewood Cliffs, NJ, USA: Prentice-Hall.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  21.  7
    Mathematical Logic and Programming Languages.Charles Antony Richard Hoare & J. C. Shepherdson - 1985 - Prentice-Hall.
    Direct download  
     
    Export citation  
     
    Bookmark  
  22.  36
    European meeting of the association for symbolic logic: Bristol, England, 1973.H. E. Rose & J. C. Shepherdson - 1974 - Journal of Symbolic Logic 39 (2):406-432.
  23.  9
    Logic Colloquium '73: Proceedings of the Logic Colloquium, Bristol, July 1973.H. E. Rose, J. C. Shepherdson & Association for Symbolic Logic - 1975 - North-Holland.
  24. Logic Colloquium ’73 Proceedings of the Logic Colloquium.H. E. Rose & J. C. Shepherdson (eds.) - 1975 - Elsevier.
    No categories
     
    Export citation  
     
    Bookmark  
  25.  15
    Recherche d'une Algèbre Logique Continue.Nicolas Rouche, Wolfe Mays, Henryk Greniewski, M. O. Rabin, D. Scott & J. C. Shepherdson - 1960 - Journal of Symbolic Logic 25 (2):163-164.
  26.  8
    Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory.J. C. Shepherdson, A. J. Kfoury, R. Statman & Robert E. Byerly - 1990 - Journal of Symbolic Logic 55 (2):876-878.
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  43
    Computerzing Mathematics: Logic and Computation.J. C. Shepherdson & Michael J. Beeson - 1991 - Journal of Symbolic Logic 56 (3):1090.
  28.  9
    Computer Programming and Formal Systems.J. C. Shepherdson, P. Braffort & D. Hirschberg - 1965 - Philosophical Quarterly 15 (61):371.
  29.  16
    Computability Theory, Semantics, and Logic Programming.J. C. Shepherdson & Melvin Fitting - 1988 - Journal of Symbolic Logic 53 (4):1257.
  30.  24
    G. P. Zykin. Zaméčanié ob odnoj téorémé Hao Vana . Algébra i logika, Séminar, vol. 2 no. 1 , pp. 33–35.J. C. Shepherdson - 1971 - Journal of Symbolic Logic 36 (3):534.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  9
    Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson & Yehoshua Bar-Hillel - 1968 - Journal of Symbolic Logic 33 (1):120-121.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  9
    Meeting of the association for symbolic logic.J. C. Shepherdson, S. Körner & M. D. Gladstone - 1964 - Journal of Symbolic Logic 29 (4):218-228.
  33.  14
    Mints type deductive calculi for logic programming.J. C. Shepherdson - 1992 - Annals of Pure and Applied Logic 56 (1-3):7-17.
    Mints has given a deductive calculus, a set of proof rules, for pure Prolog such that the goal X = A1,..., An succeeds in Prolog iff X is derivable in this calculus and X fails in Prolog iff ()X is derivable in this calculus. We summarise Mints' results and give appropriate modifications of his calculus to deal with use of negated goals in Prolog, SLD- resolution, SLDNF-resolution, extensions of SLDNF-resolution allowing negation as failure to be applied to nonground negative literals.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34.  18
    Note on a system of Myhill.J. C. Shepherdson - 1956 - Journal of Symbolic Logic 21 (3):261-264.
  35.  9
    Takeuti Gaisi. Axioms of infinity of set theory. Journal of the Mathematical Society of Japan, vol. 13 , pp. 220–233.J. C. Shepherdson - 1962 - Journal of Symbolic Logic 27 (3):354-355.
  36.  28
    Review: Azriel Levy, Axiom Schemata of Strong Infinity in Axiomatic Set Theory. [REVIEW]J. C. Shepherdson - 1962 - Journal of Symbolic Logic 27 (1):88-89.
  37.  63
    A. A. Fridman. Stépéni nérazréšimosti problémy toždéstva v konéčno oprédélénnyh gruppah. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 805–808. - A. A. Fridman. Degrees of insolvability of the word problem in finitely defined groups. English translation of the preceding by Sue Ann Walker. Soviet mathematics, vol. 3 no. 6 , pp. 1733–1737. - C. R. J. Clapham. Finitely presented groups with word problems of arbitrary degrees of insolubility. Proceedings of the London Mathematical Society, ser. 3 vol. 14 , pp. 633–676. - William W. Boone. Finitely presented group whose word problem has the same degree as that of an arbitrarily given Thue system . Proceedings of the National Academy of Sciences, vol. 53 , pp. 265–269. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A first paper on Thue systems. Annals of mathematics, ser. 2 vol. 83 , pp. 520–571. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely p. [REVIEW]J. C. Shepherdson - 1968 - Journal of Symbolic Logic 33 (2):296-297.
  38.  59
    Roger C. Lyndon. Notes on logic. D. Van Nostrand Company, Inc., Princeton, Toronto, and London, 1966. Reprinted 1967, vi + 97 pp. [REVIEW]J. C. Shepherdson - 1973 - Journal of Symbolic Logic 38 (4):644-646.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  37
    E. W. Beth. Some consequences of the theorem of Löwenheim-Skolem-Gödel-Malcev. Ibid., vol. 56 , pp. 66–71; and Ibid., vol. 15 , pp. 66–71. [REVIEW]J. C. Shepherdson - 1954 - Journal of Symbolic Logic 19 (1):61-62.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  40.  50
    C. R. J. Clapham. An embedding theorem for finitely generated groups. Proceedings of the London Mathematical Society, ser. 3 vol. 17 , pp. 419–430. [REVIEW]J. C. Shepherdson - 1970 - Journal of Symbolic Logic 35 (2):340-341.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  41.  21
    David Maier and David S. Warren. Computing with logic. Logic programming with Prolog. The Benjamin/Cummings Publishing Company, Menlo Park, Calif., etc., 1988, xxi + 535 pp. [REVIEW]J. C. Shepherdson - 1991 - Journal of Symbolic Logic 56 (4):1495.
  42.  22
    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. [REVIEW]J. C. Shepherdson - 1988 - Journal of Symbolic Logic 53 (4):1257-1257.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43. H. SCHOLZ and G. HASENJAEGER: "Grundzüge der Mathematischen Logik". [REVIEW]J. C. Shepherdson - 1963 - Ratio (Misc.) 5 (1):107.
    No categories
     
    Export citation  
     
    Bookmark  
  44.  8
    Kruse A. H.. Grothendieck universes and the super-complete models of Shepherdson. Composite mathematica, vol. 17 , pp. 96–101. [REVIEW]J. C. Shepherdson - 1972 - Journal of Symbolic Logic 37 (3):613-613.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  14
    Lévy Azriel. Axiom schemata of strong infinity in axiomatic set theory. Pacific journal of mathematics, vol. 10 , pp. 223–238. [REVIEW]J. C. Shepherdson - 1962 - Journal of Symbolic Logic 27 (1):88-89.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  46.  19
    Azriel Lévy. Indépendance conditionnelle de V = L et d'axiomes qui se rattache au système de M. Gödel. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 245 , pp. 1582–1583. [REVIEW]J. C. Shepherdson - 1959 - Journal of Symbolic Logic 24 (3):226-226.
  47.  8
    Michael J. Beeson. Computerizing mathematics: logic and computation. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 191–225. [REVIEW]J. C. Shepherdson - 1991 - Journal of Symbolic Logic 56 (3):1090-1091.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48.  4
    Reviews. [REVIEW]J. C. Shepherdson - 1964 - British Journal for the Philosophy of Science 15 (59):268-270.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  49.  6
    Review: A. H. Kruse, Grothendieck Universes and the Super-Complete Models of Shepherdson. [REVIEW]J. C. Shepherdson - 1972 - Journal of Symbolic Logic 37 (3):613-613.
  50.  10
    Review: Azriel Levy, Independance Conditionnelle de V = L et d'Axiomes qui se Rattachent au Systeme de M. Godel. [REVIEW]J. C. Shepherdson - 1959 - Journal of Symbolic Logic 24 (3):226-226.
1 — 50 / 64