Charles Parsons. A note on Quine's treatment of transfinite recursion. The journal of symbolic logic, vol. 29 no. 4 , pp. 179–182

Journal of Symbolic Logic 37 (4):769 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272456

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Charles Parsons, A Note on Quine's Treatment of Transfinite Recursion. [REVIEW]G. T. Kneebone - 1972 - Journal of Symbolic Logic 37 (4):769-769.
A Note on Quine's Treatment of Transfinite Recursion.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (4):769-769.
A note on Quine's treatment of transfinite recursion.Charles Parsons - 1964 - Journal of Symbolic Logic 29 (4):179-182.
Charles Parsons. On a number theoretic choice schema and its relation to induction. Intuitionism and proof theory, Proceedings of the summer conference at Buffalo N.Y. 1968, edited by A. Kino, J. Myhill, and R. E. Vesley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London 1970, pp. 459–473. - Charles Parsons. Review of the foregoing. Zentralblatt für Mathematik and ihre Grenzgebiete, vol. 202 , pp. 12–13. - Charles Parsons. On n-quantifier induction. The journal of symbolic logic, vol. 37 , pp. 466–482. [REVIEW]Helmut Schwichtenberg - 1974 - Journal of Symbolic Logic 39 (2):342.
Functionals defined by transfinite recursion.W. W. Tait - 1965 - Journal of Symbolic Logic 30 (2):155-174.
Review: M. Machover, The Theory of Transfinite Recursion. [REVIEW]Jon Barwise - 1970 - Journal of Symbolic Logic 35 (2):335-335.
Functionals Defined by Transfinite Recursion.R. E. Vesley & W. W. Tait - 1966 - Journal of Symbolic Logic 31 (3):509.
Transfinite recursion in higher reverse mathematics.Noah Schweber - 2015 - Journal of Symbolic Logic 80 (3):940-969.
Eliminating the ordinals from proofs. An analysis of transfinite recursion.Edoardo Rivello - 2014 - In Proceedings of the conference "Philosophy, Mathematics, Linguistics. Aspects of Interaction", St. Petersburg, April 21-25, 2014. pp. 174-184.
Machover M.. The theory of transfinite recursion. Bulletin of the American Mathematical Society. vol. 67 . pp. 575–578.Jon Barwise - 1970 - Journal of Symbolic Logic 35 (2):335-335.
Review: Charles Parsons, A. Kino, J. Myhill, R. E. Vesley, On a Number Theoretic Choice Schema and its Relation to Induction; Charles Parsons, Review of the Foregoing; Charles Parsons, On $n$-Quantifier Induction. [REVIEW]Helmut Schwichtenberg - 1974 - Journal of Symbolic Logic 39 (2):342-342.
In Memoriam: Willard van Orman Quine 1908–2000.Dagfinn Føllesdal & Charles Parsons - 2002 - Bulletin of Symbolic Logic 8 (1):105-110.
A note on transfinite iteration.Gideon Schwarz - 1956 - Journal of Symbolic Logic 21 (3):265-266.
A Note on Transfinite Iteration.Gideon Schwarz - 1957 - Journal of Symbolic Logic 22 (3):303-303.
Thomas Strahm. Autonomous fixed point progressions and fixed point transfinite recursion. Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Hájek, and Pavel Pudlák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2000, pp. 449–464. [REVIEW]Andrea Cantini - 2001 - Bulletin of Symbolic Logic 7 (4):535-536.

Analytics

Added to PP
2016-06-30

Downloads
17 (#815,534)

6 months
3 (#880,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references