Computability and the algebra of fields: Some affine constructions

DOI10.2307/2273358zbMath0481.03020OpenAlexW2025395116MaRDI QIDQ3937376

J. V. Tucker

Publication date: 1980

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

Full work available at URL: http://urn.nb.no/URN:NBN:no-48296

zbMATH Keywords

algebraically closed fieldreal closed fieldcomputable algebratheory of fields with orderings

Mathematics Subject Classification ID

Decidability and field theory (12L05) Constructive and recursive analysis (03F60) Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (2)

Coupled map lattices as computational systems ⋮ Real computational universality: the word problem for a class of groups with infinite presentation

Cites Work

• Unnamed Item
• Proceedings of Liverpool Singularities Symposium. II
• A new decision method for elementary algebra
• Effective procedures in field theory
• Algorithms for Classical Stability Problems

This page was built for publication: Computability and the algebra of fields: Some affine constructions