A note on transfinite iteration

Journal of Symbolic Logic 21 (3):265-266 (1956)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269101

Links

PhilArchive



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

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

Almost All Complex Quantifiers are Simple.Jakub Szymanik - 2010 - In C. Ebert, G. Jäger, M. Kracht & J. Michaelis (eds.), Mathematics of Language 10/11, Lecture Notes in Computer Science 6149. Springer.
Imagination and the puzzles of iteration.Shaun Nichols - 2002 - Analysis 62 (3):182-87.
A note on Quine's treatment of transfinite recursion.Charles Parsons - 1964 - Journal of Symbolic Logic 29 (4):179-182.
Building iteration trees.Alessandro Andretta - 1991 - Journal of Symbolic Logic 56 (4):1369-1384.
A weak Dodd-Jensen lemma.Itay Neeman & John Steel - 1999 - Journal of Symbolic Logic 64 (3):1285-1294.
Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy.Harold T. Hodes - 1981 - Journal of Symbolic Logic 46 (4):753-760.
Finite support iteration and strong measure zero sets.Janusz Pawlikowski - 1990 - Journal of Symbolic Logic 55 (2):674-677.
Ordinal analysis without proofs.Jeremy Avigad - manuscript
A Note on the Physical Possibility of Transfinite Computation.Wayne Aitken & Jeffrey A. Barrett - 2010 - British Journal for the Philosophy of Science 61 (4):867-874.

Analytics

Added to PP
2009-01-28

Downloads
13 (#978,482)

6 months
1 (#1,459,555)

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