AI Chat AI Image Generator AI Video Text to Speech

Partial combinatory algebra and generalized numberings

10/17/2019

∙

by H. P. Barendregt, et al.

∙

∙

Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the numbering to properties of the pca. As in the lambda calculus, extensionality is a key notion here.

H. P. Barendregt
1 publication
S. A. Terwijn
3 publications

page 1

page 2

page 3

page 4

research

∙ 10/21/2019

Computability in partial combinatory algebras

We prove a number of elementary facts about computability in partial com...

0 S. A. Terwijn, et al. ∙

research

∙ 07/14/2020

Local Sufficiency for Partial Strategyproofness

In (Mennle and Seuken, 2017), we have introduced partial strategyproofne...

0 Timo Mennle, et al. ∙

research

∙ 10/31/2020

General Data Analytics with Applications to Visual Information Analysis: A Provable Backward-Compatible Semisimple Paradigm over T-Algebra

We consider a novel backward-compatible paradigm of general data analyti...

0 Liang Liao, et al. ∙

research

∙ 08/02/2021

Generalized permutahedra and optimal auctions

We study a family of convex polytopes, called SIM-bodies, which were int...

0 Michael Joswig, et al. ∙

research

∙ 09/01/2022

A (Co)Algebraic Framework for Ordered Processes

A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offe...

0 Todd Schmid, et al. ∙

research

∙ 10/23/2020

Ordinal analysis of partial combinatory algebras

For every partial combinatory algebra (pca), we define a hierarchy of ex...

0 Paul Shafer, et al. ∙

research

∙ 12/08/2020

Generalized iterated-sums signatures

We explore the algebraic properties of a generalized version of the iter...

0 Joscha Diehl, et al. ∙