Oleg V. Kudinov

Sensors, January, 2024

2020

On the computability of ordered fields.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Computable Topology for Reliable Computations.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 2019

2018

Complexity for partial computable functions over computable Polish spaces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

Weak Reduction Principle and Computable Metric Spaces.

[BibT_eX]

[DOI]

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Computable elements and functions in effectively enumerable topological spaces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

First Order Theories of Some Lattices of Open Sets.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

The Rice-Shapiro theorem in Computable Topology.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

Highlights of the Rice-Shapiro Theorem in Computable Topology.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 2017

On Higher Effective Descriptive Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

Outline of Partial Computability in Computable Topology.

[BibT_eX]

[DOI]

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

On the Lattices of Effectively Open Sets.

[BibT_eX]

[DOI]

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

Positive predicate structures for continuous data.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

Rice's Theorem in Effectively Enumerable Topological Spaces.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Index Sets as a Measure of Continuous Constraint Complexity.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 2014

2012

Spectra of highn and non-lown degrees.

[BibT_eX]

[DOI]

Andrey N. Frolov

Iskander Sh. Kalimullin

Valentina S. Harizanov

Russell G. Miller

J. Log. Comput., 2012

2010

Decidability and Computability of Certain Torsion-Free Abelian Groups.

[BibT_eX]

[DOI]

Alexander G. Melnikov

Daniel Turetsky

Notre Dame J. Formal Log., 2010

Undecidability in Weihrauch Degrees.

[BibT_eX]

[DOI]

Anton V. Zhukov

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Definability in the Subword Order.

[BibT_eX]

[DOI]

Lyudmila V. Yartseva

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

The Uniformity Principle for Sigma-definability.

[BibT_eX]

[DOI]

J. Log. Comput., 2009

Definability in the h-quasiorder of labeled forests.

[BibT_eX]

[DOI]

Anton V. Zhukov

Ann. Pure Appl. Log., 2009

SigmaK-constraints for Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2009

Definability in the Infix Order on Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

A Gandy Theorem for Abstract Structures and Applications to First-Order Definability.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Towards Computability over Effectively Enumerable Topological Spaces.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

Index sets for classes of high rank structures.

[BibT_eX]

[DOI]

J. Symb. Log., 2007

Definability in the Homomorphic Quasiorder of Finite Labeled Forests.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Towards Computability of Higher Type Continuous Data.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2001

Generalised Computability and Applications to Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 2001

Semantic Characterisations of Second-Order Computability over the Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

A Logical Approach to Specification of Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 1999

1998

Characteristic Properties of Majorant-Computability over the Reals.

[BibT_eX]

[DOI]