Abstract
We use the word “number” for “nonnegative integer” and “set” for collection of numbers. The set of all numbers is denoted by ε and the empty set by ο. We write ⊂ for the relation of inclusion and ⊆ for that of proper inclusion. If ƒ is a function from a subset of ε into ε, its domain and range are denoted by δƒ and ρƒ respectively. For any collection Γ of entities, card Γ or card (Γ) stands for the cardinality of Γ. The cardinality of the continuum is denoted by c.
Publisher
Cambridge University Press (CUP)
Reference6 articles.
1. Recursive equivalence types;Dekker;University of California Publications in Mathematics,1960
2. Recursive equivalence types and groups;Hassett;this Journal,1969
3. Classes of recursively enumerable sets and their decision problems
4. On certain vector spaces of isolic dimension;Dekker;Part,1968
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Lattice of Computably Enumerable Vector Spaces;Computability and Complexity;2016-12-01
2. Orbits of Maximal Vector Spaces;Algebra and Logic;2016-01
3. Independence in computable algebra;Journal of Algebra;2015-12
4. Iterated effective embeddings of abelian p-groups;International Journal of Algebra and Computation;2014-11
5. COMPUTABLE ABELIAN GROUPS;The Bulletin of Symbolic Logic;2014-09