1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.LO2022★ 1 cited
Embeddings between partial combinatory algebras
Anton Golov, Sebastiaan A. Terwijn
Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the…
math.LO2021
Fixpoints and relative precompleteness
Anton Golov, Sebastiaan A. Terwijn
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use…