The following pages link to Margarita Korovina (Q1015373):
Displaying 50 items.
- (Q957778) (redirect page) (← links)
- Countable structures \(\Sigma \)-definable over classical continuous number systems (Q957779) (← links)
- Bounds on sizes of finite bisimulations of Pfaffian dynamical systems (Q1015374) (← links)
- Computing combinatorial types of trajectories in Pfaffian dynamics (Q1044670) (← links)
- Generalized computability on real functions (Q1189795) (← links)
- A new approach to computability over the reals (Q1284389) (← links)
- Weak reduction principle and computable metric spaces (Q1670746) (← links)
- Outline of partial computability in computable topology (Q2011636) (← links)
- On higher effective descriptive set theory (Q2011663) (← links)
- The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q2055849) (← links)
- A CDCL-style calculus for solving non-linear constraints (Q2180222) (← links)
- Spectrum of the field of computable real numbers (Q2401539) (← links)
- On images of partial computable functions over computable Polish spaces (Q2403641) (← links)
- Using Taylor Models in Exact Real Arithmetic (Q2807869) (← links)
- (Q2885260) (← links)
- Towards Using Exact Real Arithmetic for Initial Value Problems (Q3179168) (← links)
- Rice’s Theorem in Effectively Enumerable Topological Spaces (Q3195700) (← links)
- Satisfiability of Viability Constraints for Pfaffian Dynamics (Q3401952) (← links)
- Σ K –constraints for Hybrid Systems (Q3402282) (← links)
- (Q3408145) (← links)
- Index Sets as a Measure of Continuous Constraint Complexity (Q3455071) (← links)
- Reachability in One-Dimensional Controlled Polynomial Dynamical Systems (Q3457983) (← links)
- On Σ‐definability without equality over the real numbers (Q3528148) (← links)
- Σ-Definability of countable structures over real numbers, complex numbers, and quaternions (Q3546124) (← links)
- The Uniformity Principle for -definability (Q3611727) (← links)
- (Q3842548) (← links)
- (Q3842549) (← links)
- (Q4263799) (← links)
- (Q4475110) (← links)
- (Q4511265) (← links)
- (Q4531987) (← links)
- Computable elements and functions in effectively enumerable topological spaces (Q4593240) (← links)
- The Rice-Shapiro theorem in Computable Topology (Q4600772) (← links)
- (Q4783306) (← links)
- Fixed Points on the Real Numbers without the Equality Test (Q4916187) (← links)
- Towards Computability over Effectively Enumerable Topological Spaces (Q4918009) (← links)
- Remarks on Σ–definability without the equality test over the Reals (Q4918045) (← links)
- (Q4946102) (← links)
- Highlights of the Rice-Shapiro Theorem in Computable Topology (Q4989674) (← links)
- (Q5150980) (← links)
- Computer Science Logic (Q5292647) (← links)
- Computer Science Logic (Q5311274) (← links)
- The Uniformity Principle for Σ-Definability with Applications to Computable Analysis (Q5425343) (← links)
- New Computational Paradigms (Q5717046) (← links)
- Positive predicate structures for continuous data (Q5740676) (← links)
- Logical Approaches to Computational Barriers (Q5898824) (← links)
- Perspectives of System Informatics (Q5902413) (← links)
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q6076350) (← links)
- Order positive fields. I (Q6539751) (← links)
- On the computability of ordered fields (Q6587462) (← links)
