Research Article
Diversity of speed-ups and embeddability in computational complexity1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 199-214
-
- Article
- Export citation
The ⊰-order on submodels
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 215-221
-
- Article
- Export citation
An abstraction algorithm for combinatory logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 222-224
-
- Article
- Export citation
A combinatorial property of p κλ1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 225-234
-
- Article
- Export citation
Boolean combinations of r.e. open sets
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 235-238
-
- Article
- Export citation
The truth about some Post numbers
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 239-244
-
- Article
- Export citation
A Boolean ultrapower which is not an ultrapower
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 245-249
-
- Article
- Export citation
Minimal upper bounds for ascending sequences of α-recursively enumerable degrees
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 250-260
-
- Article
- Export citation
Other
European meeting of the Association for Symbolic Logic, Kiel, 1974
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 261-278
-
- Article
- Export citation
Meeting of the Association for Symbolic Logic, Washington, D.C. 1975
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 279-288
-
- Article
- Export citation
Front matter
JSL volume 41 issue 1 Cover and Front matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Back matter
JSL volume 41 issue 1 Cover and Back matter
-
- Published online by Cambridge University Press:
- 12 March 2014, p. b1
-
- Article
-
- You have access
- Export citation