Recursive equivalence types and groups

  • Hassett M
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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(τ).

Cite

CITATION STYLE

APA

Hassett, M. J. (1969). Recursive equivalence types and groups. Journal of Symbolic Logic, 34(1), 13–20. https://doi.org/10.2307/2270975

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free