Order:
  1.  92
    Theory of Recursive Functions and Effective Computability.H. Rogers - 1987 - MIT Press.
  2.  30
    Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
  3.  13
    Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
  4.  37
    The Role of the OECD and EU Conventions in Combating Bribery of Foreign Public Officials.Carl Pacini, Judyth A. Swingen & Hudson Rogers - 2002 - Journal of Business Ethics 37 (4):385 - 405.
    The OECD Convention on Combating Bribery of Foreign Public Officials in International Business Transactions (the OECD Convention) obligates signatory nations to make bribery of foreign public officials a criminal act on an extraterritorial basis. The purposes of this article are to describe the nature and consequences of bribery, outline the major provisions of the OECD Convention, and analyze its role in promoting transparency and accountability in international business. While the OECD Convention is not expected to totally eliminate the seeking or (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  5.  42
    Gödel Numberings of Partial Recursive Functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
  6.  23
    Head-Heart Disparity Among Future Managers: Implications for Ethical Conduct. [REVIEW]C. M. Kochunny & Hudson Rogers - 1994 - Journal of Business Ethics 13 (9):719 - 729.
    An examination of the ethical perceptions of business students using Macobby''s head/heart traits and a comparison to earlier studies of managers, accountants, and business students is made. The data were collected at three universities that are similar in size, enrollment and degree programs within the College of Business. Results indicate that present day business students are no less ethically inclined than are their business counterparts in previous eras. In general head traits dominated over heart traits, an indication that business schools (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7.  6
    The Present Theory of Turing Machine Computability.C. E. M. Yates & Hartley Rogers - 1966 - Journal of Symbolic Logic 31 (3):513.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  14
    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]Hartley Rogers - 1965 - Journal of Symbolic Logic 30 (1):90-90.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  9.  12
    Descriptive Set Theory in L Ω 1 Ω.Robert Vaught, A. R. D. Mathias & H. Rogers - 1982 - Journal of Symbolic Logic 47 (1):217-218.
  10.  9
    Review: A. A. Mucnik, Solution of Post's Reduction Problem and of Certain Other Problems in the Theory of Algorithms. I. [REVIEW]Hartley Rogers - 1965 - Journal of Symbolic Logic 30 (1):90-90.
  11.  5
    Lewis Guy Rohrbaugh 1884-1972.Frederick Ferre, Elmer C. Herber & Horace E. Rogers - 1971 - Proceedings and Addresses of the American Philosophical Association 45:222 - 223.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  12. Cambridge Summer School in Mathematical Logic.A. R. D. Mathias & H. Rogers (eds.) - 1973 - New York: Springer Verlag.
  13. Cambridge Summer School in Mathematical Logic Held in Cambridge/England, August 1-21, 1971.A. R. D. Mathias & H. Rogers - 1973 - Springer.
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  6
    C. E. M. Yates. Three Theorems on the Degrees of Recursively Enumerable Sets. Duke Mathematical Journal, Vol. 32 , Pp. 461–468. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-395.
  15.  7
    Effects of Switching Contingencies in a Two-Choice Situation.Howard E. Rogers, Richard S. Keister & Donald T. Williams - 1973 - Journal of Experimental Psychology 97 (2):242.
  16.  4
    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]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.
  17.  22
    Feferman Solomon. Degrees of Unsolvability Associated with Classes of Formalized Theories. [REVIEW]Hartley Rogers - 1962 - Journal of Symbolic Logic 27 (1):85-86.
  18.  12
    Grzegorczyk Andrzej. Undecidability of Some Topological Theories. Fundamenta Mathematicae, Vol. 38 , Pp. 137–152.Hartley Rogers - 1953 - Journal of Symbolic Logic 18 (1):73-74.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19.  7
    H. B. Enderton. On Provable Recursive Functions. Notre Dame Journal of Formal Logic, Vol. 9 No. 1 , Pp. 86–88.Hartley Rogers - 1973 - Journal of Symbolic Logic 38 (3):526-527.
  20.  6
    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]Hartley Rogers - 1954 - Journal of Symbolic Logic 19 (4):278-282.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  21.  2
    In Memoriam.Hartley Rogers - 1976 - Annals of Mathematical Logic 9 (1-2):v.
    No categories
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  22.  14
    Julia Robinson. The Undecidability of Exponential Diophantine Equations. Logic, Methodology and Philosophy of Science, Proceedings of the 1960 International Congress, Edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, Calif., 1962, Pp. 12–13. [REVIEW]Hartley Rogers - 1970 - Journal of Symbolic Logic 35 (1):152.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  3
    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]Hartley Rogers - 1956 - Journal of Symbolic Logic 21 (4):407-408.
  24.  10
    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]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):226-226.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  25.  11
    Mučnik A. A.. Nérazréšimost′ problémy svodimosti téorii algoritmov . Doklady Akadéimii Nauk SSSR, vol. 108 , pp. 194–197. [REVIEW]Hartley Rogers - 1957 - Journal of Symbolic Logic 22 (2):218-219.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  26.  24
    Martin Davis, Hilary Putnam, and Julia Robinson. The Decision Problem for Exponential Diophantine Equations. Annals of Mathematics, Second Series Vol. 74 , Pp. 425–436. [REVIEW]Hartley Rogers - 1970 - Journal of Symbolic Logic 35 (1):151-152.
  27. Review: A. A. Mucnik, Negative Answer to the Problem of Reducibility of the Theory of Algorithms. [REVIEW]Hartley Rogers - 1957 - Journal of Symbolic Logic 22 (2):218-219.
  28.  1
    Review: Andrzej Grzegorczyk, Undecidability of Some Topological Theories. [REVIEW]Hartley Rogers - 1953 - Journal of Symbolic Logic 18 (1):73-74.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29. Review: C. E. M. Yates, Recursively Enumerable Sets and Retracting Functions. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-394.
  30. Review: C. E. M. Yates, Three Theorems on the Degrees of Recursively Enumerable Sets. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-395.
  31.  8
    Review: Clifford Spector, Measure-Theoretic Construction of Incomparable Hyperdegrees. [REVIEW]Hartley Rogers - 1962 - Journal of Symbolic Logic 27 (2):242-242.
  32.  8
    Review: Daniel Lacombe, Sur le Semi-Reseau Constitue par les Degres d'Indecidabilite Recursive. [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):226-226.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  33.  4
    Review: H. Hermes, H. Scholz, Mathematische Logik. [REVIEW]Hartley Rogers - 1954 - Journal of Symbolic Logic 19 (4):278-282.
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  34.  1
    Review: Heinrich Scholz, Vorlesungen uber Grundzuge der Mathematischen Logik. Vol. 1; Heinrich Scholz, Vorlesungen uber Grundzuge der Mathematischen Logik. Vol. 2. [REVIEW]Hartley Rogers - 1954 - Journal of Symbolic Logic 19 (2):115-118.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  35.  4
    Review: R. M. Friedberg, Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability (Solution of Post's Problem, 1944). [REVIEW]Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (2):225-226.
  36.  9
    Review: S. C. Kleene, Emil L. Post, The Upper Semi-Lattice of Degrees of Recursive Unsolvability. [REVIEW]Hartley Rogers - 1956 - Journal of Symbolic Logic 21 (4):407-408.
  37.  6
    Spector Clifford. Measure-Theoretic Construction of Incomparable Hyperdegrees. [REVIEW]Hartley Rogers - 1962 - Journal of Symbolic Logic 27 (2):242-242.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38.  12
    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]Hartley Rogers - 1954 - Journal of Symbolic Logic 19 (2):115-118.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  39.  13
    Shoenfield J. R.. Open Sentences and the Induction Axiom.Hartley Rogers - 1962 - Journal of Symbolic Logic 27 (1):90-91.
  40.  13
    The Fixed Period: Trollope's 'Modest Proposal'.Henry N. Rogers - 1999 - Utopian Studies 10 (2):16-24.
  41.  16
    The Undecidability of Exponential Diophantine Equations.Hartley Rogers & Julia Robinson - 1970 - Journal of Symbolic Logic 35 (1):152.