Representations in measure theory: between a non-computable rock and a hard to prove place.

Dag Normann, Sam Sanders

Type: Preprint

Publication Date: 2019-02-07

Citations: 1

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	On the logical and computational properties of the Vitali covering theorem	2019	Dag Normann Sam Sanders
+	The strength of compactness in Computability Theory and Nonstandard Analysis	2019	Dag Normann Sam Sanders
+	The strength of compactness in Computability Theory and Nonstandard Analysis	2018	Dag Normann Sam Sanders
+	On the logical and computational properties of the Vitali covering theorem	2024	Dag Normann Sam Sanders
+ PDF Chat	Coding is hard	2024	Sam Sanders
+	Computability of the Radon-Nikodym derivative	2011	Mathieu Hoyrup Cristóbal Rojas Klaus Weihrauch
+	Computability of the Radon-Nikodym derivative	2011	Mathieu Hoyrup Cristóbal Rojas Klaus Weihrauch
+	Computability on the countable ordinals and the Hausdorff-Kuratowski theorem.	2015	Arno Pauly
+	Computability Theory	2022	Vasco Brattka Noam Greenberg I. Sh. Kalimullin Mariya I. Soskova
+	Determinacy from strong compactness of $ω_1$	2016	Nam Trang Trevor M. Wilson
+	Pincherle's theorem in reverse mathematics and computability theory	2020	Dag Normann Sam Sanders
+	Pincherle's theorem in Reverse Mathematics and computability theory	2018	Dag Normann Sam Sanders
+ PDF Chat	Representations of measurable sets in computable measure theory	2014	Klaus Weihrauch N. R. Tavana
+ PDF Chat	COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS	2019	Dag Normann Sam Sanders
+ PDF Chat	Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)	2015	Arno Pauly
+	Absolutely non-computable predicates and functions in analysis	2009	Klaus Weihrauch Yongcheng Wu Decheng Ding
+	Reverse mathematics of compact countable second-countable spaces	2011	François G. Dorais
+	Computability of the Radon-Nikodym Derivative	2012	Mathieu Hoyrup Cristóbal Rojas Klaus Weihrauch
+ PDF Chat	On the mathematical and foundational significance of the uncountable	2018	Dag Normann Sam Sanders
+	Closed Sets and Operators thereon: Representations, Computability and Complexity	2017	Carsten Rösnick-Neugebauer

Works That Cite This (1)

Action	Title	Year	Authors
+	Pincherle's theorem in reverse mathematics and computability theory	2020	Dag Normann Sam Sanders

Works Cited by This (22)

Action	Title	Year	Authors
+	Monotone Convergence Theorem for the Riemann Integral	2010	Brian S. Thomson
+	Higher Recursion Theory	2017	Gerald E. Sacks
+	A Modern Theory of Integration	2001	Robert G. Bartle
+	A general theory of integration in function spaces : including Wiener and Feynman integration	1987	P. Muldowney
+	A Model of Set-Theory in Which Every Set of Reals is Lebesgue Measurable	1970	Robert M Solovay
+	Lectures on the theory of functions	1944	John Edensor Littlewood
+	Partial realizations of Hilbert's program	1988	Stephen G. Simpson
+	Uniform versions of some axioms of second order arithmetic	2004	Nobuyuki Sakamoto Takeshi Yamazaki
+ PDF Chat	Measure theory and higher order arithmetic	2015	Alexander Kreuzer
+	Algorithmic randomness, reverse mathematics, and the dominated convergence theorem	2012	Jeremy Avigad E.T.R. Dean Jason Rute