Some remarks about the connections between Combinatory Logic and axiomatic recursion theory

DOI10.1007/BF02007262zbMath0365.02028MaRDI QIDQ4141226

G. Mitschke, Roger Hindley

Publication date: 1977

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137932

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99) Combinatory logic and lambda calculus (03B40)

Related Items (2)

On the problem of deciding equality in partial combinatory algebras and in a formal system ⋮ Aλδ-calculus with an algorithmicδ

Cites Work

• Combinatory logic. With two sections by William Craig.
• Combinatory logic. Vol. II
• Algebraically Generalized Recursive Function Theory
• Uniformly Reflexive Structures: On the Nature of Godelizations and Relative Computability

This page was built for publication: Some remarks about the connections between Combinatory Logic and axiomatic recursion theory