Skip to main content
Conference Proceedings

K-trivial closed sets and continuous functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4497 LNCS 135-145
DOI: 10.1007/978-3-540-73001-9_14
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate the notion of if-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial ∏10 class with no computable elements. For any K-trivial degree d, there is a K-trivial continuous function of degree d.1 © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Barmaids, G., Cenzer, D., Remmel, J. B., & Weber, R. (2007). K-trivial closed sets and continuous functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4497 LNCS, pp. 135–145). https://doi.org/10.1007/978-3-540-73001-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free