Abstract
Let ε and Λ denote the sets of all nonnegative integers and isols respectively. Let σ be any subset of ε. Following [6], we shall denote the recursive equivalence type of a by Req(σ) and write σ≃τ when Req(σ) = Req(τ).
Publisher
Cambridge University Press (CUP)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chapter 17 Constructive abelian groups;Studies in Logic and the Foundations of Mathematics;1998
2. Introduction to the handbook of recursive mathematics;Studies in Logic and the Foundations of Mathematics;1998
3. Introduction to the handbook of Recursive Mathematics;Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory;1998
4. The Work of Anil Nerode: A Retrospective;Logical Methods;1993
5. Sound, totally sound, and unsound recursive equivalence types;Annals of Pure and Applied Logic;1986