An introduction to computable model theory on groups and fields

DOI10.1515/GCC.2011.002zbMath1258.03040OpenAlexW2103671020MaRDI QIDQ2882823

Russell G. Miller

Publication date: 7 May 2012

Published in: Groups – Complexity – Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc.2011.002

zbMATH Keywords

word problemdecidabilitycomputabilitycomputable fieldcomputable model theorycomputable group

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computable structure theory, computable model theory (03C57) Model theory of fields (12L12)

Related Items (5)

A structure of punctual dimension two ⋮ Algebraic structures computable without delay ⋮ Adapting Rabin’s Theorem for Differential Fields ⋮ Categorical linearly ordered structures ⋮ Non-coding enumeration operators

Cites Work

• d-computable categoricity for algebraic fields
• Effective content of field theory
• Theorie Der Numerierungen III
• The word problem

This page was built for publication: An introduction to computable model theory on groups and fields