Computable procedures for fields
From MaRDI portal
Publication:2117796
DOI10.1007/978-3-030-80049-9_31OpenAlexW3184339260MaRDI QIDQ2117796FDOQ2117796
Authors: Russell Miller
Publication date: 22 March 2022
Full work available at URL: https://academicworks.cuny.edu/qc_pubs/483
factorizationirreducibilitypolynomialsfieldcomputabilitysplitting setHilbert's tenth problemcomputable structure theoryroot setRabin's theorem
Cites Work
- Title not available (Why is that?)
- The decision problem for exponential diophantine equations
- Computably categorical fields via Fermat's last theorem
- \(d\)-computable categoricity for algebraic fields
- Effective content of field theory
- Title not available (Why is that?)
- Degrees of categoricity of computable structures
- Effective procedures in field theory
- Computable Algebra, General Theory and Theory of Computable Fields
- Definability and decision problems in arithmetic
- Title not available (Why is that?)
- Is it harder to factor a polynomial or to find a root?
- Computable fields and Galois theory
- Computable fields and the bounded Turing reduction
- Title not available (Why is that?)
- Degree spectra and computable dimensions in algebraic structures
- Degrees coded in jumps of orderings
- A computable functor from graphs to fields
- Theorie Der Numerierungen III
- Defining \(\mathbb Z\) in \(\mathbb Q\)
- Degrees of categoricity on a cone via \(\eta\)-systems
- Isomorphism and classification for countable structures
- Degree spectra for transcendence in fields
Cited In (4)
This page was built for publication: Computable procedures for fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117796)