Computable functionals of finite types

DOI10.1007/BF02219096zbMath0285.02040MaRDI QIDQ1844827

Yuri L. Ershov

Publication date: 1973

Published in: Algebra and Logic (Search for Journal in Brave)

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55) Proof theory and constructive mathematics (03F99)

Related Items

Formal contexts for algebraic domains, Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, Two categories of effective continuous cpos, Towards a descriptive set theory for domain-like structures, On the Lattices of Effectively Open Sets, Effective inseparability in a topological setting, Computation on abstract data types. The extensional approach, with an application to streams, The bounded-complete hull of an \(\alpha\)-space, On naturally continuous non-dcpo domains, Some results related to the continuity problem, How much partiality is needed for a theory of computability?, Domain theory in logical form, Computable and Continuous Partial Homomorphisms on Metric Partial Algebras, Friedberg numberings of families of partial computable functionals, Computability in higher types, P\(\omega\) and the completeness of type assignment, Representations versus numberings: On the relationship of two computability notions, On Natural Non-dcpo Domains, On function spaces, Feferman on Computability, Eine beweistheoretische Anwendung partieller stetiger Funktionale, On the classification of (effective) \(\varphi \)-spaces, Natural non-dcpo domains and f-spaces, Computing with Functionals—Computability Theory or Computer Science?, A domain-theoretic approach to computability on the real line, On combinatory algebras and their expansions, The extensional ordering of the sequential functionals, Computable Banach spaces via domain theory

Cites Work

• On the indexing of classes of recursively enumerable sets
• Unnamed Item
• Unnamed Item