Recursively enumerable classes and their application to recursive sequences of formal theories
- 1 December 1965
- journal article
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 8 (3-4) , 104-121
- https://doi.org/10.1007/bf01976264
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- Some theorems on classes of recursively enumerable setsTransactions of the American Mathematical Society, 1958
- Two theories with axioms built by means of pleonasmsThe Journal of Symbolic Logic, 1957