Dana Scott. A proof of the independence of the continuum hypothesis. Mathematical systems theory, vol. 1 , pp. 89–111

Journal of Symbolic Logic 33 (2):293 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269894

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,551

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

Scott Dana. The independence of certain distributive laws in Boolean algebras. Transactions of the American Mathematical Society, vol. 84 , pp. 258–261. [REVIEW]Chen Chung Chang - 1959 - Journal of Symbolic Logic 24 (1):60-61.
Masahiro Hamano and Mitsuhiro Okada. A direct independence proof of Buchholz's Hydra game on finite labeled trees. Archive for mathematical logic, vol. 37 no. 2 , pp. 67–89. [REVIEW]Lev Gordeev - 2001 - Bulletin of Symbolic Logic 7 (4):534-535.
Dana Scott. Some definitional suggestions for automata theory. Journal of computer and system sciences, vol. 1 , pp. 187–212. [REVIEW]Robert F. Barnes - 1975 - Journal of Symbolic Logic 40 (4):615-616.
Cohen Paul J.. The independence of the continuum hypothesis. Proceedings of the National Academy of Sciences of the United States of America, vol. 50 , pp. 1143–1148, and vol. 51 , pp. 105–110. [REVIEW]William B. Easton - 1965 - Journal of Symbolic Logic 30 (3):398-403.
J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical systems theory, vol. 2 , pp. 57–81. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):619-620.
Paul W. Abrahams. Machine verification of mathematical proof. Mathematical algorithms, vol. 1 no. 2 , pp. 11–32; vol. 1 no. 3 , pp. 19–38; vol. 2 , pp. 28–79; vol. 3 , pp. 28–155. [REVIEW]John McCarthy - 1972 - Journal of Symbolic Logic 37 (2):411-412.
A Proof of the Independence of the Continuum Hypothesis.Dana Scott - 1968 - Journal of Symbolic Logic 33 (2):293-293.
Scott D. and Tarski A.. The sentential calculus with infinitely long expressions. Colloquium mathematicum, vol. 6 , pp. 165–170.Scott Dana and Tarski Alfred. The sentential calculus with infinitely long expressions. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 83–89. [REVIEW]Thomas Frayne - 1965 - Journal of Symbolic Logic 30 (1):94-95.
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. [REVIEW]John P. Burgess - 1985 - Journal of Symbolic Logic 50 (2):544-547.

Analytics

Added to PP
2013-11-22

Downloads
29 (#779,085)

6 months
9 (#497,927)

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