scientific article; zbMATH DE number 3503200
From MaRDI portal
Publication:4083399
zbMath0322.02024MaRDI QIDQ4083399
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
Easy lambda-terms are not always simple ⋮ Unnamed Item ⋮ Domain theory aspects of extensions of integral domains ⋮ A mathematical semantics for a nondeterministic typed lambda-calculus ⋮ The algebra of partial equivalence relations ⋮ Cartesian closed categories of separable Scott domains ⋮ An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus ⋮ Quotient-reflective and bireflective subcategories of the category of preordered sets ⋮ A topology on lattice-ordered groups ⋮ Semantics of algorithmic languages ⋮ Generalized quasi-metric semilattices ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
