| Publication | Date of Publication | Type |
|---|
Degree spectra of homeomorphism types of compact Polish spaces
(available as arXiv preprint) | N/A | Paper |
Degree spectra of homeomorphism type of compact Polish spaces
The Journal of Symbolic Logic | 2026-06-12 | Paper |
| Ordered fields and Grzegorczyk's hierarchy | 2026-02-27 | Paper |
| Ordinal invariants of the h-preorder on k-labeled forests | 2025-11-19 | Paper |
| \(L_{\omega \omega }, L_{\omega_1\omega }\), and the Wadge hierarchy | 2025-11-19 | Paper |
| Complexity aspects of the extension of Wagner's hierarchy to \(k\)-partitions | 2025-08-19 | Paper |
Ideal presentations and numberings of some classes of effective quasi-Polish spaces
Computability | 2025-03-03 | Paper |
| Universal Boolean algebras with applications to semantic classes of models | 2025-02-07 | Paper |
Marat Mirzaevich Arslanov (on his eightieth birthday)
Russian Mathematical Surveys | 2024-11-15 | Paper |
Logic vs topology on regular -languages
Lecture Notes in Computer Science | 2024-01-12 | Paper |
Extending Wagner's hierarchy to deterministic visibly pushdown automata
Lecture Notes in Computer Science | 2024-01-12 | Paper |
scientific article; zbMATH DE number 7770056 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-23 | Paper |
| scientific article; zbMATH DE number 7770056 (Why is no real title available?) | 2023-11-23 | Paper |
Primitive recursive ordered fields and some applications
Computability | 2023-03-09 | Paper |
Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
Theoretical Computer Science | 2023-02-01 | Paper |
| Ideal presentations and numberings of some classes of effective quasi-Polish spaces | 2023-01-20 | Paper |
Non-collapse of the effective Wadge hierarchy
Computability | 2023-01-12 | Paper |
| Degrees of non-computability of homeomorphism types of Polish spaces | 2022-12-16 | Paper |
| Enumerating classes of effective quasi-Polish spaces | 2022-12-07 | Paper |
| Boole vs Wadge: comparing two basic tools of descriptive set theory | 2022-12-07 | Paper |
| Complexity issues for the iterated \(h\)-preorders | 2022-11-09 | Paper |
Fine hierarchy of regular -languages
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
Wadge-like degrees of Borel bqo-valued functions
Proceedings of the American Mathematical Society | 2022-07-08 | Paper |
Fields of algebraic numbers computable in polynomial time. II
Algebra and Logic | 2022-06-15 | Paper |
A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
Journal of Symbolic Logic | 2022-06-15 | Paper |
Primitive recursive ordered fields and some applications
(available as arXiv preprint) | 2022-03-24 | Paper |
| Searching for applicable versions of computable structures | 2022-03-22 | Paper |
Non-collapse of the effective wadge hierarchy
(available as arXiv preprint) | 2022-03-22 | Paper |
| Input-driven pushdown automata on well-nested infinite strings | 2022-03-21 | Paper |
| Classifying \(\omega\)-regular aperiodic \(k\)-partitions | 2021-07-14 | Paper |
Precomplete numberings
Journal of Mathematical Sciences (New York) | 2021-06-29 | Paper |
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
Computability | 2021-06-25 | Paper |
Non-Collapse of the Effective Wadge Hierarchy
(available as arXiv preprint) | 2021-05-07 | Paper |
Effective wadge hierarchy in computable quasi-Polish spaces
Sibirskie Elektronnye Matematicheskie Izvestiya | 2021-04-15 | Paper |
Q-Wadge degrees as free structures
Computability | 2020-11-09 | Paper |
On degree spectra of topological spaces
Lobachevskii Journal of Mathematics | 2020-10-27 | Paper |
Fields of algebraic numbers computable in polynomial time. I
Algebra and Logic | 2020-08-03 | Paper |
Well-Quasi Orders and Hierarchy Theory
Trends in Logic | 2020-07-08 | Paper |
Turing reducibility in the fine hierarchy
Annals of Pure and Applied Logic | 2020-06-02 | Paper |
Computability on quasi-Polish spaces
(available as arXiv preprint) | 2020-05-12 | Paper |
| On classes of regular languages related to monotone WQOs | 2020-05-12 | Paper |
A Q-Wadge Hierarchy in Quasi-Polish Spaces
(available as arXiv preprint) | 2019-11-07 | Paper |
Turing degrees in refinements of the arithmetical hierarchy
Algebra and Logic | 2019-01-15 | Paper |
Polynomial computability of fields of algebraic numbers
Doklady Mathematics | 2018-11-01 | Paper |
Extending Cooper's theorem to \(\Delta_3^0\) Turing degrees
Computability | 2018-09-20 | Paper |
| Polynomial-time presentations of algebraic number fields | 2018-09-06 | Paper |
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
(available as arXiv preprint) | 2018-09-06 | Paper |
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs with Guaranteed Precision
(available as arXiv preprint) | 2018-07-01 | Paper |
On constructive number fields and computability of solutions of PDEs
Doklady Mathematics | 2018-03-28 | Paper |
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
(available as arXiv preprint) | 2017-12-11 | Paper |
Towards a descriptive theory of cb\(_{0}\)-spaces
Mathematical Structures in Computer Science | 2017-11-22 | Paper |
First order theories of some lattices of open sets
(available as arXiv preprint) | 2017-10-12 | Paper |
| Extending Wadge theory to \(k\)-partitions | 2017-08-04 | Paper |
Efficient algorithms for membership in Boolean hierarchies of regular languages
Theoretical Computer Science | 2016-08-31 | Paper |
The Boolean algebra of piecewise testable languages
Pursuit of the Universal | 2016-08-17 | Paper |
On the lattices of effectively open sets
Pursuit of the Universal | 2016-08-17 | Paper |
Wadge-like reducibilities on arbitrary quasi-Polish spaces
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Some hierarchies of \(\mathsf{QCB}_0\)-spaces
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces
Computability | 2016-04-13 | Paper |
Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces
Evolving Computability | 2015-10-20 | Paper |
Towards the Effective Descriptive Set Theory
Evolving Computability | 2015-10-20 | Paper |
Hyperprojective hierarchy of qcb0-spaces
Computability | 2015-07-01 | Paper |
Boolean algebras of regular languages
Algebra and Logic | 2015-05-08 | Paper |
| Complexity issues for preorders on finite labeled forests | 2015-04-09 | Paper |
Hyperprojective hierarchy of \(\mathrm{qcb}_{0}\)-spaces
Language, Life, Limits | 2015-02-25 | Paper |
Total representations
Logical Methods in Computer Science | 2013-06-20 | Paper |
Computing Solutions of Symmetric Hyperbolic Systems of PDE's
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
On the difference hierarchy in countably based \(T_{0}\)-spaces
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
On the Wadge reducibility of \(k\)-partitions
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
| Efficient algorithms for membership in Boolean hierarchies of regular languages | 2013-03-19 | Paper |
Boolean Algebras of Regular ω-Languages
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Fine hierarchies via Priestley duality
Annals of Pure and Applied Logic | 2012-06-01 | Paper |
Complexity issues for preorders on finite labeled forests
Models of Computation in Context | 2011-09-09 | Paper |
A Fine Hierarchy of ω-Regular k-Partitions
Models of Computation in Context | 2011-09-09 | Paper |
Boolean Algebras of Regular Languages
Developments in Language Theory | 2011-07-29 | Paper |
The shrinking property for NP and coNP
Theoretical Computer Science | 2011-02-21 | Paper |
Definability of closure operations in the \(h\)-quasiorder of labeled forests
Algebra and Logic | 2011-01-24 | Paper |
Definability in the structure of words with the inclusion relation
Siberian Mathematical Journal | 2010-11-15 | Paper |
Definability in the Subword Order
Programs, Proofs, Processes | 2010-07-29 | Paper |
Undecidability in Weihrauch degrees
Programs, Proofs, Processes | 2010-07-29 | Paper |
A Gandy theorem for abstract structures and applications to first-order definability
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
On the Wadge reducibility of \(k\)-partitions
The Journal of Logic and Algebraic Programming | 2009-12-18 | Paper |
| Computing the solution operators of symmetric hyperbolic systems of PDE | 2009-10-28 | Paper |
Definability in the Infix Order on Words
Developments in Language Theory | 2009-07-07 | Paper |
Definability in the \(h\)-quasiorder of labeled forests
Annals of Pure and Applied Logic | 2009-06-11 | Paper |
Undecidability in Some Structures Related to Computation Theory
Journal Of Logic And Computation | 2009-03-02 | Paper |
Wadge reducibility and infinite computations
Mathematics in Computer Science | 2009-02-17 | Paper |
Hierarchies and reducibilities on regular languages related to modulo counting
RAIRO - Theoretical Informatics and Applications | 2008-12-22 | Paper |
Hierarchies and reducibilities on regular languages related to modulo counting
RAIRO - Theoretical Informatics and Applications | 2008-12-22 | Paper |
The quotient algebra of labeled forests modulo h-equivalence
Algebra and Logic | 2008-12-18 | Paper |
FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
International Journal of Foundations of Computer Science | 2008-11-24 | Paper |
Complexity of Topological Properties of Regular ω-Languages
Developments in Language Theory | 2008-10-30 | Paper |
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science | 2008-10-21 | Paper |
The Shrinking Property for NP and coNP
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
Logic and Theory of Algorithms | 2008-06-19 | Paper |
| Complexity of topological properties of regular \(\omega\)-languages | 2008-06-11 | Paper |
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
Journal Of Logic And Computation | 2008-02-07 | Paper |
Fine Hierarchy of Regular Aperiodic ω-Languages
Developments in Language Theory | 2007-11-28 | Paper |
Definability in the Homomorphic Quasiorder of Finite Labeled Forests
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A Useful Undecidable Theory
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Hierarchies of Δ<sup>0</sup><sub>2</sub>‐measurable <i>k</i> ‐partitions
Mathematical Logic Quarterly | 2007-09-17 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
