scientific article; zbMATH DE number 3053259

Cited in

(only showing first 100 items - show all)

Unifying threads in Alfred Tarski's work
Dynamical system where proving chaos is equivalent to proving Fermat's conjecture
Closure and connected component of a planar global semianalytic set defined by analytic functions definable in o-minimal structure
A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces
Note on the computational complexity of $j$-radii of polytopes in $\mathbb R^ n$
On rereading van Heijenoort's selected essays
Superposition as a decision procedure for timed automata
Using machine learning to improve cylindrical algebraic decomposition
Checking existence of solutions of partial differential equations in the fields of Laurent series
Efficiently and effectively recognizing toricity of steady state varieties
A proof of A. Gabrielov's rank theorem
Algorithmic reduction of biological networks with multiple time scales
Weak essentially undecidable theories of concatenation
Complexity of computing interval matrix powers for special classes of matrices.
Links with splitting number one
Quasitoric totally normally split manifolds
Unifying known lower bounds via geometric complexity theory
Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
On the Bennett-Hoeffding inequality
A review and prospect of readable machine proofs for geometry theorems
Reducts of $p$-adically closed fields
Abstractions for hybrid systems
Some formal tools for analyzing quantum automata.
Nonexistence of a continuous right inverse for surjective linear partial differential operators on the Fréchet spaces $\gamma^{(\delta)}(\Omega)$
Problem-solving machines for Euclidean geometry
Cyclotomic torsion points in elliptic schemes
Quantifier elimination theory and maps which preserve semipositivity
A decidable theory involving addition of differentiable real functions
A simple quantifier-free formula of positive semidefinite cyclic ternary quartic forms
Positivstellensatz for semi-algebraic sets in real closed valued fields
Virtual substitution for SMT-solving
Counting special points: logic, Diophantine geometry, and transcendence theory
Model Complete Theories with a Distinguished Substructure
Degrees of Computability
Classes of Predictably Computable Functions
SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY
Definable sets in ordered structures
Probability logic in the twentieth century
Leon Henkin the reviewer
Phenotype space and kinship assignment for the simpson index
Supporting global numerical optimization of rational functions by generic symbolic convexity tests
Combined Decision Techniques for the Existential Theory of the Reals
The Computational Geometry of Comparing Shapes
Description of all functions definable by formulae of the 2nd order intuitionistic propositional calculus on some linear Heyting algebras
Combining equational reasoning
A generalization of the Tarski-Seidenberg theorem, and some nondefinability results
Direct Integral Decompositions and Multiplicities for Induced Representations of Nilpotent Lie Groups
On the decidability of Diophantine problems in combinatorial geometry
Definable Sets in Ordered Structures. II
Models of complete theories
The solubility of certain decision problems in arithmetic and algebra
Tilings with congruent tiles
Algorithmic Procedures
scientific article; zbMATH DE number 3523738 (Why is no real title available?)
Practically solving some problems expressed in the first order theory of real closed field
Fourth- and higher-order interface tracking via mapping and adjusting regular semianalytic sets represented by cubic splines
Size-based termination of higher-order rewriting
Necessary conditions for the generic global rigidity of frameworks on surfaces
Nonpresentability of the semigroup $\omega^\omega$ over $\mathbb H\mathbb F(\mathbb R)$
PLQP \& Company: decidable logics for quantum algorithms
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
Decidable algebraic fields
Independence in computable algebra
Constraint satisfaction problems over numeric domains
On maps which preserve semipositivity and quantifier elimination theory for real numbers
Analyzing restricted fragments of the theory of linear arithmetic
A geometric model of an arbitrary differentially closed field of characteristic zero
A search-based procedure for nonlinear real arithmetic
Globally linked pairs of vertices in rigid frameworks
On the extreme points of moments sets
Undecidability of linear inequalities in graph homomorphism densities
Necessary conditions for the global rigidity of direction-length frameworks
Toward the best constant factor for the Rademacher-Gaussian tail comparison
Transformation of PGO into a calculable expression: problem-solving machines, III
Some Recursively Unsolvable Problems in Analysis
Computable Fields and Arithmetically Definable Ordered Fields
A decision method for $p$-adic integral zeros of diophantine equations
Undecidable Rings
Some notions and problems of game theory
Diversity, dependence and independence
On the zeros of univariate E-polynomials
Faster real root decision algorithm for symmetric polynomials
Levelwise construction of a single cylindrical algebraic cell
Embedding the prime model of real exponentiation into o‐minimal exponential fields
Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom?
An intertwined Cauchy-Schwarz-type inequality based on a Lagrange-type identity
A modal logic framework for reasoning about comparative distances and topology
Examples of stability of tensor products in positive characteristic
Beyond the Existential Theory of the Reals
Geometry machines: from AI to SMC
A survey of local-global methods for Hilbert's tenth problem
Probabilistic verification beyond context-freeness
Recent developments in real quantifier elimination and cylindrical algebraic decomposition (extended abstract of invited talk)
A word reconstruction problem for polynomial regular languages
Orbit-finite linear programming
Axiomatization of compact initial value problems: open properties
Inner and outer approximations of arbitrarily quantified reachability problems
On one-parameter families of hermiticity-preserving superoperators which are not positive
DNN verification, reachability, and the exponential function problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5792485)