Prime and Search Computability, Characterized as Definability in Certain Sublanguages of Constructible L ω1, ω
From MaRDI portal
Publication:4108309
DOI10.2307/1996943zbMath0341.02030OpenAlexW4230426397MaRDI QIDQ4108309
Publication date: 1974
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1996943
Other infinitary logic (03C75) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items