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
On the notational independence of various hierarchies of degrees of unsolvability1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 69-86
-
- Article
- Export citation
- Cited by 1
Forcing and reducibilities. III. Forcing in fragments of set theory
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1013-1034
-
- Article
- Export citation
- Cited by 1
Some remarks concerning theories with recursively enumerable complements1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 72-74
-
- Article
- Export citation
- Cited by 1
Abraham Robinson. On the application of symbolic logic to algebra. Proceedings of the International Congress of Mathematicians, Cambridge, Massachusetts, U.S.A., August 30-September 6, 1950, American Mathematical Society, Providence1952, Vol. I, pp. 686–694. - Alfred Tarski. Some notions and methods on the borderline of algebra and metamathematics. Proceedings of the International Congress of Mathematicians, Cambridge, Massachusetts, U.S.A., August 30-September 6, 1950, American Mathematical Society, Providence1952, Vol. I, pp. 705–720.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 182
-
- Article
- Export citation
- Cited by 1
Alexander Philipov. Logic and dialectic in the Soviet Union. With a foreword by Ernest Nagel. Studies on the U.S.S.R. No. 1. Lithoprinted. Research Program on the U.S.S.R. (East European Fund, Inc.), New York1952, xi + 89 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 272-273
-
- Article
- Export citation
- Cited by 1
Logic, semantics, metamathematics, Papers from 1923 to 1938, by Alfred Tarski, translated by J. H. Woodger, second edition edited and introduced by John Corcoran, Hackett Publishing Company, Indianapolis 1983, xxx + 506 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 281-282
-
- Article
- Export citation
- Cited by 1
On orbits, of prompt and low computably enumerable sets
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 649-678
-
- Article
- Export citation
- Cited by 1
A PREDICATIVE VARIANT OF HYLAND’S EFFECTIVE TOPOS
- Part of:
-
- Published online by Cambridge University Press:
- 22 October 2020, pp. 433-447
-
- Article
- Export citation
- Cited by 1
RAMSEY’S THEOREM FOR PAIRS AND K COLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC
-
- Published online by Cambridge University Press:
- 19 June 2017, pp. 737-753
-
- Article
- Export citation
- Cited by 1
ON EQUIVALENCE RELATIONS INDUCED BY LOCALLY COMPACT ABELIAN POLISH GROUPS
- Part of:
-
- Published online by Cambridge University Press:
- 07 June 2023, pp. 1-16
-
- Article
-
- You have access
- HTML
- Export citation
- Cited by 1
Masao Ohnishi and Kazuo Matsumoto. A system for strict implication. Proceedings of the Symposium on the Foundations of Mathematics, held at Katada, Japan, 1962, Sponsored jointly by The Division of the Foundations of Mathematics of the Mathematical Society of Japan, The Sugaku Shinkokai, and The Toyo Spinning Company, Tokyo1963, pp. 99–108. (Reprinted in Annals of the Japan Association for Philosophy of Science, vol. 2 no. 4 (1964), pp. 183–188.)
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 326
-
- Article
- Export citation
- Cited by 1
Determinacy of Banach games
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 110-122
-
- Article
- Export citation
- Cited by 1
Examining Fragments of the Quantified Propositional Calculus
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1051-1080
-
- Article
- Export citation
- Cited by 1
Semi-bounded relations in ordered modules
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 499-517
-
- Article
- Export citation
- Cited by 1
Vladimir A. Uspensky. Godel's incompleteness theorem. A reprint of LV 889 with minor corrections. Theoretical computer science, vol. 130 (1994), pp. 239–319.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 1320
-
- Article
- Export citation
- Cited by 1
Diversity of speed-ups and embeddability in computational complexity1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 199-214
-
- Article
- Export citation
- Cited by 1
A note on S5
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 191-192
-
- Article
- Export citation
- Cited by 1
Closure properties of almost-finiteness classes in recursive function theory
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 756-763
-
- Article
- Export citation
- Cited by 1
Emil L. Post. Finite combinatory processes—formulation 1. The journal of symbolic logic, vol. 1 (1936), pp. 103–105.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 43
-
- Article
- Export citation
- Cited by 1
Cellularity and the structure of pseudo-trees
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1093-1107
-
- Article
- Export citation