Decidable Sentences Over Polynomial Rings
From MaRDI portal
Publication:3784041
DOI10.2307/2045893zbMATH Open0643.03007OpenAlexW4232161519MaRDI QIDQ3784041FDOQ3784041
Authors:
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2045893
Recommendations
Cites Work
- Factoring Polynomials over Algebraic Number Fields
- The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
- Title not available (Why is that?)
- Undecidable Rings
- Diophantine Sets Over Algebraic Integer Rings. II
- Hilbert's Tenth Problem for Quadratic Rings
- Diophantine Sets over Some Rings of Algebraic Integers
- Title not available (Why is that?)
- Arithmetical Definitions in the Ring of Integers
- Complexity of Sentences over Number Rings
- Provability and Decidability of Arithmetical Universal-Existential Sentences
Cited In (10)
- Title not available (Why is that?)
- A decision algorithm for linear sentences on a PFM
- Decidability and local-global principles
- Results on undecidability of isomorphism of forms over polynomial rings
- Decidability questions for a ring of Laurent polynomials
- Algorithms for sentences over integral domains
- A universal first-order formula defining the ring of integers in a number field
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
- Decidability of sub-theories of polynomials over a finite field
- Primitive recursive decidability for large rings of algebraic integers
This page was built for publication: Decidable Sentences Over Polynomial Rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784041)
