- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Clifford Spector
10 found
Order:
- (1 other version)Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
- (1 other version)Measure-theoretic construction of incomparable hyperdegrees.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (3):280-288.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-f8568656d-t7p9b uwo