| Publication | Date of Publication | Type |
|---|
On the computability of ordered fields
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-08-14 | Paper |
Order positive fields. I
Algebra and Logic | 2024-05-15 | Paper |
Highlights of the Rice-Shapiro theorem in computable topology
Lecture Notes in Computer Science | 2021-05-26 | Paper |
On the computability of ordered fields
| 2020-07-29 | Paper |
On mutual definability of operations on fields
Siberian Mathematical Journal | 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
Mathematical Structures in Computer Science | 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
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-11 | Paper |
Spectrum of the field of computable real numbers
Algebra and Logic | 2017-09-04 | Paper |
On higher effective descriptive set theory
| 2017-08-04 | Paper |
Outline of partial computability in computable topology
| 2017-08-04 | Paper |
On the lattices of effectively open sets
Pursuit of the Universal | 2016-08-17 | Paper |
Positive predicate structures for continuous data
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
Algebra and Logic | 2016-01-13 | Paper |
Index sets as a measure of continuous constraint complexity
Lecture Notes in Computer Science | 2015-12-03 | Paper |
Rice's theorem in effectively enumerable topological spaces
Evolving Computability | 2015-10-20 | Paper |
Towards computability over effectively enumerable topological spaces
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Spectra of high\(_n\) and non-low\(_n\) degrees
Journal of Logic and Computation | 2012-09-05 | Paper |
Effectively enumerable topological spaces
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika | 2012-05-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 |
Undecidability in Weihrauch degrees
Programs, Proofs, Processes | 2010-07-29 | Paper |
Definability in the Subword Order
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 |
Decidability and computability of certain torsion-free abelian groups
Notre Dame Journal of Formal Logic | 2010-06-11 | Paper |
\(\Sigma _{K }\)-constraints for hybrid systems
Perspectives of Systems Informatics | 2010-02-02 | 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 |
The Uniformity Principle for -definability
Journal Of Logic And Computation | 2009-03-02 | Paper |
Index sets for classes of high rank structures
Journal of Symbolic Logic | 2008-02-25 | Paper |
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
Journal Of Logic And Computation | 2008-02-07 | Paper |
Definability in the Homomorphic Quasiorder of Finite Labeled Forests
Lecture Notes in Computer Science | 2007-11-13 | Paper |
The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
The Computable Dimension of I-Trees of Infinite Height
Algebra and Logic | 2006-07-18 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
scientific article; zbMATH DE number 2084368 (Why is no real title available?)
| 2004-08-06 | Paper |
scientific article; zbMATH DE number 1841818 (Why is no real title available?)
| 2002-12-04 | Paper |
scientific article; zbMATH DE number 1746039 (Why is no real title available?)
| 2002-05-27 | Paper |
An autostable 1-decidable model without a computable Scott family of \(\exists\)-formulas
Algebra i Logika | 2001-07-24 | Paper |
Some properties of autostable models
Algebra i Logika | 2001-07-24 | Paper |
A description of autostable models
Algebra i Logika | 2001-04-09 | Paper |
scientific article; zbMATH DE number 1522990 (Why is no real title available?)
| 2000-10-30 | Paper |
scientific article; zbMATH DE number 1421076 (Why is no real title available?)
| 2000-09-20 | Paper |
scientific article; zbMATH DE number 1342214 (Why is no real title available?)
| 2000-04-25 | Paper |
Compressed systems of finite approximations for sets in the class \(\Sigma_2^0\)
Siberian Advances in Mathematics | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1333823 (Why is no real title available?)
| 1999-09-09 | Paper |
A new approach to computability over the reals
Siberian Advances in Mathematics | 1999-04-27 | Paper |
scientific article; zbMATH DE number 1047533 (Why is no real title available?)
| 1999-02-24 | Paper |
scientific article; zbMATH DE number 1191234 (Why is no real title available?)
| 1998-11-22 | Paper |
Algebraic dependences and reducibilities of constructivizations in universal domains
Siberian Advances in Mathematics | 1996-08-28 | Paper |
Criteria of autostability for 1-decidable models
Algebra and Logic | 1994-04-12 | Paper |
