scientific article; zbMATH DE number 3531367
From MaRDI portal
Publication:4108313
zbMath0341.02035MaRDI QIDQ4108313
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory (03D99) Combinatory logic and lambda calculus (03B40)
Related Items
Computation on abstract data types. The extensional approach, with an application to streams, Degrees of parallelism in the continuous type hierarchy, A stable programming language, On the expressive power of first-order boolean functions in PCF, Feferman on Computability, Natural non-dcpo domains and f-spaces, The sequentially realizable functionals, Relative definability of boolean functions via hypergraphs
