Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Barendregt, Henk
and
Terwijn, Sebastiaan A.
2019.
Fixed point theorems for precomplete numberings.
Annals of Pure and Applied Logic,
Vol. 170,
Issue. 10,
p.
1151.
Terwijn, Sebastiaan A.
2020.
The noneffectivity of Arslanov’s completeness criterion and related theorems.
Archive for Mathematical Logic,
Vol. 59,
Issue. 5-6,
p.
703.
TERWIJN, SEBASTIAAN A.
2020.
COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS.
The Bulletin of Symbolic Logic,
Vol. 26,
Issue. 3-4,
p.
224.
Arslanov, M. M.
2021.
Fixed-point Selection Functions.
Lobachevskii Journal of Mathematics,
Vol. 42,
Issue. 4,
p.
685.
Barendregt, Henk
and
Terwijn, Sebastiaan A.
2022.
Partial combinatory algebra and generalized numberings.
Theoretical Computer Science,
Vol. 925,
Issue. ,
p.
37.
Golov, Anton
and
Terwijn, Sebastiaan A.
2022.
Fixpoints and relative precompleteness.
Computability,
Vol. 11,
Issue. 2,
p.
135.
Terwijn, Sebastiaan A.
2024.
Logics and Type Systems in Theory and Practice.
Vol. 14560,
Issue. ,
p.
214.