On computability with functionals
From MaRDI portal
Publication:1212452
DOI10.1007/BF02218586zbMath0294.02019OpenAlexW1985178500MaRDI QIDQ1212452
Publication date: 1975
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02218586
Recursive equivalence types of sets and structures, isols (03D50) Computability and recursion theory (03D99)
Related Items
Elementary theories and hereditary undecidability for semilattices of numberings ⋮ Families without minimal numberings
Cites Work