Review: Andrzej Mostowski, On Definable Sets of Positive Integers [Book Review]

Journal of Symbolic Logic 13 (2):112-113 (1948)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2267332

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: Andrzej Mostowski, On a Set of Integers Not Definable by Means of One-Quantifier Predicates. [REVIEW]Martin Davis - 1950 - Journal of Symbolic Logic 15 (2):135-135.
Review: Andrzej Mostowski, Development and Applications of the "Projective" Classification of Sets of Integers. [REVIEW]G. Hasenjaeger - 1958 - Journal of Symbolic Logic 23 (1):44-45.
Definability and decidability issues in extensions of the integers with the divisibility predicate.Patrick Cegielski, Yuri Matiyasevich & Denis Richard - 1996 - Journal of Symbolic Logic 61 (2):515-540.
Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility.Denis Richard - 1985 - Journal of Symbolic Logic 50 (4):927-935.
On external Scott algebras in nonstandard models of peano arithmetic.Vladimir Kanovei - 1996 - Journal of Symbolic Logic 61 (2):586-607.
Review: Andrzej Mostowski, Imre Lakatos, Recent Results in Set Theory; G. Kreisel, A. Robinson, L. Kalmar, A. Mostowski, Discussion; Andrzej Mostowski, On Some New Metamathematical Results Concerning Set Theory. [REVIEW]T. Jech - 1972 - Journal of Symbolic Logic 37 (4):765-766.
Review: A. Mostowski, Examples of Sets Definable by Means of Two and Three Quantifiers. [REVIEW]G. Hasenjaeger - 1960 - Journal of Symbolic Logic 25 (4):364-365.
Review: A. Mostowski, Contribution to the Theory of Definable Sets and Functions. [REVIEW]G. Hasenjaeger - 1960 - Journal of Symbolic Logic 25 (4):365-365.
Review: Ulrich Felgner, Comparison of the Axioms of Local and Universal Choice; Andrzej Mostowski, Models of Second Order Arithmetic with Definable Skolem Functions. [REVIEW]S. G. Simpson - 1973 - Journal of Symbolic Logic 38 (4):652-653.
Review: A. A. Mucnik, On Separability of Recursively Enumerable Sets. [REVIEW]Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (2):224-225.
Review: U. T. Medvedev, On Non-Isomorphic Recursively Enumerable Sets. [REVIEW]Andrzej Mostowski - 1956 - Journal of Symbolic Logic 21 (1):101-102.
Review: V. A. Uspenskij, Some Notes on Recursively Enumerable Sets. [REVIEW]Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (1):49-50.
Μ-definable sets of integers.Robert S. Lubarsky - 1993 - Journal of Symbolic Logic 58 (1):291-313.
Review: Andrzej Mostowski, Axiom of Choice for Finite Sets. [REVIEW]László Kalmár - 1948 - Journal of Symbolic Logic 13 (1):45-46.
Review: D. A. Bocvar, Some Logical Theorems on the Normal Sets and Predicates. [REVIEW]Andrzej Mostowski - 1947 - Journal of Symbolic Logic 12 (1):27-27.

Analytics

Added to PP
2013-11-22

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