Margarita V. Korovina

发表

Semantic Characterisations of Second-Order Computability over the Real Numbers

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2001, CSL.

Complexity for partial computable functions over computable Polish spaces

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2016, Mathematical Structures in Computer Science.

The Uniformity Principle for Sigma-definability

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2009, J. Log. Comput..

Satisfiability of Viability Constraints for Pfaffian Dynamics

Nicolai Vorobjov, Margarita V. Korovina, 2006, Ershov Memorial Conference.

Towards Computability over Effectively Enumerable Topological Spaces

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2008, CCA.

Using Taylor Models in Exact Real Arithmetic

Norbert Th. Müller, Margarita V. Korovina, Franz Brauße, 2015, MACIS.

Towards Computability of Higher Type Continuous Data

Oleg V. Kudinov, Margarita V. Korovina, 2005, CiE.

Gandy's Theorem for Abstract Structures without the Equality Test

Margarita V. Korovina, M. Korovina, 2003, LPAR.

Fixed points on abstract structures without the equality test

Margarita V. Korovina, M. Korovina, 2002, FICS.

Positive predicate structures for continuous data

Oleg V. Kudinov, Margarita V. Korovina, 2015, Math. Struct. Comput. Sci..

A Logical Approach to Specification of Hybrid Systems

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 1999, Ershov Memorial Conference.

Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems

Nicolai Vorobjov, Margarita V. Korovina, 2007, Theory of Computing Systems.

Generalised Computability and Applications to Hybrid Systems

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2001, Ershov Memorial Conference.

On sigma-definability without equality over the real numbers

Andrei S. Morozov, Margarita V. Korovina, 2008, Math. Log. Q..

Remarks on Sigma-definability without the equality test over the Reals

Andrei S. Morozov, Margarita V. Korovina, A. Morozov, 2008, CCA.

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems

Nicolai Vorobjov, Margarita V. Korovina, Nicolai N. Vorobjov, 2006, CiE.

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013

Arno Pauly, Monika Seisenberger, Hajime Ishihara, 2017, Math. Struct. Comput. Sci..

A CDCL-style calculus for solving non-linear constraints

Konstantin Korovin, Norbert Th. Müller, Margarita V. Korovina, 2019, FroCos.

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

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2007, CiE.

Recent Advances in S-Definability over Continuous Data Types

Margarita V. Korovina, M. Korovina, 2003, Ershov Memorial Conference.

Computing combinatorial types of trajectories in Pfaffian Dynamics

Nicolai Vorobjov, Margarita V. Korovina, 2010, J. Log. Algebraic Methods Program..

The Rice-Shapiro theorem in Computable Topology pdf

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2017, Log. Methods Comput. Sci..

Pfaffian Hybrid Systems

Nicolai Vorobjov, Margarita V. Korovina, Nicolai N. Vorobjov, 2004, CSL.

SigmaK-constraints for Hybrid Systems

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2009, Ershov Memorial Conference.

Characteristic Properties of Majorant-Computability over the Reals

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 1998, CSL.

Fixed Points on the Real Numbers without the Equality Test

Margarita V. Korovina, M. Korovina, 2002, CCA.

Index Sets as a Measure of Continuous Constraint Complexity

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2014, Ershov Memorial Conference.

Weak Reduction Principle and Computable Metric Spaces

Oleg V. Kudinov, Margarita V. Korovina, 2018, CiE.

Towards Using Exact Real Arithmetic for Initial Value Problems

Norbert Th. Müller, Margarita V. Korovina, Franz Brauße, 2015, Ershov Memorial Conference.

Rice's Theorem in Effectively Enumerable Topological Spaces

Oleg V. Kudinov, Margarita V. Korovina, 2015, CiE.

Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test

Margarita V. Korovina, M. Korovina, 2003, CSL.

Computable Topology for Reliable Computations

Oleg V. Kudinov, Margarita V. Korovina, 2019, Ershov Informatics Conference.

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

Oleg V. Kudinov, Margarita V. Korovina, O. Kudinov, 2000, CCA.

Highlights of the Rice-Shapiro Theorem in Computable Topology

Oleg V. Kudinov, Margarita V. Korovina, 2017, Ershov Informatics Conference.

Making big steps in trajectories

Norbert Th. Müller, Margarita V. Korovina, 2010, CCA.

Reachability in One-Dimensional Controlled Polynomial Dynamical Systems

Nicolai Vorobjov, Margarita V. Korovina, 2011, Ershov Memorial Conference.

On Higher Effective Descriptive Set Theory

Oleg V. Kudinov, Margarita V. Korovina, 2017, CiE.

Outline of Partial Computability in Computable Topology

Oleg V. Kudinov, Margarita V. Korovina, 2017, CiE.

The ksmt calculus is a δ-complete decision procedure for non-linear constraints

Konstantin Korovin, Margarita V. Korovina, Franz Brausse, 2021, CADE.

On Σ‐definability without equality over the real numbers

Andrei S. Morozov, Margarita V. Korovina, A. Morozov, 2008, Math. Log. Q..

Recent Advances in Σ-definability over Continuous Data Types

Margarita V. Korovina, 2003 .