COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS

DOI10.1017/bsl.2020.46zbMath1465.03078arXiv1910.09258OpenAlexW3119597308MaRDI QIDQ4984865

Sebastiaan A. Terwijn

Publication date: 21 April 2021

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.09258

zbMATH Keywords

undecidabilitypartial combinatory algebraextensional models1--1 numberings

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Combinatory logic and lambda calculus (03B40) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general form of relative recursion
• Introduction to Turing categories
• Realizability. An introduction to its categorical side
• Classical recursion theory. The theory of functions and sets of natural numbers
• Constructivism in mathematics. An introduction. Volume II
• Index sets of quotient objects of the Post numeration
• Extensions of Scott's graph model and Kleene's second algebra
• Fixed point theorems for precomplete numberings
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Higher-Order Computability
• Some reasons for generalising domain theory
• Theorie der Numerierungen I
• Collapsing partial combinatory algebras
• GENERALIZATIONS OF THE RECURSION THEOREM
• Extending partial combinatory algebras
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus

This page was built for publication: COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS