Similar Items: Closed Sets and Operators thereon: Representations, Computability and Complexity
- Representations of measurable sets in computable measure theory
- The Complexity of Infinite Computations In Models of Set Theory
- Algorithmic Randomness and Capacity of Closed Sets
- The Data Complexity of Ontology-Mediated Queries with Closed Predicates
- Uniqueness of directed complete posets based on Scott closed set lattices
- A new operational representation of dependencies in Event Structures