21 found
Order:
  1. Recursive Well-Orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
  2.  25
    Measure-Theoretic Construction of Incomparable Hyperdegrees.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (3):280-288.
  3.  15
    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.
  4.  13
    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  
  5.  11
    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.
  6.  11
    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  
  7.  8
    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  
  8.  10
    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.
  9.  3
    Review: Hao Wang, On Denumerable Bases of Formal Systems. [REVIEW]Clifford Spector - 1957 - Journal of Symbolic Logic 22 (3):292-293.
  10.  6
    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.
  11.  5
    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)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  12. 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.
  13. Review: Raymond M. Smullyan, Undecidability and Recursive Inseparability. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):165-165.
  14.  1
    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.
  15. 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  
  16. Review: Heinz Zemanek, Une Machine Pour l'Algebre des Contacts. [REVIEW]Clifford Spector - 1960 - Journal of Symbolic Logic 25 (2):163-163.
  17. Review: Martin Davis, Computability & Unsolvability. [REVIEW]Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
  18. 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.
  19. 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.
  20. 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.  4
    Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
    Direct download  
     
    Export citation  
     
    Bookmark   105 citations