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 14
Proof systems for probabilistic uncertain reasoning
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1007-1039
-
- Article
- Export citation
- Cited by 14
Lifschitz' realizability
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 805-821
-
- Article
- Export citation
- Cited by 14
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 119-136
-
- Article
- Export citation
- Cited by 14
The logic of interactive turing reduction
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 243-276
-
- Article
- Export citation
- Cited by 14
On ideals of subsets of the plane and on Cohen reals
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 560-569
-
- Article
- Export citation
- Cited by 14
The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1362-1376
-
- Article
- Export citation
- Cited by 14
Direct product decomposition of theories of modules
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 77-88
-
- Article
- Export citation
- Cited by 14
Π11 relations and paths through
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 585-611
-
- Article
- Export citation
- Cited by 14
Omitting types: application to recursion theory
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 81-89
-
- Article
- Export citation
- Cited by 14
The system CΔ of combinatory logic1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 87-97
-
- Article
- Export citation
- Cited by 14
The shuffle Hopf algebra and noncommutative full completeness
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1413-1436
-
- Article
- Export citation
- Cited by 14
Functional completeness and canonical forms in many-valued logics1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 409-422
-
- Article
- Export citation
- Cited by 14
A construction for recursive linear orderings
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 673-683
-
- Article
- Export citation
- Cited by 14
Omitting types, type spectrums, and decidability1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 171-181
-
- Article
- Export citation
- Cited by 14
Woodin's axiom (*), bounded forcing axioms, and precipitous ideals on ω1
-
- Published online by Cambridge University Press:
- 24 February 2017, pp. 475-498
-
- Article
- Export citation
- Cited by 14
A solution to the completeness problem for weakly aggregative modal logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 832-842
-
- Article
- Export citation
- Cited by 14
On the Schur-Zassenhaus theorem for groups of finite Morley rank
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1469-1477
-
- Article
- Export citation
- Cited by 14
Logic based on inclusion and abstraction
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 145-152
-
- Article
- Export citation
- Cited by 14
Finite Kripke models and predicate logics of provability
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1090-1098
-
- Article
- Export citation
- Cited by 14
Up to equimorphism, hyperarithmetic is recursive
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 360-378
-
- Article
- Export citation