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
Further results on infinite valued predicate logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 69-78
-
- Article
- Export citation
- Cited by 14
How to characterize provably total functions by local predicativity
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 52-69
-
- Article
- Export citation
- Cited by 14
COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
-
- Published online by Cambridge University Press:
- 23 September 2019, pp. 1422-1465
-
- Article
- Export citation
- Cited by 14
Computability over the partial continuous functionals
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1133-1142
-
- Article
- Export citation
- Cited by 14
On the structure of semialgebraic sets over p-adic fields
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1138-1164
-
- Article
- Export citation
- Cited by 14
Hierarchies of Computable groups and the word problem1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 376-392
-
- Article
- Export citation
- Cited by 14
Logics which capture complexity classes over the reals
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 363-390
-
- Article
- Export citation
- Cited by 14
On the indexing of classes of recursively enumerable sets
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 10-22
-
- Article
- Export citation
- Cited by 14
Groundwork for weak analysis
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 557-578
-
- Article
- Export citation
- Cited by 14
Intensional logic and two-sorted type theory
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 65-77
-
- Article
- Export citation
- Cited by 14
Effective operations in a general setting
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 163-178
-
- Article
- Export citation
- Cited by 14
Towards a characterization of order-invariant queries over tame graphs
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 168-186
-
- Article
- Export citation
- Cited by 14
Which structural rules admit cut elimination? An algebraic criterion
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 738-754
-
- Article
- Export citation
- Cited by 14
Returning to semi-bounded sets
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 597-617
-
- Article
- Export citation
- Cited by 14
Property theory and the revision theory of definitions
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 212-246
-
- Article
- Export citation
- Cited by 14
The word problem for cancellation semigroups with zero
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 184-191
-
- Article
- Export citation
- Cited by 14
An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 227-237
-
- Article
- Export citation
- Cited by 14
Imbedding of the quantum logic in the modal system of Brower
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 321-328
-
- Article
- Export citation
- Cited by 14
Index sets of finite classes of recursively enumerable sets
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 39-44
-
- Article
- Export citation
- Cited by 14
Paradox of the class of all grounded classes
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 114
-
- Article
- Export citation