Combinatory completeness in partial groupoids

Open Access
Authors
Publication date 20-02-2023
Edition v1
Number of pages 8
Publisher ArXiv
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 Preprint
Note Also published in Dutch: Combinatorische volledigheid in partiële groepoïden.
Language English
Related publication Combinatorische volledigheid in partiële groepoïden
Published at
https://doi.org/10.48550/arXiv.2302.09982 (Final published version)
Downloads
2302.09982v1 (Final published version)
Permalink to this page
Back