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 16
Can there be no nonrecursive functions?
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 309-315
-
- Article
- Export citation
- Cited by 16
Bases for first-order theories and subtheories
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 97-142
-
- Article
- Export citation
- Cited by 16
Automorphisms of supermaximal subspaces
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1-9
-
- Article
- Export citation
- Cited by 16
Cohen-stable families of subsets of integers
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 257-270
-
- Article
- Export citation
- Cited by 15
The deduction rule and linear and near-linear proof simulations
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 688-709
-
- Article
- Export citation
- Cited by 15
Independence, randomness and the axiom of choice
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1274-1304
-
- Article
- Export citation
- Cited by 15
A system of axiomatic set theory. Part IV. General set theory38
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 133-145
-
- Article
- Export citation
- Cited by 15
A basic logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 105-114
-
- Article
- Export citation
- Cited by 15
ℵ0-categorical modules
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 213-220
-
- Article
- Export citation
- Cited by 15
A. Markov. Névozmožnost' algorifmov raspoznavaniá nékotoryh svojstv associativnyh sistém (Impossibility of algorithms for recognizing some properties of associative systems). Doklady Akadémii Nauk SSSR, vol. 77 (1951), pp. 953–956.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 151-152
-
- Article
- Export citation
- Cited by 15
Minimal models of Heyting arithmetic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1448-1460
-
- Article
- Export citation
- Cited by 15
Enumerations of the Kolmogorov function
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 501-528
-
- Article
- Export citation
- Cited by 15
Covering analytic sets by families of closed set
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1022-1031
-
- Article
- Export citation
- Cited by 15
On central extensions of algebraic groups
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 68-74
-
- Article
- Export citation
- Cited by 15
Tarski and geometry
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 907-912
-
- Article
- Export citation
- Cited by 15
Topological elementary equivalence of closed semi-algebraic sets in the real plane
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1530-1555
-
- Article
- Export citation
- Cited by 15
Universal graphs at the successor of a singular cardinal
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 366-388
-
- Article
- Export citation
- Cited by 15
Weak systems of determinacy and arithmetical quasi-inductive definitions
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 418-436
-
- Article
- Export citation
- Cited by 15
Forcing in intuitionistic systems without power-set1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 670-682
-
- Article
- Export citation
- Cited by 15
FRAGMENTS OF APPROXIMATE COUNTING
-
- Published online by Cambridge University Press:
- 25 June 2014, pp. 496-525
-
- Article
- Export citation