Professor Dieter Spreen
University of Siegen
Emeritus, Computer Science
Germany
My co-authors include
Dr Vasco Azevedo
Professor Vasco Brattka
Victor Selivanov
My Publications
Some results related to the continuity problem
Mathematical Structures in Computer Science
June 2016
Preface to the special issue: Computing with infinite data: topological and logical fou...
Mathematical Structures in Computer Science
November 2014
Logic, Computation, Hierarchies
January 2014
Foreword
Annals of Pure and Applied Logic
August 2012
Effectivity and effective continuity of multifunctions
Journal of Symbolic Logic
June 2010
Every $\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence
January 2010
On the Continuity of Effective Multifunctions
Electronic Notes in Theoretical Computer Science
December 2008
Foreword
Theoretical Computer Science
October 2008
Information systems revisited — the general continuous case
Theoretical Computer Science
October 2008
Foreword
Theoretical Computer Science
November 2006
The largest Cartesian closed category of domains, considered constructively
Mathematical Structures in Computer Science
April 2005
Partial numberings
Mathematical Logic Quarterly
February 2005
Strong reducibility of partial numberings
Archive for Mathematical Logic
August 2004
Foreword
Theoretical Computer Science
August 2003
A Note on Strongly Finite Sequent Structures
January 2003
Safe Weak Minimization Revisited
SIAM Journal on Computing
January 2002
Can partial indexings be totalized?
Journal of Symbolic Logic
September 2001
Corrigendum to “On functions preserving levels of approximation: a refined model constr...
Theoretical Computer Science
September 2001
Representations versus numberings: on the relationship of two computability notions
Theoretical Computer Science
July 2001
On The Equivalence of Some Approaches to Computability on the Real Line
January 2001
Corrigendum
Journal of Symbolic Logic
December 2000
Preface
Electronic Notes in Theoretical Computer Science
January 2000
On functions preserving levels of approximation: A refined model construction for vario...
Theoretical Computer Science
February 1999
On effective topological spaces
Journal of Symbolic Logic
March 1998
Effective inseparability in a topological setting
Annals of Pure and Applied Logic
August 1996
On Some Decision Problems in Programming
Information and Computation
October 1995
A characterization of effective topological spaces
January 1990
Computable one-to-one enumerations of effective domains
Information and Computation
January 1990
Computable one-to-one enumerations of effective domains
January 1988
On functions computable in nondeterministic polynomial time: Some characterizations
January 1988
On the power of single-valued nondeterministic polynomial time computations
January 1987
Effective operators in a topological setting
January 1984
On r.e. inseparability of CPO index sets
January 1984
On some properties of the Cesàro limit of a stochastic matrix
Linear Algebra and its Applications
December 1981
A further anticycling rule in multichain policy iteration for undiscounted Markov renew...
Mathematical Methods of Operations Research
July 1981
A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov...
Management Science
December 1980
PARTIAL NUMBERINGS AND PRECOMPLETENESS
Representing L-Domains as Information Systems
The life and work of Victor L. Selivanov
AN ISOMORPHISM THEOREM FOR PARTIAL NUMBERINGS
Effective operators and continuity revisited
A New Model Construction for the Polymorphic Lambda Calculus
On some problems in computable topology