The following pages link to Dieter Spreen (Q582907):
Displaying 49 items.
- (Q235221) (redirect page) (← links)
- Computable one-to-one enumerations of effective domains (Q582908) (← links)
- Generalised information systems capture L-domains (Q831140) (← links)
- Information systems revisited -- the general continuous case (Q949623) (← links)
- A constructive theory of continuous domains suitable for implementation (Q1023289) (← links)
- On some properties of the Cesaro limit of a stochastic matrix (Q1157376) (← links)
- On functions preserving levels of approximation: A refined model construction for various lambda calculi (Q1275633) (← links)
- Corrigendum to ``On functions preserving levels of approximation: A refined model construction for various lambda calculi'' (Q1603387) (← links)
- Strong reducibility of partial numberings (Q1766927) (← links)
- On some decision problems in programming (Q1900317) (← links)
- Effective inseparability in a topological setting (Q1923565) (← links)
- (Q2757845) (← links)
- Can partial indexings be totalized? (Q2758051) (← links)
- (Q2767025) (← links)
- A coinductive approach to computing with compact sets (Q2974666) (← links)
- Safe Weak Minimization Revisited (Q3149881) (← links)
- (Q3335771) (← links)
- (Q3484824) (← links)
- Effectivity and effective continuity of multifunctions (Q3570164) (← links)
- Every $\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence (Q3576227) (← links)
- (Q3633259) (← links)
- (Q3785939) (← links)
- (Q3809789) (← links)
- (Q3826115) (← links)
- (Q3883937) (← links)
- A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs (Q3901334) (← links)
- A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs (Q3921021) (← links)
- (Q3975033) (← links)
- (Q4217610) (← links)
- On effective topological spaces (Q4391431) (← links)
- (Q4528533) (← links)
- Some results related to the continuity problem (Q4593245) (← links)
- A note on partial numberings (Q4666942) (← links)
- The largest Cartesian closed category of domains, considered constructively (Q4675770) (← links)
- (Q4720788) (← links)
- (Q4730783) (← links)
- (Q4749619) (← links)
- On the Continuity of Effective Multifunctions (Q4918021) (← links)
- (Q4981459) (← links)
- (Q4982341) (← links)
- (Q4982355) (← links)
- (Q4982356) (← links)
- (Q5094901) (← links)
- Computing with continuous objects: a uniform co-inductive approach (Q5156773) (← links)
- (Q5457390) (← links)
- Corrigendum (Q5890200) (← links)
- Representations versus numberings: On the relationship of two computability notions (Q5958133) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)
- How much partiality is needed for a theory of computability? (Q6146825) (← links)
