The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$. We give conditions under which the latter set is either a $G_\delta$ set or the countable union of $G_\del...
Main Author: | Vassilios Gregoriades |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2011-11-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/887/pdf |
Similar Items
-
Algorithmic Randomness and Capacity of Closed Sets
by: Douglas Cenzer, et al.
Published: (2011-09-01) -
Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
by: Robert Constable, et al.
Published: (2008-09-01) -
A Normalizing Intuitionistic Set Theory with Inaccessible Sets
by: Wojciech Moczydlowski
Published: (2007-08-01) -
A syntactic approach to continuity of T-definable functionals
by: Chuangjie Xu
Published: (2020-02-01) -
Transforming structures by set interpretations
by: Thomas Colcombet, et al.
Published: (2007-05-01)