Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.03340OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898818

Guido Gherardi

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

zbMATH Keywords

Urysohn LemmaBorel MeasurabilityComputable AnalysisUrysohn-Tietze Lemma

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Extension of maps (54C20) Theory of numerations, effectively presented structures (03D45)

Related Items

Singular coverings and non‐uniform notions of closed set computability ⋮ Singular Coverings and Non-Uniform Notions of Closed Set Computability ⋮ Simple equations on real intervals