Search results for 'Hartley Rogers Jr' (try it on Scholar)

1000+ found
Order:
  1. C. E. M. Yates (1971). Reviews. Hartley Rogers Jr., Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York, St. Louis, San Francisco, Toronto, London, and Sydney, 1967, Xix + 482 Pp. [REVIEW] Journal of Symbolic Logic 36 (1):141-146.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2.  2
    C. E. M. Yates (1996). Rogers Hartley Jr., The Present Theory of Turing Machine Computability. Journal of the Society for Industrial and Applied Mathematics, Vol. 7 (1959), Pp. 114–130. [REVIEW] Journal of Symbolic Logic 31 (3):513-513.
    Direct download  
     
    Export citation  
     
    My bibliography  
  3. Wilhelm Ackermann (1957). Rogers Hartley Jr. Certain Logical Reduction and Decision Problems. Annals of Mathematics, Bd. 64 , S. 264–284. Journal of Symbolic Logic 22 (2):217-218.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  4. J. L. Britton (1969). Boone William W. And Rogers Hartley Jr. On a Problem of J. H. C. Whitehead and a Problem of Alonzo Church. Mathematica Scandinavica, Vol. 19 , Pp. 185–192. [REVIEW] Journal of Symbolic Logic 34 (3):506-507.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  5. Martin Davis (1964). Rogers Hartley Jr., Gödel Numberings of Partial Recursive Functions. Journal of Symbolic Logic 29 (3):146.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  6. William E. Gould (1972). Rogers Hartley Jr., An Example in Mathematical Logic. The American Mathematical Monthly, Vol. 70 , Pp. 929–945. Journal of Symbolic Logic 37 (3):616-617.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  7. Steven Orey (1960). Rogers Hartley Jr., Computing Degrees of Unsolvability. Mathematische Annalen, Vol. 138 . Pp. 125–140.Rogers Hartley Jr., Computing Degrees of Unsolvability. Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, Pp. 277–283. [REVIEW] Journal of Symbolic Logic 25 (4):363-364.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  8. Wayne Richter (1996). Kreider DL and Rogers Hartley Jr, Constructive Versions of Ordinal Number Classes. Transactions of the American Mathematical Society, Vol. 100 (1961), Pp. 325–369. [REVIEW] Journal of Symbolic Logic 31 (1):134-135.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  9. Gerald E. Sacks (1960). Friedberg Richard M. And Rogers Hartley Jr., Reducibility and Completeness for Sets of Integers. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 5 , Pp. 117–125. [REVIEW] Journal of Symbolic Logic 25 (4):362-363.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  10. J. R. Shoenfield (1962). Rogers Hartley Jr., Recursive Functions Over Well-Ordered Partial Orderings. Proceedings of the American Mathematical Society, Vol. 10 , Pp. 847–853. [REVIEW] Journal of Symbolic Logic 27 (1):83-84.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  11. Clifford Spector (1959). Rogers Hartley Jr., Theory of Recursive Functions and Effective Computability. Volume I. Mimeographed. Technology Store, Cambridge, Mass., 1957, Pp. I–Xiv, 1–15, 15a, 16–20, 20a, 21–121, 121–155. [REVIEW] Journal of Symbolic Logic 24 (1):70.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. C. E. M. Yates (1996). Rogers Hartley Jr., On Universal Functions. Proceedings of the American Mathematical Society, Vol. 16 (1965), Pp. 39–44. [REVIEW] Journal of Symbolic Logic 31 (3):513-513.
    Direct download  
     
    Export citation  
     
    My bibliography  
  13. Francis Millet Rogers (1954). Two Old Portuguese Versions of the Life of Saint Alcobacenses 36 and 266Joseph H. D. Allen, Jr. Speculum 29 (2, Part 1):251-254.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  14. Eugene F. Rogers, Jr (2000). The Liturgical Body. Modern Theology 16 (3):365-376.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  15.  4
    Richard M. Friedberg & Hartley Rogers (1959). Reducibility and Completeness for Sets of Integers. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  16.  2
    Richard M. Friedberg & Hartley Rogers (1959). Reducibility and Completeness for Sets of Integers. Mathematical Logic Quarterly 5 (7‐13):117-125.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   19 citations  
  17. Hartley Rogers (1967). Review: C. E. M. Yates, Recursively Enumerable Sets and Retracting Functions. [REVIEW] Journal of Symbolic Logic 32 (3):394-394.
     
    Export citation  
     
    My bibliography  
  18.  3
    Hartley Rogers (1958). Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944). [REVIEW] Journal of Symbolic Logic 23 (2):225-226.
  19.  3
    Hartley Rogers (1970). Review: Martin Davis, Hilary Putnam, Julia Robinson, The Decision Problem for Exponential Diophantine Equations. [REVIEW] Journal of Symbolic Logic 35 (1):151-152.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  20.  2
    Hartley Rogers (1965). Review: A. A. Mucnik, Solution of Post's Reduction Problem and of Certain Other Problems in the Theory of Algorithms. I. [REVIEW] Journal of Symbolic Logic 30 (1):90-90.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  21.  1
    Hartley Rogers (1957). Review: A. A. Mucnik, Negative Answer to the Problem of Reducibility of the Theory of Algorithms. [REVIEW] Journal of Symbolic Logic 22 (2):218-219.
    Direct download  
     
    Export citation  
     
    My bibliography  
  22.  2
    Hartley Rogers (1958). Review: Daniel Lacombe, Sur le Semi-Reseau Constitue par les Degres d'Indecidabilite Recursive. [REVIEW] Journal of Symbolic Logic 23 (2):226-226.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23. Hartley Rogers (1967). Review: C. E. M. Yates, Three Theorems on the Degrees of Recursively Enumerable Sets. [REVIEW] Journal of Symbolic Logic 32 (3):394-395.
     
    Export citation  
     
    My bibliography  
  24.  1
    Hartley Rogers (1954). Review: H. Hermes, H. Scholz, Mathematische Logik. [REVIEW] Journal of Symbolic Logic 19 (4):278-282.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  25.  1
    Hartley Rogers (1973). Review: H. B. Enderton, On Provable Recursive Functions. [REVIEW] Journal of Symbolic Logic 38 (3):526-527.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26.  1
    Hartley Rogers (1962). Review: Solomon Feferman, Degrees of Unsolvability Associated with Classes of Formalized Theories; J. R. Shoenfield, Degrees of Formal Systems. [REVIEW] Journal of Symbolic Logic 27 (1):85-86.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  27. Hartley Rogers (1970). Davis Martin, Putnam Hilary, and Robinson Julia. The Decision Problem for Exponential Diophantine Equations. Annals of Mathematics, Second Series Vol. 74 , Pp. 425–436. [REVIEW] Journal of Symbolic Logic 35 (1):151-152.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  28. Hartley Rogers (1973). Enderton H. B.. On Provable Recursive Functions. Notre Dame Journal of Formal Logic, Vol. 9 No. 1 , Pp. 86–88. Journal of Symbolic Logic 38 (3):526-527.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  29. Hartley Rogers (1958). Friedberg R. M.. Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability . Proceedings of the National Academy of Sciences of the United States of America, Vol. 43 , Pp. 236–238. [REVIEW] Journal of Symbolic Logic 23 (2):225-226.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30. Hartley Rogers (1962). Feferman Solomon. Degrees of Unsolvability Associated with Classes of Formalized Theories. Journal of Symbolic Logic 27 (1):85-86.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  31. Hartley Rogers (1953). Grzegorczyk Andrzej. Undecidability of Some Topological Theories. Fundamenta Mathematicae, Vol. 38 , Pp. 137–152. Journal of Symbolic Logic 18 (1):73-74.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  32. Hartley Rogers (1954). Hermes H. and Scholz H.. Mathematische Logik. Enzyklopädie der mathematischen Wissenschaften, Band I, Algebra und Zahlentheorie, 1. Teil, Heft 1, Teil I, B.G. Teubner, Leipzig 1952, 82 pp. [REVIEW] Journal of Symbolic Logic 19 (4):278-282.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33. Hartley Rogers (1976). In Memoriam. Annals of Mathematical Logic 9 (1-2):v.
    No categories
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34. Hartley Rogers (1956). Kleene S. C. And Post Emil L.. The Upper Semi-Lattice of Degrees of Recursive Unsolvability. Annals of Mathematics, Ser. 2 Vol. 59 , Pp. 379–407. [REVIEW] Journal of Symbolic Logic 21 (4):407-408.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35. Hartley Rogers (1958). Lacombe Daniel. Sur le Semi-Réseau Constitué Par les Degrés d'Indécidabilité Récursive. Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences , Vol. 239 , Pp. 1108–1109. [REVIEW] Journal of Symbolic Logic 23 (2):226.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36. Hartley Rogers (1957). Mučnik A. A.. Nérazréšimost′ problémy svodimosti téorii algoritmov . Doklady Akadéimii Nauk SSSR, vol. 108 , pp. 194–197. [REVIEW] Journal of Symbolic Logic 22 (2):218-219.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  37. Hartley Rogers (1965). Mučnik A. A.. Réšénié problémy svodimosti Posta i nékotoryh drugih problém téorii algorifmou. I. Trudy Moskovskogo Matématičéskogo Obščéstva, vol. 7 , pp. 391–405. [REVIEW] Journal of Symbolic Logic 30 (1):90.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  38. Martha E. Rogers, Violet M. Malinski, Elizabeth Ann Manhart Barrett & John R. Phillips (1994). Martha E. Rogers Her Life and Her Work. Monograph Collection (Matt - Pseudo).
     
    Export citation  
     
    My bibliography  
  39. Hartley Rogers (1953). Review: Andrzej Grzegorczyk, Undecidability of Some Topological Theories. [REVIEW] Journal of Symbolic Logic 18 (1):73-74.
    Direct download  
     
    Export citation  
     
    My bibliography  
  40. Hartley Rogers (1962). Review: Clifford Spector, Measure-Theoretic Construction of Incomparable Hyperdegrees. [REVIEW] Journal of Symbolic Logic 27 (2):242-242.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  41. Hartley Rogers (1954). Review: Heinrich Scholz, Vorlesungen uber Grundzuge der Mathematischen Logik. Vol. 1; Heinrich Scholz, Vorlesungen uber Grundzuge der Mathematischen Logik. Vol. 2. [REVIEW] Journal of Symbolic Logic 19 (2):115-118.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  42. Hartley Rogers (1962). Review: J. R. Shoenfield, Open Sentences and the Inducation Axiom. [REVIEW] Journal of Symbolic Logic 27 (1):90-91.
  43. Hartley Rogers (1970). Review: Julia Robinson, The Undecidability of Exponential Diophantine Equations. [REVIEW] Journal of Symbolic Logic 35 (1):152-152.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  44. Hartley Rogers (1970). Robinson Julia. The Undecidability of Exponential Diophantine Equations. Logic, Methodology and Philosophy of Science, Proceedings of the 1960 International Congress, Edited by Nagel Ernest, Suppes Patrick, and Tarski Alfred, Stanford University Press, Stanford, Calif., 1962, Pp. 12–13. [REVIEW] Journal of Symbolic Logic 35 (1):152.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45. Hartley Rogers (1956). Review: S. C. Kleene, Emil L. Post, The Upper Semi-Lattice of Degrees of Recursive Unsolvability. [REVIEW] Journal of Symbolic Logic 21 (4):407-408.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46. Hartley Rogers (1962). Spector Clifford. Measure-Theoretic Construction of Incomparable Hyperdegrees. Journal of Symbolic Logic 27 (2):242.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  47. Hartley Rogers (1954). Scholz Heinrich. Vorlesungen über Grundzüge der mathematischen Logik. Second, revised edition, vol. 1. Rotaprint. Ausarbeitungen mathematischer und physikalischer Vorlesungen, vol. VI. Aschendorffsche Verlagsbuchhandlung, Münster 1950, XIV + 276 pp.Scholz Heinrich. Vorlesungen über Grundzüge der mathematischen Logik. Second, revised edition, vol. 2. Rotaprint. Ausarbeitungen mathematischer und physikalischer Vorlesungen, vol. VII. Aschendorffsche Verlagsbuchhandlung, Münster 1951, VII + 192 pp. [REVIEW] Journal of Symbolic Logic 19 (2):115-118.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  48. Hartley Rogers (1962). Shoenfield J. R.. Open Sentences and the Induction Axiom. Journal of Symbolic Logic 27 (1):90-91.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  49. Hartley Rogers & Julia Robinson (1970). The Undecidability of Exponential Diophantine Equations. Journal of Symbolic Logic 35 (1):152.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50. Hartley Rogers (1967). Yates C. E. M.. Three Theorems on the Degrees of Recursively Enumerable Sets. Duke Mathematical Journal, Vol. 32 , Pp. 461–468. [REVIEW] Journal of Symbolic Logic 32 (3):394-395.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000