Degrees of unsolvability of first order decision problems for finitely presented groups

DOI10.1090/S0002-9939-96-03209-1MaRDI QIDQ4874376zbMATH OpenOpenAlexFDO

Authors Oleg Belegradek

Publication date 19 June 1996

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0002-9939-96-03209-1

zbMATH Keywords

arithmetical \(m\)-degreefirst-order decision problemfree 2-step nilpotent group

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other degrees and reducibilities in computability and recursion theory (03D30) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18)

Recommendations

• Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
• scientific article; zbMATH DE number 67424
• scientific article; zbMATH DE number 3884377
• Turing degrees and the word and conjugacy problems for finitely presented groups.

Cites work

• On a Problem of Boone.
• Some Undecidable Problems in Group Theory

Cited in

(3)

• Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
• Undecidability of first order sentences in the theory of free groupoids
• scientific article; zbMATH DE number 1534488 (Why is no real title available?)

This page was built for publication: Degrees of unsolvability of first order decision problems for finitely presented groups

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