论文信息 - Deciding linear-exponential problems

Deciding linear-exponential problems

In our forthcoming article "Weyl closure of a linear differential operator", we give an algorithm to compute 1the Weyl closure when n = 1. This algorithm has been implemented in MAPLE. We also provide some applications, namely the algorithmic computat ion of Jordan-HSlder series for holonomic Dl-modules , a description of the possible initial ideals of left Dlideals with respect to the order filtration, and a description of the isomorphism classes of left Dl-ideals.

Volker Weispfenning

[1] L. Dries. A generalization of the Tarski-Seidenberg theorem, and some nondefinability results , 1986 .

[2] Angus Macintyre,et al. On the decidability of the real exponential field , 1996 .

[3] Volker Weispfenning,et al. Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[4] Daniel Richardson. Local Theories and Cylindrical Decomposition , 1998 .

[5] L. Dries. Remarks on Tarski's problem concerning (R, +, *, exp) , 1984 .

[6] Volker Weispfenning,et al. Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond , 1997, Applicable Algebra in Engineering, Communication and Computing.

[7] Rüdiger Loos,et al. Applying Linear Quantifier Elimination , 1993, Comput. J..

[8] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .