The Realizability Approach to Computable Analysis and Topology Andrej Bauer

First Page		Document Content
Date: 2010-06-11 17:18:33 Mathematical constructivism Logic in computer science Algebraic structures Realizability Categorical logic Function Intuitionistic logic Combinatory logic First-order logic Mathematical logic Mathematics Logic		The Realizability Approach to Computable Analysis and Topology Andrej Bauer Add to Reading List Source URL: andrej.com Download Document from Source Website File Size: 1,30 MB Share Document on Facebook

	Proof Assistants and the Dynamic Nature of Formal Theories Robert L. Constable Cornell University Abstract DocID: 1qLDo - View Document
	A sufficient condition for the continuity of permanental processes with applications to local times of Markov processes DocID: 1qnAE - View Document
	ZDM Mathematics Education:295–306 DOIs11858ORIGINAL ARTICLE Bringing forth mathematical concepts: signifying sensorimotor DocID: 1ouI7 - View Document
	Emanuele Frittaion Curriculum Vitae 2016 DocID: 1okGN - View Document
	Effective Uniform Bounds from Proofs in Abstract Functional Analysis Ulrich Kohlenbach Department of Mathematics Darmstadt University of Technology Schlossgartenstraße 7 DocID: 1oiUp - View Document