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 4
THE DEFINABLE (P, Q)-THEOREM FOR DISTAL THEORIES
-
- Published online by Cambridge University Press:
- 09 November 2017, pp. 123-127
-
- Article
- Export citation
- Cited by 4
Number of countable models
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 492-496
-
- Article
- Export citation
- Cited by 4
Incompleteness of a formal system for infinitary finite-quantifier formulas
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 445-455
-
- Article
- Export citation
- Cited by 4
On Meyer and Lambert's quantificational calculus FQ
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 275-280
-
- Article
- Export citation
- Cited by 4
Prototypes for definable subsets of algebraically closed valued fields
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1093-1141
-
- Article
- Export citation
- Cited by 4
THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS
-
- Published online by Cambridge University Press:
- 21 December 2018, pp. 1610-1617
-
- Article
- Export citation
- Cited by 4
DECIDABILITY AND CLASSIFICATION OF THE THEORY OF INTEGERS WITH PRIMES
-
- Published online by Cambridge University Press:
- 08 September 2017, pp. 1041-1050
-
- Article
- Export citation
- Cited by 4
The 1-section of a countable functional
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 549-562
-
- Article
- Export citation
- Cited by 4
David K. Lewis. Counterfactuals. Harvard University Press, Cambridge, Mass., 1973, x + 150 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 278-281
-
- Article
- Export citation
- Cited by 4
Gregory J. Chaitin, Algorithmic information theory, Cambridge tracts in theoretical computer science, no. 1. Cambridge University Press, Cambridge etc. 1987, xi + 175 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 624-627
-
- Article
- Export citation
- Cited by 4
CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES
-
- Published online by Cambridge University Press:
- 04 March 2019, pp. 1136-1167
-
- Article
- Export citation
- Cited by 4
On decomposition of Gödelnumberings into Friedbergnumberings
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 267-274
-
- Article
- Export citation
- Cited by 4
Atomless varieties
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 607-614
-
- Article
- Export citation
- Cited by 4
The weak square property
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 640-657
-
- Article
- Export citation
- Cited by 4
UNIVERSAL ROSSER PREDICATES
-
- Published online by Cambridge University Press:
- 21 March 2017, pp. 292-302
-
- Article
- Export citation
- Cited by 4
A CO-ANALYTIC COHEN-INDESTRUCTIBLE MAXIMAL COFINITARY GROUP
-
- Published online by Cambridge University Press:
- 19 June 2017, pp. 629-647
-
- Article
- Export citation
- Cited by 4
Flipping properties in arithmetic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 416-422
-
- Article
- Export citation
- Cited by 4
The canary tree revisited
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1677-1694
-
- Article
- Export citation
- Cited by 4
ω-homomorphisms and ω-groups1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 55-65
-
- Article
- Export citation
- Cited by 4
Connexive class logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 83-90
-
- Article
- Export citation