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 13
Bounded modified realizability
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 329-346
-
- Article
- Export citation
- Cited by 13
The role of parameters in bar rule and bar induction
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 715-730
-
- Article
- Export citation
- Cited by 12
Nonexistence of minimal pairs for generic computability
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 511-522
-
- Article
- Export citation
- Cited by 12
CLASSIFICATION THEORY FOR ACCESSIBLE CATEGORIES
-
- Published online by Cambridge University Press:
- 09 March 2016, pp. 151-165
-
- Article
- Export citation
- Cited by 12
ON RAMSEY’S THEOREM AND THE EXISTENCE OF INFINITE CHAINS OR INFINITE ANTI-CHAINS IN INFINITE POSETS
-
- Published online by Cambridge University Press:
- 09 March 2016, pp. 384-394
-
- Article
- Export citation
- Cited by 12
Recursive equivalence types and groups1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 13-20
-
- Article
- Export citation
- Cited by 12
Splitting properties of r.e. sets and degrees1,2
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 88-109
-
- Article
- Export citation
- Cited by 12
General random sequences and learnable sequences
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 329-340
-
- Article
- Export citation
- Cited by 12
Effective aspects of profinite groups1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 851-863
-
- Article
- Export citation
- Cited by 12
A constructive interpretation of the full set theory
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 172-201
-
- Article
- Export citation
- Cited by 12
Flat algebras and the translation of universal Horn logic to equational logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 90-128
-
- Article
- Export citation
- Cited by 12
Contiguity and distributivity in the enumerable Turing degrees
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1215-1240
-
- Article
- Export citation
- Cited by 12
Corrigendum to: “On the strength of Ramsey's Theorem for pairs”
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1438-1439
-
- Article
- Export citation
- Cited by 12
COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY
-
- Published online by Cambridge University Press:
- 18 August 2014, pp. 859-881
-
- Article
- Export citation
- Cited by 12
Universal recursion theoretic properties of r.e. preordered structures
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 397-406
-
- Article
- Export citation
- Cited by 12
Degrees of recursively enumerable topological spaces
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 610-622
-
- Article
- Export citation
- Cited by 12
Axiomatization of polynomial substitution algebras
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 481-492
-
- Article
- Export citation
- Cited by 12
DP-MINIMALITY: INVARIANT TYPES AND DP-RANK
-
- Published online by Cambridge University Press:
- 12 December 2014, pp. 1025-1045
-
- Article
- Export citation
- Cited by 12
Strict implication, deducibility and the deduction theorem
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 234-236
-
- Article
- Export citation
- Cited by 12
Towards applied theories based on computability logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 565-601
-
- Article
- Export citation