21 found
Order:
  1. Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
  2.  6
    Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
    Direct download  
     
    Export citation  
     
    Bookmark   105 citations  
  3.  41
    Measure-theoretic construction of incomparable hyperdegrees.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (3):280-288.
  4.  11
    N. A. Routledge. Ordinal recursion. Proceedings of the Cambridge Philosophical Society, vol. 49 , pp. 175–182.Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):69-69.
  5.  4
    N. A. Routledge. Concerning definable sets. Fundamenta mathematicae, vol. 41 no. 1 , pp. 6–11.Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):69-69.
  6.  19
    Davis Martin. Computability & unsolvability. McGraw-Hill series in information processing and computers. McGraw-Hill Book Company, Inc., New York-Toronto-London 1958, xxv + 210 pp. [REVIEW]Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
  7.  23
    Gál I. L., Rosser J. B., and Scott D.. Generalization of a lemma of G. F. Rose. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):179-179.
  8.  21
    Porte Jean. Une simplification de la théorie de Turing. Ier Congrès International de Cybernétique, Namur, 26–29 Juin 1956, Actes, Gauthier-Villars, Paris, and Association Internationale de Cybernétique, Namur, 1958, pp. 251–280. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):162-162.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  3
    Review: Francois Paycha, Epistemologie et Mecanisation du Diagnostic et de la Therapeutique. La Logique Ternaire. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):163-163.
  10.  20
    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]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):70-70.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  4
    Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):70-70.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  7
    Review: Hao Wang, On Denumerable Bases of Formal Systems. [REVIEW]Clifford Spector - 1957 - Journal of Symbolic Logic 22 (3):292-293.
  13. Review: Heinz Zemanek, Une Machine Pour l'Algebre des Contacts. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):163-163.
  14.  14
    Review: Jean Porte, Une Simplification de la Theorie de Turing. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):162-162.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  3
    Review: Martin Davis, Computability & Unsolvability. [REVIEW]Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
  16.  2
    N. A. Routledge. Ordinal recursion. Proceedings of the Cambridge Philosophical Society, vol. 49 , pp. 175–182. [REVIEW]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):69-69.
  17.  2
    N. A. Routledge. Ordinal recursion. Proceedings of the Cambridge Philosophical Society, vol. 49 , pp. 175–182. [REVIEW]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):69-69.
  18. Review: Raymond M. Smullyan, Undecidability and Recursive Inseparability. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):165-165.
  19.  9
    Smullyan Raymond M.. Undecidability and recursive inseparability. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4 , pp. 143–147. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):165-165.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20.  5
    Wang Hao. On denumerable bases of formal systems. Mathematical interpretation of formal systems. Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1955, pp. 57–84. [REVIEW]Clifford Spector - 1957 - Journal of Symbolic Logic 22 (3):292-293.
  21.  10
    Zemanek Heinz. Une machine pour l'algèbre des contacts. Ier Congrès International de Cybernétique, Namur, 26–29 Juin 1956, Actes, Gauthier-Villars, Paris, and Association Internationale de Cybernétique, Namur, 1958, pp. 232–234. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):163-163.