Decidable fragments of universal theories and existentially closed models

DOI10.1007/BF00968481zbMath0498.20024OpenAlexW2050606495MaRDI QIDQ1171136

Oleg V. Belegradek

Publication date: 1980

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00968481

zbMATH Keywords

algebraically closed groupsfinitely generated groups with solvable word problemfinitely presented group with solvable word problemrecursively enumerable classes of finite presentations

Mathematics Subject Classification ID

Applications of logic to group theory (20A15) Model-theoretic algebra (03C60) Generators, relations, and presentations of groups (20F05) Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

Unsolvable algorithmic problems for semigroups, groups and rings

Cites Work

• Recursive unsolvability of group theoretic problems
• On algebraically closed groups
• Subgroups of finitely presented groups
• An algebraic characterization of groups with soluble word problem
• Omitting quantifier-free types in generic structures
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidable fragments of universal theories and existentially closed models