3 citations · 4 across the 5 of their papers we have counts for
5 papers
Axiomatizing consciousness, with applications
Henk Barendregt, Antonino Raffone
Consciousness will be introduced axiomatically, inspired by Buddhist insight meditation and psychology, logic in computer science, and cognitive neuroscience, as consisting of a st…
Partial combinatory algebra and generalized numberings
H. P. Barendregt, S. A. Terwijn
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 prope…
Gems of Corrado Böhm
Henk P. Barendregt
The main scientific heritage of Corrado Böhm consists of ideas about computing, concerning concrete algorithms, as well as models of computability. The following will be presented.…
Fixed point theorems for precomplete numberings
H. P. Barendregt, S. A. Terwijn
In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Am…
Statman's Hierarchy Theorem
Bram Westerbaan, Bas Westerbaan, Rutger Kuyper +3
In the Simply Typed -calculus Statman investigates the reducibility relation between types: for , types freely generated using an…