A note on constructible sets of integers
Notre Dame Journal of Formal Logic 4 (4):270-273 (1963)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesGeorge Boolos & Hilary Putnam (1968). Degrees of Unsolvability of Constructible Sets of Integers. Journal of Symbolic Logic 33 (4):497-513.
Harvey Friedman, The Number of Certain Integral Polynomials and Nonrecursive Sets of Integers, Part.
Vladimir Kanovei (1996). On External Scott Algebras in Nonstandard Models of Peano Arithmetic. Journal of Symbolic Logic 61 (2):586-607.
Daniel J. Velleman (1998). Review of Levin's ”Putnam on Reference and Constructible Sets' (1997). [REVIEW] Mathematical Reviews 98:1364.
Michel Rigo (2004). Characterizing Simpler Recognizable Sets of Integers. Studia Logica 76 (3):407 - 426.
Anatole Khelif (1996). Existentially Closed Models Via Constructible Sets: There Are 2ℵ0 Existentially Closed Pairwise Non Elementarily Equivalent Existentially Closed Ordered Groups. [REVIEW] Journal of Symbolic Logic 61 (1):277 - 284.
Luca Bellotti (2005). Putnam and Constructibility. Erkenntnis 62 (3):395--409.
William J. Mitchell (1974). Sets Constructible From Sequences of Ultrafilters. Journal of Symbolic Logic 39 (1):57-66.
Michael Levin (1997). Putnam on Reference and Constructible Sets. British Journal for the Philosophy of Science 48 (1):55-67.
Robert S. Lubarsky (1993). Μ-Definable Sets of Integers. Journal of Symbolic Logic 58 (1):291-313.
Denis Richard (1985). Answer to a Problem Raised by J. Robinson: The Arithmetic of Positive or Negative Integers is Definable From Successor and Divisibility. Journal of Symbolic Logic 50 (4):927-935.
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
Sy-David Friedman (2010). Generalizations of Gödel's Universe of Constructible Sets. In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Kurt Gödel: Essays for His Centennial. Association for Symbolic Logic.
Analytics
Monthly downloads |
Added to index2010-08-24Total downloads4 ( #178,517 of 549,010 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
