Grzegorczyk A.. Elementarily definable analysis. Fundamenta mathematicae, Bd. 41 Heft 2 , S. 311–338

Journal of Symbolic Logic 23 (4):444-445 (1958)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964036

Links

PhilArchive



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

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: A. Grzegorczyk, Elementarily Definable Analysis. [REVIEW]Paul Lorenzen - 1958 - Journal of Symbolic Logic 23 (4):444-445.
Ł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.
Elementarily Definable Analysis.A. Grzegorczyk - 1958 - Journal of Symbolic Logic 23 (4):444-445.
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.
Reviews. A. Grzegorczyk. Computable functionals. Fundamenta mathematicae, vol. 42 , pp. 168–202. A. Grzegorczyk. On the definition of computable functionals. Ibid., pp. 232–239. [REVIEW]G. Kreisel - 1959 - Journal of Symbolic Logic 24 (1):50-51.
A note on the theory of propositional types.Andrzej Grzegorczyk - 1964 - Fundamenta Mathematicae 54 (3):27-29.
Grzegorczyk A.. Some proofs of undecidability of arithmetic. Fundamenta mathematicae, vol. 43 , pp. 166–177.W. W. Tait - 1958 - Journal of Symbolic Logic 23 (1):46-47.
Grzegorczyk Andrzej. Undecidability of some topological theories. Fundamenta mathematicae, vol. 38 , pp. 137–152.Hartley Rogers - 1953 - Journal of Symbolic Logic 18 (1):73-74.
Grzegorczyk A.. A note on the theory of prepositional types. Fundamenta mathematicae, vol. 54 (1964), pp. 27–29.Peter Andrews - 1966 - Journal of Symbolic Logic 31 (3):502-503.
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.
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.
A. Janiczak. Undecidability of some simple formalized theories. Nach dem Tode des Verf., von A. Mostowski und A. Grzegorczyk herausgegeben. Fundamenta mathematicae, Bd. 40 , S. 131–139. [REVIEW]Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (2):217-217.
Nonstandard models that are definable in models of Peano Arithmetic.Kazuma Ikeda & Akito Tsuboi - 2007 - Mathematical Logic Quarterly 53 (1):27-37.

Analytics

Added to PP
2016-06-30

Downloads
13 (#1,001,344)

6 months
4 (#797,377)

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