Computability and the algebra of fields: Some affine constructions

DOI10.2307/2273358MaRDI QIDQ3937376zbMATH OpenOpenAlexFDO

Authors John 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 fieldcomputable algebrareal closed fieldtheory of fields with orderings

Mathematics Subject Classification ID

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

Cites work

• A new decision method for elementary algebra
• Algorithms for Classical Stability Problems
• Effective procedures in field theory
• scientific article; zbMATH DE number 3225499 (Why is no real title available?)
• Proceedings of Liverpool Singularities Symposium. II

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3937376)