Similar Items: The Complexity of Infinite Computations In Models of Set Theory
- Infinite and Bi-infinite Words with Decidable Monadic Theories
- Representations of measurable sets in computable measure theory
- Closed Sets and Operators thereon: Representations, Computability and Complexity
- The Theory of Universal Graphs for Infinite Duration Games
- Applicable Mathematics in a Minimal Computational Theory of Sets
- Synthesis of Computable Regular Functions of Infinite Words