Pages that link to "Item:Q1844827"
From MaRDI portal
The following pages link to Computable functionals of finite types (Q1844827):
Displayed 27 items.
- Formal contexts for algebraic domains (Q276430) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- On combinatory algebras and their expansions (Q760416) (← links)
- The extensional ordering of the sequential functionals (Q764278) (← links)
- Two categories of effective continuous cpos (Q854182) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- On the classification of (effective) \(\varphi \)-spaces (Q1023292) (← links)
- Natural non-dcpo domains and f-spaces (Q1023300) (← links)
- Domain theory in logical form (Q1174593) (← links)
- A domain-theoretic approach to computability on the real line (Q1274807) (← links)
- Computable Banach spaces via domain theory (Q1292403) (← links)
- The bounded-complete hull of an \(\alpha\)-space (Q1392140) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- Effective inseparability in a topological setting (Q1923565) (← links)
- Computation on abstract data types. The extensional approach, with an application to streams (Q1923575) (← links)
- Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
- On the Lattices of Effectively Open Sets (Q3188269) (← links)
- Eine beweistheoretische Anwendung partieller stetiger Funktionale (Q4184826) (← links)
- On naturally continuous non-dcpo domains (Q4593242) (← links)
- Some results related to the continuity problem (Q4593245) (← links)
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras (Q4650302) (← links)
- Feferman on Computability (Q5214780) (← links)
- On Natural Non-dcpo Domains (Q5452201) (← links)
- Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
- On function spaces (Q5918963) (← links)
- Representations versus numberings: On the relationship of two computability notions (Q5958133) (← links)
- How much partiality is needed for a theory of computability? (Q6146825) (← links)