Computable procedures for fields
From MaRDI portal
Publication:2117796
Cites work
- scientific article; zbMATH DE number 4014840 (Why is no real title available?)
- scientific article; zbMATH DE number 3843854 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1390022 (Why is no real title available?)
- A computable functor from graphs to fields
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable fields and Galois theory
- Computable fields and the bounded Turing reduction
- Computably categorical fields via Fermat's last theorem
- Definability and decision problems in arithmetic
- Defining \(\mathbb Z\) in \(\mathbb Q\)
- Degree spectra and computable dimensions in algebraic structures
- Degree spectra for transcendence in fields
- Degrees coded in jumps of orderings
- Degrees of categoricity of computable structures
- Degrees of categoricity on a cone via \(\eta\)-systems
- Effective content of field theory
- Effective procedures in field theory
- Is it harder to factor a polynomial or to find a root?
- Isomorphism and classification for countable structures
- The decision problem for exponential diophantine equations
- Theorie Der Numerierungen III
- \(d\)-computable categoricity for algebraic 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)