All Stories

  1. How much partiality is needed for a theory of computability?

    Article • Computability, December 2023, IOS Press

    Professor Dieter Spreen

  2. On the main scientific achievements of Victor Selivanov

    Article • Computability, December 2023, IOS Press

    Professor Dieter Spreen

  3. Some results related to the continuity problem

    Article • Mathematical Structures in Computer Science, June 2016, Cambridge University Press

    Professor Dieter Spreen

  4. Preface to the special issue: Computing with infinite data: topological and logical foundations

    Article • Mathematical Structures in Computer Science, November 2014, Cambridge University Press

    Professor Vasco Brattka, Professor Dieter Spreen, Victor Selivanov

  5. PARTIAL NUMBERINGS AND PRECOMPLETENESS

    Article • July 2014, De Gruyter

    Professor Dieter Spreen

  6. The life and work of Victor L. Selivanov

    Article • July 2014, De Gruyter

    Professor Dieter Spreen

  7. AN ISOMORPHISM THEOREM FOR PARTIAL NUMBERINGS

    Article • July 2014, De Gruyter

    Professor Dieter Spreen

  8. Logic, Computation, Hierarchies

    Article • January 2014, De Gruyter

    Professor Vasco Brattka, Professor Dieter Spreen, Dr Vasco Azevedo

  9. Representing L-Domains as Information Systems

    Article • December 2012, De Gruyter

    Professor Dieter Spreen

  10. Foreword

    Article • Annals of Pure and Applied Logic, August 2012, Elsevier

    Professor Vasco Brattka, Professor Dieter Spreen

  11. Effectivity and effective continuity of multifunctions

    Article • Journal of Symbolic Logic, June 2010, Cambridge University Press

    Professor Dieter Spreen

  12. Every $\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence

    Article • January 2010, Springer Science + Business Media

    Professor Dieter Spreen

  13. On the Continuity of Effective Multifunctions

    Article • Electronic Notes in Theoretical Computer Science, December 2008, Elsevier

    Professor Dieter Spreen

  14. Foreword

    Article • Theoretical Computer Science, October 2008, Elsevier

    Professor Dieter Spreen

  15. Information systems revisited — the general continuous case

    Article • Theoretical Computer Science, October 2008, Elsevier

    Professor Dieter Spreen

  16. On some problems in computable topology

    Article • December 2007, Cambridge University Press

    Professor Dieter Spreen

  17. Foreword

    Article • Theoretical Computer Science, November 2006, Elsevier

    Professor Dieter Spreen

  18. The largest Cartesian closed category of domains, considered constructively

    Article • Mathematical Structures in Computer Science, April 2005, Cambridge University Press

    Professor Dieter Spreen

  19. Partial numberings

    Article • Mathematical Logic Quarterly, February 2005, Wiley

    Professor Dieter Spreen

  20. Strong reducibility of partial numberings

    Article • Archive for Mathematical Logic, August 2004, Springer Science + Business Media

    Professor Dieter Spreen

  21. Foreword

    Article • Theoretical Computer Science, August 2003, Elsevier

    Professor Dieter Spreen

  22. A Note on Strongly Finite Sequent Structures

    Article • January 2003, Springer Science + Business Media

    Professor Dieter Spreen

  23. Safe Weak Minimization Revisited

    Article • SIAM Journal on Computing, January 2002, Society for Industrial & Applied Mathematics (SIAM)

    Professor Dieter Spreen

  24. Can partial indexings be totalized?

    Article • Journal of Symbolic Logic, September 2001, Cambridge University Press

    Professor Dieter Spreen

  25. Corrigendum to “On functions preserving levels of approximation: a refined model construction for various lambda calculi” [Theoret. Comput. Sci. 212 (1999) 261–303]

    Article • Theoretical Computer Science, September 2001, Elsevier

    Professor Dieter Spreen

  26. Representations versus numberings: on the relationship of two computability notions

    Article • Theoretical Computer Science, July 2001, Elsevier

    Professor Dieter Spreen

  27. On The Equivalence of Some Approaches to Computability on the Real Line

    Article • January 2001, Springer Science + Business Media

    Professor Dieter Spreen

  28. Corrigendum

    Article • Journal of Symbolic Logic, December 2000, Cambridge University Press

    Professor Dieter Spreen

  29. Preface

    Article • Electronic Notes in Theoretical Computer Science, January 2000, Elsevier

    Professor Dieter Spreen

  30. On functions preserving levels of approximation: A refined model construction for various lambda calculi

    Article • Theoretical Computer Science, February 1999, Elsevier

    Professor Dieter Spreen

  31. On effective topological spaces

    Article • Journal of Symbolic Logic, March 1998, Cambridge University Press

    Professor Dieter Spreen

  32. Effective inseparability in a topological setting

    Article • Annals of Pure and Applied Logic, August 1996, Elsevier

    Professor Dieter Spreen

  33. On Some Decision Problems in Programming

    Article • Information and Computation, October 1995, Elsevier

    Professor Dieter Spreen

  34. A characterization of effective topological spaces

    Article • January 1990, Springer Science + Business Media

    Professor Dieter Spreen

  35. Computable one-to-one enumerations of effective domains

    Article • Information and Computation, January 1990, Elsevier

    Professor Dieter Spreen

  36. Computable one-to-one enumerations of effective domains

    Article • January 1988, Springer Science + Business Media

    Professor Dieter Spreen

  37. On functions computable in nondeterministic polynomial time: Some characterizations

    Article • January 1988, Springer Science + Business Media

    Professor Dieter Spreen

  38. On the power of single-valued nondeterministic polynomial time computations

    Article • January 1987, Springer Science + Business Media

    Professor Dieter Spreen

  39. Effective operators in a topological setting

    Article • January 1984, Springer Science + Business Media

    Professor Dieter Spreen

  40. On r.e. inseparability of CPO index sets

    Article • January 1984, Springer Science + Business Media

    Professor Dieter Spreen

  41. On some properties of the Cesàro limit of a stochastic matrix

    Article • Linear Algebra and its Applications, December 1981, Elsevier

    Professor Dieter Spreen

  42. A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs

    Article • Mathematical Methods of Operations Research, July 1981, Springer Science + Business Media

    Professor Dieter Spreen

  43. A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs

    Article • Management Science, December 1980, INFORMS

    Professor Dieter Spreen

  44. Effective operators and continuity revisited

    Article • Springer Science + Business Media

    Professor Dieter Spreen

  45. A New Model Construction for the Polymorphic Lambda Calculus

    Article • Springer Science + Business Media

    Professor Dieter Spreen