Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Grilliot, Thomas J.
1971.
Inductive definitions and computability.
Transactions of the American Mathematical Society,
Vol. 158,
Issue. 2,
p.
309.
Moschovakis, Yiannis N.
1971.
LOGIC COLLOQUIUM '69.
Vol. 61,
Issue. ,
p.
199.
Hinman, Peter G.
and
Moschovakis, Yiannis N.
1971.
LOGIC COLLOQUIUM '69.
Vol. 61,
Issue. ,
p.
77.
Vaught, Robert
1973.
Cambridge Summer School in Mathematical Logic.
Vol. 337,
Issue. ,
p.
574.
Grilliot, Thomas J.
1974.
Generalized Recursion Theory - Proceedings of the 1972 Oslo Symposium.
Vol. 79,
Issue. ,
p.
405.
1974.
Generalized Recursion Theory - Proceedings of the 1972 Oslo Symposium.
Vol. 79,
Issue. ,
p.
446.
Gordon, Carl E.
1974.
Prime and search computability, characterized as definability in certain sublanguages of constructible 𝐿_{𝜔}_{1,𝜔}.
Transactions of the American Mathematical Society,
Vol. 197,
Issue. 0,
p.
391.
Gandy, Robin O.
1974.
Generalized Recursion Theory - Proceedings of the 1972 Oslo Symposium.
Vol. 79,
Issue. ,
p.
265.
1974.
Elementary Induction on Abstract Structures.
Vol. 77,
Issue. ,
p.
209.
Kolaitis, Phokion G.
1978.
Cabal Seminar 76–77.
Vol. 689,
Issue. ,
p.
209.
Kolaitis, Phokion G.
1981.
Logic Year 1979–80.
Vol. 859,
Issue. ,
p.
104.
Ershov, A. P.
1981.
Algorithms in Modern Mathematics and Computer Science.
Vol. 122,
Issue. ,
p.
397.
1981.
Fundamentals of Generalized Recursion Theory.
Vol. 105,
Issue. ,
p.
297.
Soskov, Ivan N.
1990.
Computability by means of effectively definable schemes and definability via enumerations.
Archive for Mathematical Logic,
Vol. 29,
Issue. 3,
p.
187.
Kummer, Martin
1990.
Some applications of computable one-one numberings.
Archive for Mathematical Logic,
Vol. 30,
Issue. 4,
p.
219.
Soskov, Ivan N.
1991.
Second Order Definability Via enumerations.
Mathematical Logic Quarterly,
Vol. 37,
Issue. 2-4,
p.
45.
Soskov, Ivan N.
1996.
Intrinsically II Relations.
Mathematical Logic Quarterly,
Vol. 42,
Issue. 1,
p.
109.
Hemmerling, Armin
1998.
Computability of String Functions Over Algebraic Structures Armin Hemmerling.
Mathematical Logic Quarterly,
Vol. 44,
Issue. 1,
p.
1.
Stukachev, A. I.
2007.
Degrees of presentability of structures. I.
Algebra and Logic,
Vol. 46,
Issue. 6,
p.
419.
Stukachev, Alexey
2013.
Effective Mathematics of the Uncountable.
p.
164.