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
Combinatorics on ideals and axiom A
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 997-1000
-
- Article
- Export citation
- Cited by 1
Almost local non-α-recursiveness
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 552-562
-
- Article
- Export citation
- Cited by 1
Donald L. Webb. Definition of Post's generalized negative and maximum in terms of one binary operation. American journal of mathematics, vol. 58 (1936), pp. 193–194.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 42
-
- Article
- Export citation
- Cited by 1
A converse of the Barwise completeness theorem
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 594-612
-
- Article
- Export citation
- Cited by 1
Observations concerning elementary extensions of ω-models. II
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 227-231
-
- Article
- Export citation
- Cited by 1
Juliusz Reichbach. O pelności węższego rachunku funkcyjnego. English, with summaries in Polish and Russian. Studia logica, vol. 2 (1955), pp. 213–228. - Juliusz Reichbach. O polnoté uzkogo funkcional'nogo isčisléniá. Russian translation of the preceding. English, with summaries in Polish and Russian. Studia logica, vol. 2 (1955), pp. 229–244. - Juliusz Reichbach. Completeness of the functional calculus of first order. English summary of the same. English, with summaries in Polish and Russian. Studia logica, vol. 2 (1955), pp. 245–250. See Errata, ibid., p. 329.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 194
-
- Article
- Export citation
- Cited by 1
J. L. Bell. Boolean-valued models and independence proofs in set theory. Oxford logic guides. Clarendon Press, Oxford1977, xviii + 126 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 165
-
- Article
- Export citation
- Cited by 1
The cofinality of the random graph
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1439-1446
-
- Article
- Export citation
- Cited by 1
Jean Piaget. Classes, relations et nombres. Essai sur les- groupements de la logistique et sur la réversibilité de la pensée. J. Vrin, Paris1942, 323 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 56
-
- Article
- Export citation
- Cited by 1
Additions and Corrections to a Bibliography of Symbolic Logic
-
- Published online by Cambridge University Press:
- 25 July 2022, pp. 98-113
-
- Article
- Export citation
- Cited by 1
Theodore Hailperin. A theory of restricted quantification. The journal of symbolic logic, vol. 22 (1957), pp. 19–35, 113–129.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 175-176
-
- Article
- Export citation
- Cited by 1
Alfred Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific journal of mathematics, Bd. 5 (1955), S. 285–309.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 370
-
- Article
- Export citation
- Cited by 1
Franz Hohn. Some mathematical aspects of switching. The American mathematical monthly, vol. 62 (1955), pp. 75–90.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 209-210
-
- Article
- Export citation
- Cited by 1
Takeo Sugihara. Aristoteles ni okeru tokusyó to huteisyó (Particular and indefinite propositions in Aristotelian logic). Japanese with English summary. Memoirs of the Liberal Arts College, Fukui University, vol. 3 (1954), pp. 77–86.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 172
-
- Article
- 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
W. L. Parker and B. A. Bernstein. On uniquely solvable Boolean equations. University of California publications in mathematics, n.s. vol. 3 no. 1 (1955), pp. 1–29.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 96-97
-
- Article
- Export citation
- Cited by 1
Don C. Ferguson. Infinite products of recursive equivalence types. The Journal of symbolic logic, vol. 33 (1968), pp. 221–230.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 590
-
- Article
- Export citation
- Cited by 1
Haskell B. Curry. Foundations of mathematical logic. McGraw-Hill Book Company, Inc., New York, San Francisco, Toronto, and London, 1963, xii + 408 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 149
-
- Article
- Export citation
- Cited by 1
Testing singly quantified tautologies
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 478-480
-
- Article
- Export citation
- Cited by 1
CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC
-
- Published online by Cambridge University Press:
- 01 August 2018, pp. 740-765
-
- Article
- Export citation