Prime and Search Computability, Characterized as Definability in Certain Sublanguages of Constructible L ω1, ω

Carl E. Gordon · Transactions of the American Mathematical Society · 1974

Carl E. Gordon, Prime and Search Computability, Characterized as Definability in Certain Sublanguages of Constructible Lω 1, ω, Transactions of the American Mathematical Society, Vol. 197 (Oct., 1974), pp. 391-407

Read the paper · More papers on PaperTik