Countable vector spaces with recursive operations Part I1
- 17 November 1969
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 34 (3) , 363-387
- https://doi.org/10.2307/2270903
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.Keywords
This publication has 3 references indexed in Scilit:
- Recursive equivalence types and groupsThe Journal of Symbolic Logic, 1969
- Recursive Equivalence Types. By J C. E. Dekker and J. Myhill. 1960. University of California Publications in Mathematics. N.S. Vol. 3 No. 3, pp. 67–214).The Mathematical Gazette, 1962
- Classes of recursively enumerable sets and their decision problemsTransactions of the American Mathematical Society, 1953