On the public citation graph

Unsolvability of the universal theory of finite groups

https://doi.org/10.1007/bf01735740
0 signed · 44 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-017-3477-6openalex-snapshot
The Theory of Algorithms
inferredcites →https://doi.org/10.2307/2267170openalex-snapshot
Recursive Unsolvability of a problem of Thue

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jabr.1999.8138openalex-snapshot
Algorithmic Problems for Amalgams of Finite Semigroups
inferred← citeshttps://doi.org/10.1007/11965893_21openalex-snapshot
Constant-Memory Validation of Streaming XML Documents Against DTDs
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_17openalex-snapshot
Minsky Machines and Algorithmic Problems
inferred← citeshttps://doi.org/10.1007/bf01069167openalex-snapshot
Use of computers in solving well-known algebra problems
inferred← citeshttps://doi.org/10.1007/bf01094865openalex-snapshot
Unsolvable algorithmic problems for semigroups, groups, and rings
inferred← citeshttps://doi.org/10.1007/bf01157056openalex-snapshot
Universal theory of the class of finite nilpotent groups is unsolvable
inferred← citeshttps://doi.org/10.1007/bf01978400openalex-snapshot
Algorithmic problems in varieties of semigroups
inferred← citeshttps://doi.org/10.1007/bf02106805openalex-snapshot
Model-theoretic and algorithmic questions in group theory
inferred← citeshttps://doi.org/10.1007/bfb0099387openalex-snapshot
Finite extensions of finite groups
inferred← citeshttps://doi.org/10.1007/bfb0099661openalex-snapshot
HNN-constructing finite groups
inferred← citeshttps://doi.org/10.1007/s00222-015-0578-8openalex-snapshot
The triviality problem for profinite completions
inferred← citeshttps://doi.org/10.1007/s11083-025-09707-yopenalex-snapshot
On the Equational Theory of Finite Modular Lattices
inferred← citeshttps://doi.org/10.1007/s11856-022-2345-zopenalex-snapshot
Representability of matroids by c-arrangements is undecidable
inferred← citeshttps://doi.org/10.1007/s13373-017-0103-zopenalex-snapshot
Algorithmically complex residually finite groups
inferred← citeshttps://doi.org/10.1016/0022-4049(90)90048-mopenalex-snapshot
Reduction theorem for the Type-II conjecture for finite monoids
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00097-gopenalex-snapshot
Decidable representations
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2014.10.017openalex-snapshot
On the outer automorphism groups of finitely generated, residually finite groups
inferred← citeshttps://doi.org/10.1016/j.jpaa.2009.02.011openalex-snapshot
Undecidable problems for completely 0-simple semigroups
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90420-xopenalex-snapshot
The inference problem for template dependencies
inferred← citeshttps://doi.org/10.1016/s0021-8693(03)00312-0openalex-snapshot
The uniform word problem for groups and finite Rees quotients of E-unitary inverse semigroups
inferred← citeshttps://doi.org/10.1016/s0022-4049(96)00050-3openalex-snapshot
Algorithmic problems for finite groups and finite 0-simple semigroups
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70258-1openalex-snapshot
On the model theory of free metabelian groups of bounded exponent
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00025-0openalex-snapshot
An undecidability theorem for lattices over group rings
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80107-1openalex-snapshot
On subsumption and semiunification in feature algebras
inferred← citeshttps://doi.org/10.1017/9781316718254.018openalex-snapshot
Decidability questions for theories of modules
inferred← citeshttps://doi.org/10.1017/fms.2017.6openalex-snapshot
UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS
inferred← citeshttps://doi.org/10.1070/im1995v059n05abeh000040openalex-snapshot
On elementary theories of integer linear groups
inferred← citeshttps://doi.org/10.1070/rm1982v037n02abeh003922openalex-snapshot
The group theory problems of the Kourovka Notebook - progress from the sixth to the seventh symposium
inferred← citeshttps://doi.org/10.1070/rm1991v046n05abeh002854openalex-snapshot
Solved problems in the Kourovka Notebook
inferred← citeshttps://doi.org/10.1070/sm2014v205n06abeh004400openalex-snapshot
On algebraic properties of topological full groups
inferred← citeshttps://doi.org/10.1145/588111.588148openalex-snapshot
The inference problem for template dependencies
inferred← citeshttps://doi.org/10.1515/advgeom-2022-0021openalex-snapshot
On projections of free semialgebraic sets
inferred← citeshttps://doi.org/10.1515/gcc.2009.311openalex-snapshot
On the Universal Theory of Torsion and Lacunary Hyperbolic Groups
inferred← citeshttps://doi.org/10.1515/jgth-2020-0029openalex-snapshot
Computability of finite quotients of finitely generated groups
inferred← citeshttps://doi.org/10.17863/cam.8555openalex-snapshot
Undecidability and the developability of permutoids and rigid pseudogroups
inferred← citeshttps://doi.org/10.2178/jsl.7704090openalex-snapshot
Undecidability of representability as binary relations
inferred← citeshttps://doi.org/10.2307/2274101openalex-snapshot
The word problem for cancellation semigroups with zero
inferred← citeshttps://doi.org/10.2307/2275184openalex-snapshot
Undecidability of the identity problem for finite semigroups
inferred← citeshttps://doi.org/10.2307/2275703openalex-snapshot
Hereditary undecidability of some theories of finite structures
inferred← citeshttps://doi.org/10.4213/sm8257openalex-snapshot
Об алгебраических свойствах топологических полных групп
inferred← citeshttps://doi.org/10.48550/arxiv.2503.12673openalex-snapshot
Logic Blog 2023-2024
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.