<--- Back to Details
First PageDocument Content
Topology / Functional analysis / General topology / Theory of computation / Descriptive set theory / Computable analysis / Computable function / Mathematical analysis / Baire space / Mathematics / Mathematical logic / Computability theory
Date: 2012-01-12 03:38:24
Topology
Functional analysis
General topology
Theory of computation
Descriptive set theory
Computable analysis
Computable function
Mathematical analysis
Baire space
Mathematics
Mathematical logic
Computability theory

Report from Dagstuhl Seminar[removed]Computing with Infinite Data: Topological and Logical

Add to Reading List

Source URL: drops.dagstuhl.de

Download Document from Source Website

File Size: 802,71 KB

Share Document on Facebook

Similar Documents

arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly

arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly

DocID: 1sRZe - View Document

A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi

A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi

DocID: 1rjEK - View Document

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡  Abstract

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ Abstract

DocID: 1qlxM - View Document

PDF Document

DocID: 1pZ37 - View Document

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

DocID: 1pMn0 - View Document