Combinatory completeness in partial groupoids
Logic
2023-02-21 v1
Abstract
I characterize the combinatorially complete pargoids (partial applicative systems) by expandability with two constants that satisfy the well-known identities. An example shows that this class contains more than just the reducts of partial combinatory algebras.
Keywords
Cite
@article{arxiv.2302.09982,
title = {Combinatory completeness in partial groupoids},
author = {Pieter Rodenburg},
journal= {arXiv preprint arXiv:2302.09982},
year = {2023}
}
Comments
8 pages. Nederlands origineel: https://staff.fnwi.uva.nl/p.h.rodenburg/Varia/pca.pdf