Stephan WehnerBlog and Homepage

Publications

Ph.D. Thesis

Computable Enumeration and the Problem of Repetition, Department of Mathematics and Statistics, Simon Fraser University, Burnaby 1995

Mathematical Journal Articles

  • Kummer M., Wehner S., Yi X.; Discrete Families of Recursive Functions and Index Sets, Algebra and Logic 33, (1994), p. 85 – 94.
  • Wehner S.,The index set of injectiveley enumerable classes of recursively enumerable sets is Sigma_5 – complete, Mathematical Logic Quarterly 40, (1994), p. 87 – 94, postscript or postscript gz.
  • Wehner S., On injective enumerability of recursively enumerable classes of cofinite sets, Archive for Mathematical Logic 34, (1995), p. 183 – 196, postscript or postscript gz.
  • Wehner S., Enumerations, Countable Structures and Turing Degrees, Proceedings of the American Mathematical Society, July 1998, postscript or postscript gz.
  • Wehner S., On recursive enumerability with finite repetitions, Journal of Symbolic Logic, Volume 64, Number 3, 1999, postscript or postscript gz.
  • Harrison L.G.; Wehner S.; Holloway DM., Complex morphogenesis of surfaces: theory and experiment on coupling of reaction-diffusion patterning to growth, Faraday Discussions 120 (2001), p. 277 – 294.
  • Nagata W., Harrison G., Wehner S., Reaction-Diffusion Models of Growing Plant Tips: Bifurcations on Hemispheres, Bulletin of Mathematical Biology, Volume 65, Issue 4 , July 2003, p. 571-607.

Book

  • Traffic Life : Passionate Tales and Exit Strategies, Ed. Stephan Wehner, Vancouver, BC January 2004. ISBN: 0-9734022-0-2 website

Website

Powered by WordPress