A sufficient condition for completability of partial combinatory algebras (Q4382471)

A partial combinatory algebra (PCA) \((M,-,K,S)\) is total if, for every \(a,b\in M\), \(ab\) is defined. A PCA \((M,-,K,S)\) is completable if there is a total PCA \((M',-',K',S')\) and an injection \(\varphi:M\to M'\) such that for all defined \(ab\in M\): \[ \varphi(ab)= \varphi(a).\varphi(b). \] It is strongly completable if also \(\varphi(K)= K'\) and \(\varphi(S)= S'\). It was known that a PCA is strongly completable if 9 inequalities and the axiom \[ a,b,c,d\in M \& Sab= Scd\to a=c\wedge b=d \] held. The authors show that the axiom alone is sufficient to prove completability.