A decision method for elementary algebra and geometry
From MaRDI portal
Reprint of: A decision method for elementary algebra and geometry. 2nd ed. (1951; Zbl 0044.25102). For the entire collection see [Zbl 0906.03033].
Cited in
(62)- Homogeneous multivariate polynomials with the half-plane property
- Automated reducible geometric theorem proving and discovery by Gröbner basis method
- A globally asymptotically stable polynomial vector field with rational coefficients and no local polynomial Lyapunov function
- Automatic generation of bounds for polynomial systems with application to the Lorenz system
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- The impact on the properties of the EFGM copulas when extending this family
- Complexity aspects of local minima and related notions
- On representations of intended structures in foundational theories
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- Polynomial bivariate copulas of degree five: characterization and some particular inequalities
- Probabilization of logics: completeness and decidability
- \(\mathsf{dL}_{\iota}\): definite descriptions in differential dynamic logic
- Towards physical hybrid systems
- Editorial: Symbolic computation and satisfiability checking
- Finding proofs in Tarskian geometry
- Subquadratic algorithms for algebraic 3SUM
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- An examination of the geometry theorem machine
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
- Image completion and blind deconvolution: model and algorithm
- On existential definitions of c.e. subsets of rings of functions of characteristic 0
- Towards a hybrid dynamic logic for hybrid dynamic systems
- Can you compute the operator norm?
- Trace-positive complex polynomials in three unitaries
- Recent advances in real geometric reasoning
- On \(\Sigma\)-rigid presentations of the real order
- Faster p-adic feasibility for certain multivariate sparse polynomials
- Undecidable existential theories of polynomial rings and function fields
- Tarski's influence on computer science
- Separable GPL: decidable model checking with more non-determinism
- Effective divergence analysis for linear recurrence sequences
- Decisiveness of stochastic systems and its application to hybrid models
- A probabilistic higher-order fixpoint logic
- Effective aspects of Hausdorff and Fourier dimension
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- Differential game logic
- The challenge of computer mathematics
- Book Review: The birth of model theory: Löwenheim’s theory in the frame of the theory of relatives
- Termination of linear loops under commutative updates
- Recursive solution of initial value problems with temporal discretization
- Spatial and timing properties in highway traffic
- On the decidability of reachability in continuous time linear time-invariant systems
- Specifications for decidable hybrid games
- Realizability modulo theories
- Defining \(\mathbb{Z}\) using unit groups
- Neural network learning and quantum gravity
- Computing the density of the positivity set for linear recurrence sequences
- Decision problems in information theory
- Indistinguishability in localization and control with coarse information
- DNN verification, reachability, and the exponential function problem
- A dynamic temporal logic for quality of service in choreographic models
- A framework for belief-based programs and their verification
- Conditions for eigenvalue configurations of two real symmetric matrices
- A decision method for first-order stream logic
- Some new results on decidability for elementary algebra and geometry
- Sum-of-squares programming for Ma-Trudinger-Wang regularity of optimal transport maps
- Symbolic mathematical computation 1965--1975. The view from a half-century perspective
- Time for timed monitorability
- The tameness of quantum field theory. II: Structures and CFTs
- Breaking the data barrier in learning symbolic computation: a case study on variable ordering suggestion for cylindrical algebraic decomposition
- Definable coordinate geometries over fields
- Complete robust hybrid systems reachability
This page was built for publication: A decision method for elementary algebra and geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4391214)
