scientific article; zbMATH DE number 3110205
In engem Anschluß an \textit{P. S. Novikov} [Tr. Mat. Inst. Steklova 44, 140 S. (1955; Zbl 0068.01301)] wird die Unentscheidbarkeit der folgenden Eigenschaften (Eig.) in der Klasse der endlich erzeugten Gruppen \(F\) (nur solche werden betrachtet) behauptet: 1. ,,Isomorphieproblem: ob \(F\) mit einer beliebig vorgegebenen Gruppe \(F_0\) isomorph ist oder nicht. 2. Ob \(F\) die Eig. \((\alpha\& \beta)\) hat oder nicht, wo \(\alpha\) eine nichttriviale, erbliche, d. h. mit \(F\) auch seinen Untergruppen, aber nicht allen endlich erzeugten freien Gruppen zukommende Eig. sei, \(\beta\) eine (Isomorphismen gegen\alphaber) invariante Eig., und zumindest ein \(F\) mit \((\alpha\& \beta)\) existiere. 3. Ob \(F\) die (wie oben invariante) Eig. \(\alpha\) hat oder nicht, wo \(\alpha\) nicht allen \(F\) mit unlösbarem Wortproblem zukommt, jedoch ein \(F\) mit \(\alpha\) existiere. 4. ,,Metawortproblem: ob für \(F\) das Wortproblem lösbar ist oder nicht. 5. a) Einfachheit; b) Nichttriviales freies Produkt von \(n\) Untergruppen für festes \(n > 1\); c) Existenz einer freien Untergruppe. Alle diese Sätze folgen mit Hilfe des Novikovschen Hauptresultats -- Unentscheidbarkeit des Wortproblems für Gruppen -- aus einem anderen Satz, dessen Formulierung Konstruktionen von Novikov (loc. cit.) benutzt, und dessen Beweis der Verf. als zu lang hier übergeht.
- Model-theoretic and algorithmic questions in group theory
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
- Two decidable Markov properties over a class of solvable groups
- On subsumption and semiunification in feature algebras
- Rich intervals in subgroup lattices
- Ends of Schreier graphs of hyperbolic groups
- On the finiteness problem for classes of modular lattices
- Book review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1
- Computing simplicial representatives of homotopy group elements
- Unrecognizability of manifolds
- On the group property recognition problem
- New estimates of odd exponents of infinite Burnside groups.
- Topology through the centuries: low dimensional manifolds
- On the consistency problem for modular lattices and related structures
- UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS
- scientific article; zbMATH DE number 4097637 (Why is no real title available?)
- Markov-Type Properties
- On a lower bound for the connectivity of the independence complex of a graph
- Thurston's vision and the virtual fibering theorem for 3-manifolds
- scientific article; zbMATH DE number 804141 (Why is no real title available?)
- scientific article; zbMATH DE number 6967854 (Why is no real title available?)
- Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian
- A lower bound of the number of rewrite rules obtained by homological methods
- On some algorithmic problems for groups and monoids
- Researches of semigroups with planar Cayley graphs: results and problems
- On the homeomorphism problem for 4-manifolds
- The B B Newman spelling theorem
- The isomorphism problem for all hyperbolic groups.
- Distinguishability of a Semi-Group by a Machine
- On one-relator groups and units of special one-relation inverse monoids
- Cutting corners
- The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable
- Small sets without unique products in torsion-free groups
- On isomorphisms to a free group and beyond
- A first-order theory of diagram chasing
- Practical software for triangulating and simplifying 4-manifolds
- On a Rice theorem for dynamical properties of SFTs on groups
- Undecidability of automorphism groups
- Two results on complexities of decision problems of groups
- HNN extensions and embedding theorems for groups
- Planarity ranks of semigroup varieties generated by all semigroups of order three
- The Poincaré conjecture: past, present and future
- On rigidity and the isomorphism problem for tree braid groups.
- The triviality problem for profinite completions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5848908)
