Computing constraint sets for differential fields
From MaRDI portal
Commutative rings of differential operators and their modules (13N10) Recursively (computably) enumerable sets and degrees (03D25) Differential algebra (12H05) Algebraic aspects (differential-algebraic, hypertranscendence, group-theoretical) of ordinary differential equations in the complex domain (34M15)
Abstract: Kronecker's Theorem and Rabin's Theorem are fundamental results about computable fields F and the decidability of the set of irreducible polynomials over F. We adapt these theorems to the setting of differential fields K, with constrained pairs of differential polynomials over K assuming the role of the irreducible polynomials. We prove that two of the three basic aspects of Kronecker's Theorem remain true here, and that the reducibility in one direction (but not the other) from Rabin's Theorem also continues to hold.
Recommendations
Cites work
- scientific article; zbMATH DE number 3843854 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3573995 (Why is no real title available?)
- scientific article; zbMATH DE number 1979252 (Why is no real title available?)
- scientific article; zbMATH DE number 1860838 (Why is no real title available?)
- scientific article; zbMATH DE number 858680 (Why is no real title available?)
- scientific article; zbMATH DE number 3349995 (Why is no real title available?)
- scientific article; zbMATH DE number 3415973 (Why is no real title available?)
- A bound for the Rosenfeld-Gröbner algorithm
- A course in model theory. An introduction to contemporary mathematical logic. Transl. from the French by Moses Klein
- Adapting Rabin's theorem for differential fields
- Associative differential operations
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable fields and Galois theory
- Computable fields and weak truth-table reducibility
- Constrained extensions of differential fields
- Effective procedures in field theory
- Extensions of differential fields. I, II
- Field Arithmetic
- Is it harder to factor a polynomial or to find a root?
- On Liouville's theory of elementary functions
- Recursively presentable prime models
- The Problem of Integration in Finite Terms
- Uniqueness and characterization of prime models over sets for totally transcendental first-order theories
Cited in
(5)- A primitive element theorem for fields with commuting derivations and automorphisms
- Adapting Rabin's theorem for differential fields
- The primitive element theorem for differential fields with zero derivation on the ground field
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Computable valued fields
This page was built for publication: Computing constraint sets for differential fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402682)