On the Strength of Weak Compactness

DOI10.3233/COM-12010zbMath1270.03128arXiv1106.5124OpenAlexW3104977456MaRDI QIDQ4904465

Alexander P. Kreuzer

Publication date: 30 January 2013

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.5124

zbMATH Keywords

Turing degreeweak sequential compactnessabstract Hilbert spaceWeihrauch latticeBolzano-Weierstrass principle

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80)

Related Items (2)

The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ On the uniform computational content of computability theory

This page was built for publication: On the Strength of Weak Compactness