Higman's embedding theorem in a general setting and its application to existentially closed algebras

DOI10.1305/ndjfl/1040046145zbMath0882.03036OpenAlexW2057018055MaRDI QIDQ1374213

Oleg V. Belegradek

Publication date: 12 March 1998

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040046145

zbMATH Keywords

groupssemigroupsword problemtorsion-free groupsfinitely presented algebraexistentially closed algebraGeneralized Higman Theoremrecursively presented algebra

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Quasivarieties (08C15) Computable structure theory, computable model theory (03C57) Word problems (aspects of algebraic structures) (08A50)

Related Items

\(sQ_1\)-degrees of computably enumerable sets, Irreducible, singular, and contiguous degrees, The loop problem for Rees matrix semigroups.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Imbeddability of recursively presented inverse semigroups into finitely presented ones
• Algebraically closed groups
• Definability in algebraically closed systems
• Algebraically closed semigroups
• The model theory of unitriangular groups
• Subgroups of finitely presented groups
• Элементарные свойства алгебраически замкнутых групп
• Omitting quantifier-free types in generic structures