- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On Definable Sets of Positive Integers
Journal of Symbolic Logic 13 (2):112-113 (1948)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Review: Andrzej Mostowski, On Definable Sets of Positive Integers. [REVIEW]David Nelson - 1948 - Journal of Symbolic Logic 13 (2):112-113.
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.
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems.Christian Michaux & Roger Villemaire - 1996 - Annals of Pure and Applied Logic 77 (3):251-277.
The number of certain integral polynomials and nonrecursive sets of integers, part.Harvey Friedman - manuscript
On a Set of Integers Not Definable by Means of One-Quantifier Predicates.Andrzej Mostowski - 1950 - Journal of Symbolic Logic 15 (2):135-135.
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.
Topological properties of sets definable in weakly o-minimal structures.Roman Wencel - 2010 - Journal of Symbolic Logic 75 (3):841-867.
The Laws of Integer Divisibility, and Solution Sets of Linear Divisibility Conditions.L. Van den Dries & A. J. Wilkie - 2003 - Journal of Symbolic Logic 68 (2):503 - 526.
The laws of integer divisibility, and solution sets of linear divisibility conditions.L. van den Dries & A. J. Wilkie - 2003 - Journal of Symbolic Logic 68 (2):503-526.
The laws of integer divisibility, and solution sets of linear divisibility conditions.L.den Dries & A. J. Wilkie - 2003 - Journal of Symbolic Logic 68 (2):503 - 526.
Development and Applications of the "Projective" Classification of Sets of Integers.Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (1):44-45.
Analytics
Added to PP
2015-02-05
Downloads
20 (#723,940)
6 months
2 (#1,157,335)
2015-02-05
Downloads
20 (#723,940)
6 months
2 (#1,157,335)
Historical graph of downloads
Citations of this work
Two episodes in the unification of logic and topology.E. R. Grosholz - 1985 - British Journal for the Philosophy of Science 36 (2):147-157.
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic.J. W. Addison - 2004 - Annals of Pure and Applied Logic 126 (1-3):77-92.
Index sets related to prompt simplicity.Steven Schwarz - 1989 - Annals of Pure and Applied Logic 42 (3):243-254.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d9b7f7c4c-67rzb uwo