| 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 |
The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints
Theoretical Computer Science | 2023-09-21 | Paper |
The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints
(available as arXiv preprint) | 2021-12-01 | Paper |
Highlights of the Rice-Shapiro theorem in computable topology
Lecture Notes in Computer Science | 2021-05-26 | Paper |
| Making big steps in trajectories | 2021-02-16 | Paper |
| On the computability of ordered fields | 2020-07-29 | Paper |
A CDCL-style calculus for solving non-linear constraints
(available as arXiv preprint) | 2020-05-13 | Paper |
| Weak reduction principle and computable metric spaces | 2018-09-06 | Paper |
The Rice-Shapiro theorem in computable topology
(available as arXiv preprint) | 2018-01-12 | Paper |
Computable elements and functions in effectively enumerable topological spaces
Mathematical Structures in Computer Science | 2017-11-22 | 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 |
Towards using exact real arithmetic for initial value problems
Lecture Notes in Computer Science | 2016-12-21 | Paper |
Positive predicate structures for continuous data
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Using Taylor models in exact real arithmetic
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
Reachability in one-dimensional controlled polynomial dynamical systems
Perspectives of Systems Informatics | 2015-12-07 | 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 |
Remarks on \(\Sigma\)-definability without the equality test over the reals
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
Fixed points on the real numbers without the equality test
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Effectively enumerable topological spaces
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika | 2012-05-21 | Paper |
| Gandy's theorem for abstract structures without the equality test | 2010-02-24 | Paper |
Satisfiability of Viability Constraints for Pfaffian Dynamics
Perspectives of Systems Informatics | 2010-02-02 | Paper |
\(\Sigma _{K }\)-constraints for hybrid systems
Perspectives of Systems Informatics | 2010-02-02 | Paper |
Recent advances in \(\Sigma \)-definability over continuous data types
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Computing combinatorial types of trajectories in Pfaffian dynamics
The Journal of Logic and Algebraic Programming | 2009-12-18 | Paper |
Bounds on sizes of finite bisimulations of Pfaffian dynamical systems
Theory of Computing Systems | 2009-05-08 | Paper |
The Uniformity Principle for -definability
Journal Of Logic And Computation | 2009-03-02 | Paper |
Σ-Definability of countable structures over real numbers, complex numbers, and quaternions
Algebra and Logic | 2008-12-18 | Paper |
Countable structures \(\Sigma \)-definable over classical continuous number systems
Doklady Mathematics | 2008-12-01 | Paper |
On Σ‐definability without equality over the real numbers
Mathematical Logic Quarterly | 2008-10-08 | Paper |
The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | 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 |
| 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 |
A new approach to computability over the reals
Siberian Advances in Mathematics | 1999-04-27 | Paper |
| scientific article; zbMATH DE number 1191234 (Why is no real title available?) | 1998-11-22 | Paper |
| scientific article; zbMATH DE number 1191235 (Why is no real title available?) | 1998-11-05 | Paper |
Generalized computability on real functions
Siberian Advances in Mathematics | 1992-09-27 | Paper |
