Sober Spaces and Continuations Paul Taylor August 5, 2003 Abstract A topological space is sober if it has exactly the points that are dictated by its open sets. We explain the analogy with the way in which computational

First Page		Document Content
Date: 2009-02-12 13:02:39 Functions and mappings Theoretical computer science Formal methods Models of computation Model theory Symbol Lambda calculus Interpretation Primitive recursive function Mathematics Mathematical logic Computability theory		Sober Spaces and Continuations Paul Taylor August 5, 2003 Abstract A topological space is sober if it has exactly the points that are dictated by its open sets. We explain the analogy with the way in which computational Add to Reading List Source URL: www.paultaylor.eu Download Document from Source Website File Size: 532,55 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document