scientific article; zbMATH DE number 3503199
From MaRDI portal
Publication:4083398
zbMath0322.02023MaRDI QIDQ4083398
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursively (computably) enumerable sets and degrees (03D25) Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals ⋮ Unique normal forms for lambda calculus with surjective pairing ⋮ Expressibility of functionals in D. Scott's LCF language ⋮ Embeddings between partial combinatory algebras ⋮ Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees ⋮ Finite type structures within combinatory algebras ⋮ Defining totality in the enumeration degrees ⋮ On the confluence of lambda-calculus with conditional rewriting ⋮ A global representation of the recursive functions in the \(\lambda\)- calculus ⋮ Three theories of nominalized predicates
