| Publication | Date of Publication | Type |
|---|
| Highlights of the Rice-Shapiro Theorem in Computable Topology | 2021-05-26 | Paper |
| On the computability of ordered fields | 2020-07-29 | Paper |
| On mutual definability of operations on fields | 2020-06-09 | Paper |
| Weak reduction principle and computable metric spaces | 2018-09-06 | Paper |
| The Rice-Shapiro theorem in Computable Topology | 2018-01-12 | Paper |
| Computable elements and functions in effectively enumerable topological spaces | 2017-11-22 | Paper |
| First Order Theories of Some Lattices of Open Sets | 2017-10-12 | Paper |
| On images of partial computable functions over computable Polish spaces | 2017-09-11 | Paper |
| Spectrum of the field of computable real numbers | 2017-09-04 | Paper |
| Outline of partial computability in computable topology | 2017-08-04 | Paper |
| On higher effective descriptive set theory | 2017-08-04 | Paper |
| On the Lattices of Effectively Open Sets | 2016-08-17 | Paper |
| Positive predicate structures for continuous data | 2016-07-27 | Paper |
| Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations | 2016-01-13 | Paper |
| Index Sets as a Measure of Continuous Constraint Complexity | 2015-12-03 | Paper |
| Rice’s Theorem in Effectively Enumerable Topological Spaces | 2015-10-20 | Paper |
| Towards Computability over Effectively Enumerable Topological Spaces | 2013-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2885260 | 2012-05-21 | Paper |
| Definability of closure operations in the \(h\)-quasiorder of labeled forests | 2011-01-24 | Paper |
| Definability in the structure of words with the inclusion relation | 2010-11-15 | Paper |
| Definability in the Subword Order | 2010-07-29 | Paper |
| Undecidability in Weihrauch Degrees | 2010-07-29 | Paper |
| A Gandy Theorem for Abstract Structures and Applications to First-Order Definability | 2010-07-28 | Paper |
| Decidability and computability of certain torsion-free abelian groups | 2010-06-11 | Paper |
| Σ K –constraints for Hybrid Systems | 2010-02-02 | Paper |
| Definability in the Infix Order on Words | 2009-07-07 | Paper |
| Definability in the \(h\)-quasiorder of labeled forests | 2009-06-11 | Paper |
| The Uniformity Principle for -definability | 2009-03-02 | Paper |
| Index sets for classes of high rank structures | 2008-02-25 | Paper |
| Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests | 2008-02-07 | Paper |
| The Uniformity Principle for Σ-Definability with Applications to Computable Analysis | 2007-11-13 | Paper |
| Definability in the Homomorphic Quasiorder of Finite Labeled Forests | 2007-11-13 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| The Computable Dimension of I-Trees of Infinite Height | 2006-07-18 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475110 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783306 | 2002-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531987 | 2002-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2709309 | 2001-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2709313 | 2001-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2709295 | 2001-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511265 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946102 | 2000-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263799 | 2000-04-25 | Paper |
| Compressed systems of finite approximations for sets in the class \(\Sigma_2^0\) | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260448 | 1999-09-09 | Paper |
| A new approach to computability over the reals | 1999-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4349306 | 1999-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3842548 | 1998-11-22 | Paper |
| Algebraic dependences and reducibilities of constructivizations in universal domains | 1996-08-28 | Paper |
| Criteria of autostability for 1-decidable models | 1994-04-12 | Paper |
