Number Theoretic Concepts and Recursive Well-Orderings

Journal of Symbolic Logic 31 (3):511-512 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

original Kreisel, G.; Shoenfield, J.; Wang, Hao (1960) "Number theoretic concepts and recursive well-orderings". Archive for Mathematical Logic 5(1-2):42-64

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.

Analytics

Added to PP
2015-02-05

Downloads
49 (#450,040)

6 months
11 (#354,748)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Hao Wang
University of Amsterdam

Citations of this work

Recursive well-founded orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.
Borel ideals vs. Borel sets of countable relations and trees.Samy Zafrany - 1989 - Annals of Pure and Applied Logic 43 (2):161-195.
Well-foundedness in Realizability.M. Hofmann, J. van Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
On the effective ω‐rule.Warren D. Goldfarb - 1975 - Mathematical Logic Quarterly 21 (1):409-412.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references