14 found
Order:
  1.  20
    Haskell B. Curry. The Undecidability of λK-Conversion. Foundations of Mathematics, Symposium Papers Commemorating the Sixtieth Birthday of Kurt Gödel, Edited by Jack J. Bulloff, Thomas C. Holyoke, and S. W. Hahn, Springer-Verlag, Berlin, Heidelberg, and New York, 1969, Pp. 10–14. [REVIEW]Richard J. Orgass - 1975 - Journal of Symbolic Logic 40 (2):246.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  2.  15
    Haskell B. Curry. The Deduction Theorem in the Combinatory Theory of Restricted Generality. Logique Et Analyse, N.S. Vol. 3 , Pp. 15–39. [REVIEW]Richard J. Orgass - 1970 - Journal of Symbolic Logic 35 (3):468-469.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  12
    Curry Haskell B.. Basic Verifiability in the Combinatory Theory of Restricted Generality. Essays on the Foundations of Mathematics, Dedicated to A. A. Fraenkel on His Seventieth Anniversary, Edited by Bar-Hillel Y., Poznanski E. I. J., Rabin M. O., and Robinson A. For The Hebrew University of Jerusalem, Magnes Press, Jerusalem 1961, and North-Holland Publishing Company, Amsterdam 1962, Pp. 165–189. [REVIEW]Richard J. Orgass - 1970 - Journal of Symbolic Logic 35 (3):469-470.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  27
    McCarthy J.. Towards a Mathematical Science of Computation. Information Processing 1962, Proceedings oflFIP Congress 62, Organized by the International Federation for Information Processing, Munich, 27 August-1 September 1962, Edited by Popplewell Cicely M., North-Holland Publishing Company, Amsterdam 1963, Pp. 21–28.McCarthy John. Problems in the Theory of Computation. Information Processing 1965, Proceedings of IFIP Congress 65, Organized by the International Federation for Information Processing, New York City, May 24–29, 1965, Volume I, Edited by Kalenich Wayne A., Spartan Books, Inc., Washington, D.C., and Macmillan and Co., Ltd., London, 1965, Pp. 219–222. [REVIEW]Richard J. Orgass - 1971 - Journal of Symbolic Logic 36 (2):346-347.
  5.  8
    Donald M. Kaplan. Some Completeness Results in the Mathematical Theory of Computation. Journal of the Association for Computing Machinery, Vol. 15 , Pp. 124–134. [REVIEW]Richard J. Orgass - 1975 - Journal of Symbolic Logic 40 (2):246-247.
  6.  14
    Meeting of the Association for Symbolic Logic, New York, 1971.Charles D. Parsons, Richard J. Orgass & Richmond H. Thomason - 1972 - Journal of Symbolic Logic 37 (2):430-447.
  7.  13
    Rose Alan. Computer Logic. Wiley-Interscience, John Wiley & Sons Ltd., London, New York, Sydney, and Toronto, 1971, Xii + 180 Pp. [REVIEW]Richard J. Orgass - 1978 - Journal of Symbolic Logic 43 (2):381-382.
  8.  14
    Review: Haskell B. Curry, Y. Bar-Hillel, E. I. J. Poznanski, M. O. Rabin, A. Robinson, Basic Verifiability in the Combinatory Theory of Restricted Generality. [REVIEW]Richard J. Orgass - 1970 - Journal of Symbolic Logic 35 (3):469-470.
  9.  21
    Meeting of the Association for Symbolic Logic.Charles D. Parsons, Richard J. Orgass & Richmond H. Thomason - 1972 - Journal of Symbolic Logic 37 (2):430-447.
  10.  11
    Review: Haskell B. Curry, The Deduction Theorem in the Combinatory Theory of Restricted Generality. [REVIEW]Richard J. Orgass - 1970 - Journal of Symbolic Logic 35 (3):468-469.
  11.  6
    Review: J. McCarthy, Cicely M. Popplewell, Towards a Mathematical Science of Computation; John McCarthy, Wayne A. Kalenich, Problems in the Theory of Computation. [REVIEW]Richard J. Orgass - 1971 - Journal of Symbolic Logic 36 (2):346-347.
  12.  6
    Review: Haskell B. Curry, The Undecidability of $Lambda$K-Conversion. [REVIEW]Richard J. Orgass - 1975 - Journal of Symbolic Logic 40 (2):246-246.
  13.  5
    Review: Donald M. Kaplan, Some Completeness Results in the Mathematical Theory of Computation. [REVIEW]Richard J. Orgass - 1975 - Journal of Symbolic Logic 40 (2):246-247.
  14.  2
    Review: Alan Rose, Computer Logic. [REVIEW]Richard J. Orgass - 1978 - Journal of Symbolic Logic 43 (2):381-382.