1. Computability over Topological Structures
2. Fundamentals of Contemporary Set Theory
3. How incomputable is the separable Hahn–Banach theorem?;Gherardi;Notre Dame Journal of Formal Logic,2009
4. Non-Hausdorff Topology and Domain Theory
5. P. Hertling and V. Selivanov, Complexity issues for preorders on finite labeled forests, in: Logic, Computation, Hierarchies, V. Brattka, H. Diener and D. Spreen, eds, Ontos Mathematical Logic, Walter de Gruyter, Boston, 2014, pp. 165–190.