George Boolos. The iterative conception of set. The journal of philosophy, vol. 68 , pp. 215–231. - Dana Scott. Axiomatizing set theory. Axiomatic set theory, edited by Thomas J. Jech, Proceedings of symposia in pure mathematics, vol. 13 part 2, American Mathematical Society, Providence1974, pp. 207–214. - W. N. Reinhardt. Remarks on reflection principles, large cardinals, and elementary embeddings. Axiomatic set theory, edited by Thomas J. Jech, Proceedings of symposia in pure mathematics, vol. 13 part 2, American Mathematical Society, Providence1974, pp. 189–205. - W. N. Reinhardt. Set existence principles of Shoenfield, Ackermann, and Powell. Fundament a mathematicae, vol. 84 , pp. 5–34. - Hao Wang. Large sets. Logic, foundations of mathematics, and computahility theory. Part one of the proceedings of the Fifth International Congress of Logic, Methodology and Philosophy of Science, London, Ontario, Canada–1975, edited by Robert E. Butts and Jaakko Hintikka, The University of Western [Book Review]

Journal of Symbolic Logic 50 (2):544-547 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274241

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

Sacks Gerald E.. Forcing with perfect closed sets. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 331–355. [REVIEW]J. R. Shoenfield - 1974 - Journal of Symbolic Logic 39 (2):330-330.
Cohen Paul J.. Comments on the foundations of set theory. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 9–15. [REVIEW]Donald A. Martin - 1975 - Journal of Symbolic Logic 40 (3):459-460.
Lane Saunders Mac. Categorical algebra and set-theoretic foundations. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 231–240. [REVIEW]William Mitchell - 1973 - Journal of Symbolic Logic 38 (3):528-528.
Kunen Kenneth. Indescribability and the continuum. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 199–203. [REVIEW]Stephen J. Garland - 1975 - Journal of Symbolic Logic 40 (4):632-632.
Halpern J. D. and Läuchli H.. A partition theorem. Transactions of the American Mathematical Society, vol. 124 , pp. 360–367.Halpern J. D. and Lévy A.. The Boolean prime ideal theorem does not imply the axiom of choice. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 83–134. [REVIEW]David Pincus - 1974 - Journal of Symbolic Logic 39 (1):181-182.
Shoenfield J. R.. The form of the negation of a predicate. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 131–134. [REVIEW]Ann M. Singleterry - 1968 - Journal of Symbolic Logic 33 (1):116-116.
The Iterative Conception of Set.George Boolos, Dana Scott, Thomas J. Jech, W. N. Reinhardt & Hao Wang - 1985 - Journal of Symbolic Logic 50 (2):544-547.
Proceedings of the Fifth International Congress of Logic, Methodology, and Philosophy of Science, London, Ontario, Canada, 1975: Logic, foundations of mathematics, and computability theory.Robert E. Butts & Jaakko Hintikka - 1977
Computational complexity theory, edited by Juris Hartmanis, Proceedings of symposia in applied mathematics, vol. 38, American Mathematical Society, Providence1989, ix + 128 pp. [REVIEW]Uwe Schöning - 1991 - Journal of Symbolic Logic 56 (1):335-336.
Richard A. Shore. Determining automorphisms of the recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 65 , pp. 318– 325. - Richard A. Shore. The homogeneity conjecture. Proceedings of the National Academy of Sciences of the United States of America, vol. 76 , pp. 4218– 4219. - Richard A. Shore. On homogeneity and definability in the first-order theory of the Turing degrees. The journal of symbolic logic, vol. 47 , pp. 8– 16. - Richard A. Shore. The arithmetic and Turing degrees are not elementarily equivalent. Archiv für mathematische Logik und Grundlagenforschung, vol. 24 , pp. 137– 139. - Richard A. Shore. The structure of the degrees of unsolvabitity. Recursion theory, edited by Anil Nerode and Richard A. Shore, Proceedings of symposia in pure mathematics, vol. 42, American Mathematical Society, Providence1985, pp. 33– 51. - Theodore A. Slaman and W. Hugh Woodin. Definability in the Turing degrees. Illinois journal of mathematics, vol. 30 , pp. 320–. [REVIEW]Carl Jockusch - 1990 - Journal of Symbolic Logic 55 (1):358-360.
Spector Clifford. Provably recursive functionals of analysis: A consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 1–27. [REVIEW]R. E. Vesley - 1967 - Journal of Symbolic Logic 32 (1):128-128.
McCarthy John. Computer programs for checking mathematical proofs. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 219–227. [REVIEW]J. A. Robinson - 1968 - Journal of Symbolic Logic 32 (4):523-523.
Foundational Problems in the Special Sciences: Part Two of the Proceedings of the Fifth International Congress of Logic, Methodology and Philosophy of Science, London, Ontario, Canada-1975.Robert E. Butts & Jaakko Hintikka - 2011 - Springer.
Nerode A.. Arithmetically isolated sets and nonstandard models. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 105–116. [REVIEW]Matthew Hassett - 1967 - Journal of Symbolic Logic 32 (2):269-269.
Myhill John. Ω — Λ. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 97–104. [REVIEW]Erik Ellentuck - 1969 - Journal of Symbolic Logic 33 (4):619-620.

Analytics

Added to PP
2016-06-30

Downloads
52 (#293,581)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

John Burgess
Princeton University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references