- 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 John Staples
7 found
Order:
- Truth in constructive metamathematics.John Staples - 1978 - Notre Dame Journal of Formal Logic 19 (3):489-494.
- Combinator realizability of a constructive Morse set theory.John Staples - 1974 - Journal of Symbolic Logic 39 (2):226-234.
- Combinator realizability of constructive finite type analysis.John Staples - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 253--273.
- Efficient Combinatory Reduction.John Staples - 1981 - Mathematical Logic Quarterly 27 (25‐30):391-402.
- Efficient Combinatory Reduction.John Staples - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (25-30):391-402.
- R. L. Goodstein and J. Hooley. On recursive transcendence. Notre Dame journal of formal logic, vol. 1 , pp. 127–137.John Staples - 1970 - Journal of Symbolic Logic 35 (2):335.
- Review: R. L. Goodstein, J. Hooley, On Recursive Transcendence. [REVIEW]John Staples - 1970 - Journal of Symbolic Logic 35 (2):335-335.
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-7c76586df8-hc2g5 uwo