Undecidability of regularly closed fields

DOI10.1007/BF01669109MaRDI QIDQ1171566zbMATH OpenOpenAlexFDO

Authors Yuri L. Ershov

Publication date 1982

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/187142

zbMATH Keywords

elementary theory of the class of all regularly closed fields

Mathematics Subject Classification ID

Models of other mathematical theories (03C65) Undecidability and degrees of sets of sentences (03D35)

Cites work

• scientific article; zbMATH DE number 3732018 (Why is no real title available?)
• scientific article; zbMATH DE number 3787040 (Why is no real title available?)
• Shorter Notes: Profinite Groups are Galois Groups
• The elementary theory of finite fields

Cited in

(5)

• Finite undecidability in PAC and PRC fields
• Amalgamation of types in pseudo-algebraically closed fields and applications
• Properties of forking in ω-free pseudo-algebraically closed fields
• Model theory of finite fields and pseudo-finite fields
• Undecidability of pseudo \(p\)-adically closed fields

This page was built for publication: Undecidability of regularly closed fields

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