Switch to: References

Citations of:

Describing ordinals using functionals of transfinite type

Journal of Symbolic Logic 37 (1):35-47 (1972)

Add citations

You must login to add citations.

A comparison of two systems of ordinal notations.Harold Simmons - 2004 - Archive for Mathematical Logic 43 (1):65-83.details The standard method of generating countable ordinals from uncountable ordinals can be replaced by a use of fixed point extractors available in the term calculus of Howard’s system. This gives a notion of the intrinsic complexity of an ordinal analogous to the intrinsic complexity of a function described in Gödel’s T. Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Proof Theory in Logic and Philosophy of Logic Direct download (3 more) Export citation Bookmark 1 citation
Recursive categoricity and recursive stability.John N. Crossley, Alfred B. Manaster & Michael F. Moses - 1986 - Annals of Pure and Applied Logic 31:191-204.details Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Direct download (3 more) Export citation Bookmark 3 citations
Three conceptual problems that bug me (7th Scandinavian Logic Symposium, Uppsala lecture, Aug.18-20, 1996 Draft).Solomon Feferman - unknowndetails I will talk here about three problems that have bothered me for a number of years, during which time I have experimented with a variety of solutions and encouraged others to work on them. I have raised each of them separately both in full and in passing in various contexts, but thought it would be worthwhile on this occasion to bring them to your attention side by side. In this talk I will explain the problems, together with some things that (...) Areas of Mathematics in Philosophy of Mathematics Direct download Export citation Bookmark 2 citations

1