English

Completions of Kleene's second model

Logic in Computer Science 2025-06-11 v7 Logic

Abstract

We investigate completions of partial combinatory algebras (pcas), in particular of Kleene's second model K2\mathcal{K}_2 and generalizations thereof. We consider weak and strong notions of embeddability and completion that have been studied before in the literature. It is known that every countable pca can be weakly embedded into K2\mathcal{K}_2, and we generalize this to arbitrary cardinalities by considering generalizations of K2\mathcal{K}_2 for larger cardinals. This emphasizes the central role of K2\mathcal{K}_2 in the study of pcas. We also show that K2\mathcal{K}_2 and its generalizations have strong completions.

Keywords

Cite

@article{arxiv.2312.14656,
  title  = {Completions of Kleene's second model},
  author = {Sebastiaan A. Terwijn},
  journal= {arXiv preprint arXiv:2312.14656},
  year   = {2025}
}