ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS

DOI10.1017/jsl.2021.50OpenAlexW3171268278MaRDI QIDQ5015728

Paul Shafer, Sebastiaan A. Terwijn

Publication date: 9 December 2021

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

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

zbMATH Keywords

extensionalitylambda calculuspartial combinatory algebrahyperarithmetical sets

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Combinatory logic and lambda calculus (03B40) Other Turing degree structures (03D28)

Related Items (1)

Embeddings between partial combinatory algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general form of relative recursion
• Realizability. An introduction to its categorical side
• Realizability and recursive set theory
• Classical recursion theory. The theory of functions and sets of natural numbers
• Constructivism in mathematics. An introduction. Volume II
• Index sets for \(\Pi^0_1\) classes
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Computable structures and the hyperarithmetical hierarchy
• Fixed point theorems for precomplete numberings
• Recursive well-orderings
• Hyperarithmetical Sets
• Higher-Order Computability
• On the existence of extensional partial combinatory algebras
• Monotone inductive definitions over the continuum
• Up to equimorphism, hyperarithmetic is recursive
• On notation for ordinal numbers

This page was built for publication: ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS