On the public citation graph
The Word Problem in Semi-Groups With Cancellation
0 signed · 77 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01565439openalex-snapshot
General recursive functions of natural numbers
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.2307/2267170openalex-snapshot
Recursive Unsolvability of a problem of Thue
inferredcites →https://doi.org/10.2307/2269031openalex-snapshot
Finite combinatory processes—formulation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11779360_25openalex-snapshot
On the Wagner–Magyarik Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_7openalex-snapshot
Church Without Dogma: Axioms for Computability
inferred← citeshttps://doi.org/10.1007/978-1-4020-6710-5_11openalex-snapshot
Doing Justice to the Imitation Game
inferred← citeshttps://doi.org/10.1007/978-1-4899-6584-4_7openalex-snapshot
The Logic of Biosimulation
inferred← citeshttps://doi.org/10.1007/978-3-0348-9114-1_5openalex-snapshot
La Logique Mathématique en sa jeunesse
inferred← citeshttps://doi.org/10.1007/978-3-319-22156-4_1openalex-snapshot
Conceptual Confluence in 1936: Post and Turing
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_7openalex-snapshot
Why Post Did [Not] Have Turing’s Thesis
inferred← citeshttps://doi.org/10.1007/978-3-319-53280-6_2openalex-snapshot
Turing, the Mathematician
inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_22openalex-snapshot
Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-95327-9_6openalex-snapshot
Unentscheidbare Prädikate
inferred← citeshttps://doi.org/10.1007/978-3-642-96070-3_6openalex-snapshot
Unentscheidbare Prädikate
inferred← citeshttps://doi.org/10.1007/978-3-662-05642-4_3openalex-snapshot
What Would Alan Turing Have Done After 1954?
inferred← citeshttps://doi.org/10.1007/978-3-662-21963-8_7openalex-snapshot
K-graph Machines: generalizing Turing’s machines and arguments
inferred← citeshttps://doi.org/10.1007/978-3-7091-6597-3_1openalex-snapshot
Alan Turing and the Turing Machine
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_12openalex-snapshot
Computability and Enumerability
inferred← citeshttps://doi.org/10.1007/978-94-017-9217-2_2openalex-snapshot
The Developments of the Concept of Machine Computability from 1936 to the 1960s
inferred← citeshttps://doi.org/10.1007/bf01094865openalex-snapshot
Unsolvable algorithmic problems for semigroups, groups, and rings
inferred← citeshttps://doi.org/10.1007/bf02106805openalex-snapshot
Model-theoretic and algorithmic questions in group theory
inferred← citeshttps://doi.org/10.1007/s00029-022-00773-3openalex-snapshot
A Lyndon’s identity theorem for one-relator monoids
inferred← citeshttps://doi.org/10.1007/s00233-021-10216-8openalex-snapshot
The word problem for one-relation monoids: a survey
inferred← citeshttps://doi.org/10.1007/s13373-014-0054-6openalex-snapshot
Gröbner–Shirshov bases and their calculation
inferred← citeshttps://doi.org/10.1007/springerreference_27878openalex-snapshot
universal Turing machine
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50001-0openalex-snapshot
Alan Mathison Turing by Max Newman
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50012-5openalex-snapshot
Solvable and Unsolvable Problems
inferred← citeshttps://doi.org/10.1016/b978-044450423-4/50020-6openalex-snapshot
ALAN MATHISON TURING
inferred← citeshttps://doi.org/10.1016/j.aim.2018.10.036openalex-snapshot
The computability, definability, and proof theory of Artinian rings
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.008openalex-snapshot
Turing oracle machines, online computing, and three displacements in computability theory
inferred← citeshttps://doi.org/10.1016/j.disc.2007.09.011openalex-snapshot
Gröbner–Shirshov basis of the Adyan extension of the Novikov group
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2014.08.007openalex-snapshot
A strong geometric hyperbolicity property for directed graphs and monoids
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2022.10.023openalex-snapshot
Non-finitely generated maximal subgroups of context-free monoids
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90420-xopenalex-snapshot
The inference problem for template dependencies
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71922-0openalex-snapshot
The Associativity Problem for Monoids and the Word Problem for Semigroups and Groups
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80017-2openalex-snapshot
The History and Concept of Computability
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80028-7openalex-snapshot
Computable Rings and Fields
inferred← citeshttps://doi.org/10.1016/s1385-7258(54)50033-8openalex-snapshot
Certain Simple, Unsolvable Problems of Group Theory. I1)1)Unless otherwise indicated, the results and proofs of this and subsequent related papers are as given (in somewhat more detail) in Several simple unsolvable problems of group theory related to the word problem, a doctoral dissertation…
inferred← citeshttps://doi.org/10.1017/9781316716939.008openalex-snapshot
K-graph Machines: generalizing Turing's machines and arguments
inferred← citeshttps://doi.org/10.1017/9781316716939.009openalex-snapshot
Forcing on Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/9781316755983.019openalex-snapshot
Calculations by man and machine: conceptual analysis*
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.010openalex-snapshot
Turing machines to word problems
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.013openalex-snapshot
Step by recursive step: Church's analysis of effective calculability
inferred← citeshttps://doi.org/10.1080/01463379309369870openalex-snapshot
Communication and computability: The case of Alan Mathison Turing
inferred← citeshttps://doi.org/10.1080/26375451.2021.1904735openalex-snapshot
The B B Newman spelling theorem
inferred← citeshttps://doi.org/10.1090/s0273-0979-1982-14963-1openalex-snapshot
The word problem and the isomorphism problem for groups
inferred← citeshttps://doi.org/10.1093/oso/9780198250791.003.0024openalex-snapshot
Solvable and Unsolvable Problems (1954)
inferred← citeshttps://doi.org/10.1093/philmat/nkaf016openalex-snapshot
Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
inferred← citeshttps://doi.org/10.1098/rsbm.1955.0019openalex-snapshot
Alan Mathison Turing, 1912-1954
inferred← citeshttps://doi.org/10.1108/tqm-12-2019-0303openalex-snapshot
Think with me, or think for me? On the future role of artificial intelligence in marketing strategy formulation
inferred← citeshttps://doi.org/10.1109/tit.2023.3247570openalex-snapshot
Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication
inferred← citeshttps://doi.org/10.1134/s0037446617010220openalex-snapshot
Gröbner–Shirshov bases for some Lie algebras
inferred← citeshttps://doi.org/10.1142/s0218196722500618openalex-snapshot
On one-relator groups and units of special one-relation inverse monoids
inferred← citeshttps://doi.org/10.1142/s0218196725500286openalex-snapshot
Undecidability of the stabilizer and zero-in-the-corner problems for matrix groups
inferred← citeshttps://doi.org/10.1145/588111.588148openalex-snapshot
The inference problem for template dependencies
inferred← citeshttps://doi.org/10.1215/ijm/1256044631openalex-snapshot
A simple presentation of a group with unsolvable word problem
inferred← citeshttps://doi.org/10.2307/1970478openalex-snapshot
Word Problems and Recursively Enumerable Degrees of Unsolvability. A First Paper on Thue Systems
inferred← citeshttps://doi.org/10.2307/2004326openalex-snapshot
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
inferred← citeshttps://doi.org/10.2307/2274101openalex-snapshot
The word problem for cancellation semigroups with zero
inferred← citeshttps://doi.org/10.4064/dm871-8-2023openalex-snapshot
Product decompositions of semigroups induced by action pairs
inferred← citeshttps://doi.org/10.4153/s0008414x24000798openalex-snapshot
Membership problems for positive one-relator groups and one-relation monoids
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4546openalex-snapshot
Gröbner-Shirshov bases for some Lie algebras
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.