Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
- Cited by 1
COMPLETE INTUITIONISTIC TEMPORAL LOGICS FOR TOPOLOGICAL DYNAMICS
- Part of:
-
- Published online by Cambridge University Press:
- 04 February 2022, pp. 995-1022
-
- Article
- Export citation
- Cited by 1
Michael Hallett. Cantorian set theory and limitation of size. Oxford logic guidelines, no. 10. Clarendon Press, Oxford University Press, Oxford and New York1984, xxiii + 343 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 568-570
-
- Article
- Export citation
- Cited by 1
Neil Tennant. Anti-realism and logic. Truth as eternal. Clarendon library of logic and philosophy. Clarendon Press, Oxford University Press, Oxford and New York 1987, xii + 325 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1485-1486
-
- Article
- Export citation
- Cited by 1
Obras completas, by Kurt Gödel. Edited by Jesús Mosterín. Alianza universidad. Alianza Editorial, Madrid1981, 430 pp. - Jesús Mosterín. Prólogo. Pp. 9–13. - Jesús Mosterín. Introducción. Pp. 15–19, 35–36, 41, 45–54, 91, 95–96, 101–102, 105–106, 109, 113–114, 117–119, 127–129, 147–150, 183–184, 187–188, 191, 195–196, 205–213, 295–296, 329–330, 337–339, 401–403, 413–414. - Kurt Gödel. La suftciencia de los axiomas del caĺculo lógico de primer orden. Pp. 20–34. Spanish translation by Jesús Mosterín of 4182. - Kurt Gödel. Un caso especial del problema de la decision en la Idgica tedrica. Pp. 37–39. Spanish translation by Jesús Mosterín of 4187. - Kurt Gödel. Algunos resultados metamatemáticos sobre completudy consistencia. Pp. 42–43. Spanish translation by Jesús Mosterín of 4181. - Kurt Gödel. Sobre sentencias formalmente indecidibles de Principia mathematica y sistemas afines. Pp. 55–89. Spanish translation by Jesús Mosterín of 4185 with an added note from XXXVII 405(5). - Kurt Gödel. Sobre completud y consistencia. Pp. 92–94. Spanish translation by Jesús Mosterin of 4188 with an added note from XXXVII 405(6). - Kurt Gödel. Discusión sobre la fundamentación de la matemática. Pp. 97–100. Spanish translation by Jesús Mosterín of 4184 and 4185. - Kurt Gödel. Una propriedad de los modelos del cálculo conectivo. Pp. 103–104. Spanish translation by Jesús Mosterín of 4189.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1199-1201
-
- Article
- Export citation
- Cited by 1
John Dewey and Arthur F. Bentley. A search for firm names. The journal of philosophy, vol. 42 (1945), pp. 5–6. - Arthur F. Bentley. On a certain vagueness in logic. The journal of philosophy, vol. 42 (1945), pp. 6–27, 39–51. - John Dewey and Arthur F. Bentley. A terminology for knowings and knowns. The journal of philosophy, vol. 42 (1945), pp. 225–247. - John Dewey and Arthur F. Bentley. Postulalions. The journal of philosophy, vol. 42 (1945), pp. 645–662.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 132-133
-
- Article
- Export citation
- Cited by 1
Some properties of epistemic set theory with collection
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 748-754
-
- Article
- Export citation
- Cited by 1
P. Jordan. Zur Axiomatik der Verknüpfungsbereiche. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 16 (1949), pp. 54–70.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 361
-
- Article
- Export citation
- Cited by 1
TWO-CARDINAL DERIVED TOPOLOGIES, INDESCRIBABILITY AND RAMSEYNESS
- Part of:
-
- Published online by Cambridge University Press:
- 12 March 2024, pp. 1-29
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
J.-J. Ch. Meyer and W. Van Der Hoek. Epistemic logic for AI and computer science. Cambridge tracts in theoretical computer science, no. 41. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1995, xiii + 354 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1837-1840
-
- Article
- Export citation
- Cited by 1
Jaakko Hintikka. Reasoning about knowledge in philosophy: the paradigm of epistemic logic. Theoretical aspects of reasoning about knowledge, Proceedings of the 1986 conference, edited by Joseph Y. Halpern, Morgan Kaufmann Publishers, Los Altos 1986, pp. 63–80.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 663-664
-
- Article
- Export citation
- Cited by 1
Hilary Putnam. A note on constructible sets of integers. Notre Dame journal of formal logic, vol. 4 no. 4 (for 1963, pub. 1964), pp. 270–273.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 339-340
-
- Article
- Export citation
- Cited by 1
W. V. Quine. Three grades of modal involvement. Actes du XIème Congrès International de Philosophie, Volume XIV, Volume complémentaire et communications du Colloque de Logique, North-Holland Publishing Company, Amsterdam1953, and Éditions E. Nauwelaerts, Louvain 1953, pp. 65–81.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 168-169
-
- Article
- Export citation
- Cited by 1
Jan Kalicki. An undecidable problem in the algebra of truth-tables. The journal of symbolic logic, vol. 19 (1954), pp. 172–176.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 283-284
-
- Article
- Export citation
- Cited by 1
K. R. Popper. Are contradictions embracing?Mind, n.s. vol. 52 (1943), pp. 47–50.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 48-49
-
- Article
- Export citation
- Cited by 1
WEAKLY REMARKABLE CARDINALS, ERDŐS CARDINALS, AND THE GENERIC VOPĚNKA PRINCIPLE
-
- Published online by Cambridge University Press:
- 13 September 2019, pp. 1711-1721
-
- Article
- Export citation
- Cited by 1
Canonical measure assignments
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 403-424
-
- Article
- Export citation
- Cited by 1
J. H. Woodger. The axiomatic method in biology. The University Press, Cambridge, England, 1937; The Macmillan Company, New York 1937; x + 174 pp. Appendix C, by W. F. Floyd, pp. 154–158. Appendix E, by Alfred Tarski, pp. 161–172.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 42-43
-
- Article
- Export citation
- Cited by 1
REFLECTION IN SECOND-ORDER SET THEORY WITH ABUNDANT URELEMENTS BI-INTERPRETS A SUPERCOMPACT CARDINAL
- Part of:
-
- Published online by Cambridge University Press:
- 23 December 2022, pp. 1-37
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
- Cited by 1
A. N. Kolmogorov and V. A. Uspeńskij. K oprédéléniú algoritma (On the definition of an algorithm). Uspéhi matématičéskih nauk, vol. 13 no. 4 (1958), pp. 3–28.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 655
-
- Article
- Export citation
- Cited by 1
A. Newell, J. C. Shaw, and H. A. Simon. Empirical explorations of the logic theory machine: A case study in heuristic. Proceedings of the Western Joint Computer Conference, Los Angeles1957, pp. 218–230. - Bryan Cowan, G. H. McClurg, A. Newell, P. E. Tanner, L. D. Yarbrough. Discussion. Proceedings of the Western Joint Computer Conference, Los Angeles1957, p. 230.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 102-103
-
- Article
- Export citation