S. C. Kleene. Lambda-definable functional of finite types. Fundamenta mathematicae, vol. 50 no. 3 , pp. 281–303

Journal of Symbolic Logic 29 (2):104-105 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270431

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

Review: S. C. Kleene, Lambda-Definable Functionals of Finite Types. [REVIEW]J. Barkley Rosser - 1964 - Journal of Symbolic Logic 29 (2):104-105.
Lambda-Definable Functionals of Finite Types.S. C. Kleene - 1964 - Journal of Symbolic Logic 29 (2):104-105.
Łos J.. On the extending of models . Fundamenta mathematicae, vol. 42 , pp. 38–54.Łos J. and Suszko R.. On the extending of models . Common extensions. Fundamenta mathematicae, vol. 42 , pp. 343–347.Słomiński J.. On the extending of models . Extensions in equationally definable classes of algebras. Fundamenta mathematicae, vol. 43 , pp. 69–76.Łos J. and Suszko R.. On the extending of models . Infinite sums of models. Fundamenta mathematicae, vol. 44 , pp. 52–60. [REVIEW]H. Jerome Keisler - 1962 - Journal of Symbolic Logic 27 (1):93-95.
Ulrich Felgner. Comparison of the axioms of local and universal choice. Fundamenta mathematicae, vol. 71 no. 1 , pp. 43–62. - Andrzej Mostowski. Models of second order arithmetic with definable Skolem functions. Fundamenta mathematicae, vol. 75 no. 3 , pp. 223–234. [REVIEW]S. G. Simpson - 1973 - Journal of Symbolic Logic 38 (4):652-653.
Church Alonzo and Kleene S. C.. Formal definitions in the theory of ordinal numbers. Fundamenta mathematicae, vol. 28 , pp. 11–21. [REVIEW]Barkley Rosser - 1937 - Journal of Symbolic Logic 2 (2):87-87.
Grzegorczyk A.. Recursive objects in all finite types. Fundamenta mathematicae, vol. 54 , pp. 73–93.Curry Haskell B.. Combinatory recursive objects of all finite types. Bulletin of the American Mathematical Society, vol. 70 , pp. 814–817. [REVIEW]Charles Parsons - 1974 - Journal of Symbolic Logic 39 (2):343-343.
Hanf W.. On a problem of Erdös and Tarski. Fundamenta mathematicae, vol. 53 no. 3 , pp. 325–334.Monk D. and Scott D.. Additions to some results of Erdös and Tarski. Fundamenta mathematicae, vol. 53 no. 3 , pp. 335–343.Hajnal A.. Remarks on the theory of W. P. Hanf. Fundamenta mathematicae vol. 54 no. 1 , pp. 109–113. [REVIEW]Jean A. Larson - 1974 - Journal of Symbolic Logic 39 (2):332-332.
N. A. Routledge. Concerning definable sets. Fundamenta mathematicae, vol. 41 no. 1 , pp. 6–11.Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):69-69.
Mycielski Jan and Steinhaus H.. A mathematical axiom contradicting the axiom of choice. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 10 , pp. 1–3.Mycielski Jan. On the axiom of determinateness. Fundamenta mathematicae, vol. 53 , pp. 205–224.Mycielski Jan and Świerczkowski S.. On the Lebesgue measurability and the axiom of determinateness. Fundamenta mathematicae, vol. 54 , pp. 67–71.Mycielski Jan. On the axiom of determinateness . Fundamenta mathematicae, vol. 59 , pp. 203–212. [REVIEW]James E. Baumgartner - 1971 - Journal of Symbolic Logic 36 (1):164-166.
Gaifman H.. Infinite Boolean polynomials I. Fundamenta mathematicae, vol. 54 , pp. 229–250. , p. 117.)Hales A. W.. On the non-existence of free complete Boolean algebras. Fundamenta mathematicae, vol. 54 , pp. 45–66. [REVIEW]Thomas Frayne - 1967 - Journal of Symbolic Logic 32 (1):131-132.
Grzegorczyk A.. Elementarily definable analysis. Fundamenta mathematicae, Bd. 41 Heft 2 , S. 311–338.Paul Lorenzen - 1958 - Journal of Symbolic Logic 23 (4):444-445.
Mostowski A.. Examples of sets definable by means of two and three quantifiers. Fundamenta mathematicae, Bd. 42 , S. 259–270. [REVIEW]G. Hasenjaeger - 1960 - Journal of Symbolic Logic 25 (4):364-365.
Fuhrken G.. Skolem-type normal forms for first-order languages with a generalized quantifier. Fundamenta mathematicae, vol. 54 , pp. 291–302.Vaught R. L.. The completeness of logic with the added quantifier “there are uncountably many.” Fundamenta mathematicae, vol. 54 , pp. 303–304. [REVIEW]Pawel Zbierski - 1968 - Journal of Symbolic Logic 33 (1):121-122.
Review: S. C. Kleene, Ernest Nagel, Patrick Suppes, Alfred Tarski, Turing-Machine Computable Functionals of Finite Types I; S. C. Kleene, Turing-Machine Computable Functionals of Finite Types II. [REVIEW]D. A. Clarke - 1970 - Journal of Symbolic Logic 35 (4):588-589.
A theory of propositional types.Leon Henkin - 1963 - Fundamenta Mathematicae 52:323-334.

Analytics

Added to PP
2016-06-30

Downloads
3 (#1,650,745)

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