The quantifier elimination problem for rings without nilpotent elements and for semi-simple rings

1980 ◽  
pp. 20-30 ◽  
Author(s):  
M. Boffa ◽  
A. Macintyre ◽  
F. Point
Keyword(s):  
Quantifier Elimination ◽  
Nilpotent Elements ◽  
Elimination Problem

Angus Macintyre, Kenneth McKenna, and Lou van den Dries. Elimination of quantifiers in algebraic structures. Advances in mathematics, vol. 47 (1983), pp. 74–87. - L. P. D. van den Dries. A linearly ordered ring whose theory admits elimination of quantifiers is a real closed field. Proceedings of the American Mathematical Society, vol. 79 (1980), pp. 97–100. - Bruce I. Rose. Rings which admit elimination of quantifiers. The journal of symbolic logic, vol. 43 (1978), pp. 92–112; Corrigendum, vol. 44 (1979), pp. 109–110. - Chantal Berline. Rings which admit elimination of quantifiers. The journal of symbolic logic, vol. 43 (1978), vol. 46 (1981), pp. 56–58. - M. Boffa, A. Macintyre, and F. Point. The quantifier elimination problem for rings without nilpotent elements and for semi-simple rings. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7, 1979, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture notes in mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, pp. 20–30. - Chantal Berline. Elimination of quantifiers for non semi-simple rings of characteristic p. Model theory of algebra and arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1–7, 1979, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture notes in mathematics, vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, pp. 10–19.

1985 ◽  
Vol 50 (4) ◽  
pp. 1079-1080
Author(s):  
Gregory L. Cherlin
Keyword(s):  
New York ◽  
Model Theory ◽  
American Mathematical Society ◽  
Quantifier Elimination ◽  
Symbolic Logic ◽  
Closed Field ◽  
Characteristic P ◽  
Lecture Notes ◽  
Ordered Ring ◽  
Elimination Problem

Divisible rigid groups. III. Homogeneity and quantifier elimination

2017 ◽  
Vol 57 (6) ◽  
pp. 733-748
Author(s):  
N. S. Romanovskii
Keyword(s):  
Quantifier Elimination

On quasi-radical of near-ring of polynomials

2019 ◽  
Vol 56 (2) ◽  
pp. 252-259
Author(s):  
Ebrahim Hashemi ◽  
Fatemeh Shokuhifar ◽  
Abdollah Alhevaz
Keyword(s):  
Commutative Ring ◽  
Nilpotent Elements ◽  
Ring Of Polynomials

Abstract The intersection of all maximal right ideals of a near-ring N is called the quasi-radical of N. In this paper, first we show that the quasi-radical of the zero-symmetric near-ring of polynomials R0[x] equals to the set of all nilpotent elements of R0[x], when R is a commutative ring with Nil (R)2 = 0. Then we show that the quasi-radical of R0[x] is a subset of the intersection of all maximal left ideals of R0[x]. Also, we give an example to show that for some commutative ring R the quasi-radical of R0[x] coincides with the intersection of all maximal left ideals of R0[x]. Moreover, we prove that the quasi-radical of R0[x] is the greatest quasi-regular (right) ideal of it.

scholarly journals Quantifier elimination theory and maps which preserve semipositivity

2021 ◽  
Vol 20 (3) ◽  
Author(s):  
Grzegorz Pastuszak ◽  
Adam Skowyrski ◽  
Andrzej Jamiołkowski
Keyword(s):  
Quantifier Elimination ◽  
Elimination Theory

Practical Tools for Reasoning About Linear Constraints

1991 ◽  
Vol 15 (3-4) ◽  
pp. 357-379
Author(s):  
Tien Huynh ◽  
Leo Joskowicz ◽  
Catherine Lassez ◽  
Jean-Louis Lassez
Keyword(s):  
Logic Programming ◽  
Intelligent Systems ◽  
Optimization Problem ◽  
Spatial Reasoning ◽  
Quantifier Elimination ◽  
Canonical Representation ◽  
Linear Constraints ◽  
Practical Applications ◽  
Variable Elimination ◽  
Fourier Algorithm

We address the problem of building intelligent systems to reason about linear arithmetic constraints. We develop, along the lines of Logic Programming, a unifying framework based on the concept of Parametric Queries and a quasi-dual generalization of the classical Linear Programming optimization problem. Variable (quantifier) elimination is the key underlying operation which provides an oracle to answer all queries and plays a role similar to Resolution in Logic Programming. We discuss three methods for variable elimination, compare their feasibility, and establish their applicability. We then address practical issues of solvability and canonical representation, as well as dynamical updates and feedback. In particular, we show how the quasi-dual formulation can be used to achieve the discriminating characteristics of the classical Fourier algorithm regarding solvability, detection of implicit equalities and, in case of unsolvability, the detection of minimal unsolvable subsets. We illustrate the relevance of our approach with examples from the domain of spatial reasoning and demonstrate its viability with empirical results from two practical applications: computation of canonical forms and convex hull construction.

Sign in / Sign up

Export Citation Format

Share Document