8 results
Weakly semirecursive sets
-
- Journal:
- The Journal of Symbolic Logic / Volume 55 / Issue 2 / June 1990
- Published online by Cambridge University Press:
- 12 March 2014, pp. 637-644
- Print publication:
- June 1990
-
- Article
- Export citation
A cardinality version of Beigel's nonspeedup theorem
-
- Journal:
- The Journal of Symbolic Logic / Volume 54 / Issue 3 / September 1989
- Published online by Cambridge University Press:
- 12 March 2014, pp. 761-767
- Print publication:
- September 1989
-
- Article
- Export citation
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 (1965), pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 (1964), pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 (1967), pp. 99–100.
-
- Journal:
- The Journal of Symbolic Logic / Volume 38 / Issue 1 / March 1973
- Published online by Cambridge University Press:
- 12 March 2014, pp. 155-156
- Print publication:
- March 1973
-
- Article
- Export citation
A splitting theorem for simple Π11 Sets
-
- Journal:
- The Journal of Symbolic Logic / Volume 36 / Issue 3 / September 1971
- Published online by Cambridge University Press:
- 12 March 2014, pp. 433-438
- Print publication:
- September 1971
-
- Article
- Export citation
The Meta-R.E. sets, but not the Π11 sets, can be enumerated without repetition
-
- Journal:
- The Journal of Symbolic Logic / Volume 35 / Issue 2 / June 1970
- Published online by Cambridge University Press:
- 12 March 2014, pp. 223-229
- Print publication:
- June 1970
-
- Article
- Export citation
Robert W. Robinson. Simplicity of recursively enumerable sets. The journal of symbolic logic, vol. 32 (1967), pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 (1967), pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 130 (1968), pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 (1968), pp. 123–146.
-
- Journal:
- The Journal of Symbolic Logic / Volume 35 / Issue 1 / March 1970
- Published online by Cambridge University Press:
- 12 March 2014, pp. 153-155
- Print publication:
- March 1970
-
- Article
- Export citation
Π11 Sets, ω-Sets, and metacompleteness
-
- Journal:
- The Journal of Symbolic Logic / Volume 34 / Issue 2 / 25 July 1969
- Published online by Cambridge University Press:
- 12 March 2014, pp. 194-204
- Print publication:
- 25 July 1969
-
- Article
- Export citation
Recursion, metarecursion, and inclusion
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 2 / August 1967
- Published online by Cambridge University Press:
- 12 March 2014, pp. 173-179
- Print publication:
- August 1967
-
- Article
- Export citation