Computable functionals of finite types

DOI10.1007/BF02219096zbMATH Open0285.02040MaRDI QIDQ1844827FDOQ1844827

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)

Cites Work

• Title not available (Why is that?)
• On the indexing of classes of recursively enumerable sets
• Title not available (Why is that?)

Cited In (28)

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

This page was built for publication: Computable functionals of finite types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844827)