All Stories

  1. How much partiality is needed for a theory of computability?
  2. On the main scientific achievements of Victor Selivanov
  3. Some results related to the continuity problem
  4. Preface to the special issue: Computing with infinite data: topological and logical foundations
  5. PARTIAL NUMBERINGS AND PRECOMPLETENESS
  6. The life and work of Victor L. Selivanov
  7. AN ISOMORPHISM THEOREM FOR PARTIAL NUMBERINGS
  8. Logic, Computation, Hierarchies
  9. Representing L-Domains as Information Systems
  10. Foreword
  11. Effectivity and effective continuity of multifunctions
  12. Every $\Delta^0_2$ -Set Is Natural, Up to Turing Equivalence
  13. On the Continuity of Effective Multifunctions
  14. Foreword
  15. Information systems revisited — the general continuous case
  16. On some problems in computable topology
  17. Foreword
  18. The largest Cartesian closed category of domains, considered constructively
  19. Partial numberings
  20. Strong reducibility of partial numberings
  21. Foreword
  22. A Note on Strongly Finite Sequent Structures
  23. Safe Weak Minimization Revisited
  24. Can partial indexings be totalized?
  25. Corrigendum to “On functions preserving levels of approximation: a refined model construction for various lambda calculi” [Theoret. Comput. Sci. 212 (1999) 261–303]
  26. Representations versus numberings: on the relationship of two computability notions
  27. On The Equivalence of Some Approaches to Computability on the Real Line
  28. Corrigendum
  29. Preface
  30. On functions preserving levels of approximation: A refined model construction for various lambda calculi
  31. On effective topological spaces
  32. Effective inseparability in a topological setting
  33. On Some Decision Problems in Programming
  34. A characterization of effective topological spaces
  35. Computable one-to-one enumerations of effective domains
  36. Computable one-to-one enumerations of effective domains
  37. On functions computable in nondeterministic polynomial time: Some characterizations
  38. On the power of single-valued nondeterministic polynomial time computations
  39. Effective operators in a topological setting
  40. On r.e. inseparability of CPO index sets
  41. On some properties of the Cesàro limit of a stochastic matrix
  42. A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs
  43. A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs
  44. Effective operators and continuity revisited
  45. A New Model Construction for the Polymorphic Lambda Calculus