Number theoretic concepts and recursive well-orderings
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
G. Kreisel, J. Shoenfield, and Hao Wang. Number theoretic concepts and recursive well-orderings. Archiv für mathematische Logik und Grundlagenforschung, vol. 5 , pp. 42–64. [REVIEW]Ann M. Singleterry -1966 -Journal of Symbolic Logic 31 (3):511-512.
Kreisel G., Lacombe D., and Shoenfield J.. Effective operations and partial recursive functionals. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 364–365.Kreisel G., Lacombe D., and Shoenfield J. R.. Partial recursive functionals and effective operations. Constructivity in mathematics, Proceedings of the colloquium held at Amsterdam, 1957, edited by Heyting A., Studies in logic and the foundations of mathematics, North Holland Publishing Company, Amsterdam 1959, pp. 290–297. [REVIEW]Yiannis N. Moschovakis -1966 -Journal of Symbolic Logic 31 (2):261-262.
Kreisel G. und Wang Hao. Some applications of formalized consistency proofs. Fundamenta mathematicae, Bd. 42 , S. 101–110. [REVIEW]G. Hasenjaeger -1956 -Journal of Symbolic Logic 21 (4):404-405.
Generalized quantifiers and well orderings.A. B. Slomson -1972 -Archive for Mathematical Logic 15 (1-2):57-73.
Shoenfield J. R.. The class of recursive functions. Proceedings of the American Mathematical Society, vol. 9 , pp. 690–692. [REVIEW]Paul Axt -1959 -Journal of Symbolic Logic 24 (3):238-239.
Intuitionistically provable recursive well-orderings.Harvey M. Friedman &Andre Scedrov -1986 -Annals of Pure and Applied Logic 30 (2):165-171.
Review: Hao Wang, A survey of Mathematical logic. [REVIEW]Steven Orey -1963 -Journal of Symbolic Logic 28 (4):288-289.
Analytics
Added to PP
2020-12-03
Downloads
19 (#1,177,270)
6 months
3 (#1,168,863)
2020-12-03
Downloads
19 (#1,177,270)
6 months
3 (#1,168,863)
Historical graph of downloads
How can I increase my downloads?Citations of this work
Transfinite recursive progressions of axiomatic theories.Solomon Feferman -1962 -Journal of Symbolic Logic 27 (3):259-316.
Degrees of categoricity of computable structures.Ekaterina B. Fokina,Iskander Kalimullin &Russell Miller -2010 -Archive for Mathematical Logic 49 (1):51-67.
The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations.Michael J. Beeson -1975 -Journal of Symbolic Logic 40 (3):321-346.
Transfinite Progressions: A Second Look At Completeness.Torkel Franzén -2004 -Bulletin of Symbolic Logic 10 (3):367-389.
Home |New books and articles |Bibliographies |Philosophy journals |About PhilPapers |API |Contact us |Code of conduct
PhilPapers logo byAndrea Andrews andMeghan Driscoll.
This site uses cookies and Google Analytics (see ourterms & conditions for details regarding the privacy implications).Use of this site is subject toterms & conditions.
All rights reserved byThe PhilPapers Foundation
Server: philpapers-web-54b44b69b7-g6h22 uwo