Article contents
Infinite products of recursive equivalence types
Published online by Cambridge University Press: 12 March 2014
Extract
Remark 1. Finite sums and products of recursive equivalence types have been defined (see [1, p. 73 for sums and p. 130 for products]) and many of their algebraic properties revealed. It seems natural to ask if infinite sums and products can be defined in a natural manner and an algebra of such sums and products developed. The initial work in this direction is to be found in [2], [3] and [4]. In this paper we extend the above studies, concentrating for the most part on products.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1968
References
- 2
- Cited by