Weak presentations of computable fields

DOI10.2307/2275517zbMath0819.03035OpenAlexW2153973451MaRDI QIDQ4836051

Carl G. jun. Jockusch, Alexandra Shlapentokh

Publication date: 8 June 1995

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275517

zbMATH Keywords

recursive functionscomputable fieldr.e. degreer.e. set

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Rational separability of the integral closure ⋮ Rational separability over a global field ⋮ Weak presentations of non-finitely generated fields

This page was built for publication: Weak presentations of computable fields