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 76
Another algorithm for bracket abstraction
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 267-270
-
- Article
- Export citation
- Cited by 76
Degrees coded in jumps of orderings
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1034-1042
-
- Article
- Export citation
- Cited by 75
On theories and models in fuzzy predicate logics
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 863-880
-
- Article
- Export citation
- Cited by 74
Canonical extensions and relational completeness of some substructural logics*
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 713-740
-
- Article
- Export citation
- Cited by 74
Lower bounds for cutting planes proofs with small coefficients
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 708-728
-
- Article
- Export citation
- Cited by 73
Systems of predicative analysis, II: Representations of ordinals
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 193-220
-
- Article
- Export citation
- Cited by 73
Michael R. ΠGarey and David S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco1979, x + 338 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 498-500
-
- Article
- Export citation
- Cited by 73
Questions about quantifiers1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 443-466
-
- Article
- Export citation
- Cited by 73
A logic for approximate reasoning
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 830-837
-
- Article
- Export citation
- Cited by 73
Analytic determinacy and 0#
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 685-693
-
- Article
- Export citation
- Cited by 72
The undecidability of the Turing machine immortality problem1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 219-234
-
- Article
- Export citation
- Cited by 72
Hierarchies of Boolean algebras
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 365-374
-
- Article
- Export citation
- Cited by 71
On the restricted ordinal theorem
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 33-41
-
- Article
- Export citation
- Cited by 71
The pure calculus of entailment1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 19-52
-
- Article
- Export citation
- Cited by 71
Turing machines and the spectra of first-order formulas
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 139-150
-
- Article
- Export citation
- Cited by 71
The identity of individuals in a strict functional calculus of second order
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 12-15
-
- Article
- Export citation
- Cited by 71
New foundations for Lewis modal systems1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 176-186
-
- Article
- Export citation
- Cited by 70
Infinitary logic and admissible sets1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 226-252
-
- Article
- Export citation
- Cited by 70
Combinatorial principles weaker than Ramsey's Theorem for pairs
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 171-206
-
- Article
- Export citation
- Cited by 70
Simplest normal truth functions
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 105-108
-
- Article
- Export citation