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 19
The structure of intrinsic complexity of learning
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1187-1201
-
- Article
- Export citation
- Cited by 19
On the complexity of models of arithmetic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 403-415
-
- Article
- Export citation
- Cited by 19
A short proof of the strong normalization of classical natural deduction with disjunction
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1277-1288
-
- Article
- Export citation
- Cited by 19
The optimality of induction as an axiomatization of arithmetic1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 182-184
-
- Article
- Export citation
- Cited by 19
Fondements de la logique positive
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1141-1162
-
- Article
- Export citation
- Cited by 19
The least measurable can be strongly compact and indestructible
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1404-1412
-
- Article
- Export citation
- Cited by 19
Arithmetical representation of recursively enumerable sets
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 162-186
-
- Article
- Export citation
- Cited by 19
Proof of the independence of the primitive symbols of Heyting's calculus of propositions
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 155-158
-
- Article
- Export citation
- Cited by 19
Theories with recursive models
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 59-76
-
- Article
- Export citation
- Cited by 19
A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
-
- Published online by Cambridge University Press:
- 01 May 2018, pp. 326-348
-
- Article
- Export citation
- Cited by 19
Intrinsic bounds on complexity and definability at limit levels
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1047-1060
-
- Article
- Export citation
- Cited by 19
The gergonne relations
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 207-231
-
- Article
- Export citation
- Cited by 19
The strength of the rainbow Ramsey Theorem
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1310-1324
-
- Article
- Export citation
- Cited by 19
A proof of completeness for continuous first-order logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 168-190
-
- Article
- Export citation
- Cited by 19
Complete local rings as domains
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 603-624
-
- Article
- Export citation
- Cited by 19
The modal μ-calculus hierarchy over restricted classes of transition systems
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1367-1400
-
- Article
- Export citation
- Cited by 19
UNSOUND INFERENCES MAKE PROOFS SHORTER
-
- Published online by Cambridge University Press:
- 14 March 2019, pp. 102-122
-
- Article
- Export citation
- Cited by 19
A combinatory account of internal structure
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 807-826
-
- Article
- Export citation
- Cited by 19
Proper forcing and remarkable cardinals II
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1481-1492
-
- Article
- Export citation
- Cited by 19
Approximate counting in bounded arithmetic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 959-993
-
- Article
- Export citation