Combinatorische volledigheid in partiële groepoïden

Open Access
Authors
Publication date 04-12-2022
Number of pages 8
Publisher Amsterdam: Instituut voor Informatica, Universiteit van Amsterdam
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
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.
Document type Working paper
Note Ook gepubliceerd in het Engels op ArXiv: Combinatory completeness in partial groupoids.
Language Dutch
Published at https://staff.fnwi.uva.nl/p.h.rodenburg/Varia/pca.pdf
Downloads
pca (Final published version)
Permalink to this page
Back