Order: Listing date First author Impact Pub year Relevance Downloads Order
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. details 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. details Set Theory and Its Logic. J. C. Shepherdson Willard Van Orman Quine 1963 - Philosophical Quarterly 15 (61):371. details 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. details Walter Oberschelp. Varianten von Turingmaschinen. Archiv für mathematische Logik und Grundlagenforschung, vol. 4 , pp. 53–62. [REVIEW] J. C. Shepherdson 1971 - Journal of Symbolic Logic 36 (3):534. details 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. details Gödel's Second Incompleteness Theorem for Q. A. Bezboruah J. C. Shepherdson 1976 - Journal of Symbolic Logic 41 (2):503-512. details A Non-Standard Model for a Free Variable Fragment of Number Theory. J. C. Shepherdson 1965 - Journal of Symbolic Logic 30 (3):389-390. details 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. details Computability of Recursive Functions. J. C. Shepherdson H. E. Sturgis 1967 - Journal of Symbolic Logic 32 (1):122-123. details Effective Operations on Partial Recursive Functions. J. Myhill J. C. Shepherdson 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (4):310-317. details 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. details Effective Operations on Partial Recursive Functions. J. Myhill J. C. Shepherdson 1955 - Mathematical Logic Quarterly 1 (4):310-317. details On the Interpretation of Aristotelian Syllogistic. J. C. Shepherdson 1956 - Journal of Symbolic Logic 21 (2):137-147. details On the Definition of Computable Function of a Real Variable. J. C. Shepherdson 1976 - Mathematical Logic Quarterly 22 (1):391-402. details Inner Models for Set Theory—Part II. J. C. Shepherdson 1952 - Journal of Symbolic Logic 17 (4):225-237. details Computerzing Mathematics: Logic and Computation. J. C. Shepherdson Michael J. Beeson 1991 - Journal of Symbolic Logic 56 (3):1090. details 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. details 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. details 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. details Inner Models for Set Theory—Part I. J. C. Shepherdson 1951 - Journal of Symbolic Logic 16 (3):161-190. details Inner Models for Set Theory – Part III. J. C. Shepherdson 1953 - Journal of Symbolic Logic 18 (2):145-167. details Machine Configuration and Word Problems of Given Degree of Unsolvability. J. C. Shepherdson 1965 - Mathematical Logic Quarterly 11 (2):149-175. details Inner Models for Set Theory. J. C. Shepherdson 1953 - Journal of Symbolic Logic 18 (4):342-343. details Computability Theory, Semantics, and Logic Programming. J. C. Shepherdson Melvin Fitting 1988 - Journal of Symbolic Logic 53 (4):1257. details Review: Michael O. Rabin, On Recursively Enumerable and Arithmetic Models of Set Theory. [REVIEW] J. C. Shepherdson 1963 - Journal of Symbolic Logic 28 (2):167-168. details 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. details Review: C. R. J. Clapham, An Embedding Theorem for Finitely Generated Groups. [REVIEW] J. C. Shepherdson 1970 - Journal of Symbolic Logic 35 (2):340-341. details Mints Type Deductive Calculi for Logic Programming. J. C. Shepherdson 1992 - Annals of Pure and Applied Logic 56 (1-3):7-17. details Review: Roger C. Lyndon, Notes on Logic. [REVIEW] J. C. Shepherdson 1973 - Journal of Symbolic Logic 38 (4):644-646. details [Omnibus Review]. J. C. Shepherdson 1968 - Journal of Symbolic Logic 33 (2):296-297. details 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. details 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. details Reviews - Paul Bernays. Zur Frage der Unendlichkeitsschemata in der Axiomatischen Mengenlehre. Essays on the Foundations of Mathematics, Dedicated to A. A. Fraenkel on His Seventieth Anniversary, Edited by Y. Bar-Hillel, E. I. J. Poznanski, M. O. Rabin, and A. Robinson for The Hebrew University of Jerusalem, Magnes Press, Jerusalem1961, and North-Holland Publishing Company, Amsterdam 1962, Pp. 3–49. [REVIEW] J. C. Shepherdson 1962 - Journal of Symbolic Logic 27 (3):353-354. details Logic Colloquium '73 Proceedings of the Logic Colloquium, Bristol, July 1973. H. E. Rose J. C. Shepherdson Association for Symbolic Logic 1975 details An Intuitionistic Theory of Types: Predicative Part. H. E. Rose J. C. Shepherdson 1984 - Journal of Symbolic Logic 49 (1):311-313. details Review: C. Y. Lee, Automata and Finite Automata. [REVIEW] J. C. Shepherdson 1971 - Journal of Symbolic Logic 36 (3):534-535. details 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. details Review: G. P. Zykin, Comment on a Theorem of Hao Wang. [REVIEW] J. C. Shepherdson 1971 - Journal of Symbolic Logic 36 (3):534-534. details 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. details Note on a System of Myhill. J. C. Shepherdson 1956 - Journal of Symbolic Logic 21 (3):261-264. details 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-61. details 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. details Review: Alfred Tarski, A Simplified Formalization of Predicate Logic with Identity. [REVIEW] J. C. Shepherdson 1974 - Journal of Symbolic Logic 39 (3):602-603. details 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. details Review: Gaisi Takeuti, Axioms of Infinity of Set Theory. [REVIEW] J. C. Shepherdson 1962 - Journal of Symbolic Logic 27 (3):354-355. details 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. details 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. details Computer Programming and Formal Systems. J. C. Shepherdson P. Braffort D. Hirschberg 1965 - Philosophical Quarterly 15 (61):371. details Review: Paul Bernays, Zur Frage der Unendlichkeitsschemata in der Axiomatischen Mengenlehre. [REVIEW] J. C. Shepherdson 1962 - Journal of Symbolic Logic 27 (3):353-354. details
Off-campus access
Using PhilPapers from home?
Create an account to enable off-campus access through your institution's proxy server.
Monitor this page
Be alerted of all new items appearing on this page. Choose how you want to monitor it:
Email
RSS feed
