On the public citation graph

Undecidable properties of finite sets of equations

https://doi.org/10.2307/2272037
0 signed · 25 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.1016/s0049-237x(08)x7028-4openalex-snapshot
The Metamathematics of Algebraic Systems - Collected Papers: 1936–1967
inferredcites →https://doi.org/10.1017/s0022481200051161openalex-snapshot
Undecidable properties of finite sets of equations
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1305/ndjfl/1093894637openalex-snapshot
Non-recursiveness of the set of finite sets of equations whose theories are one-based.
inferredcites →https://doi.org/10.1305/ndjfl/1093956081openalex-snapshot
Unsolvable problems for equational theories.
inferredcites →https://doi.org/10.2307/2267170openalex-snapshot
Recursive Unsolvability of a problem of Thue
inferredcites →https://doi.org/10.2307/2271899openalex-snapshot
On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01182063openalex-snapshot
Das Entscheidungsproblem der Klasse von Formeln, die h�chstens zwei Primformeln enthalten
inferred← citeshttps://doi.org/10.1007/bf02011871openalex-snapshot
Kleine unentscheidbare Klassen der Prädikatenlogik mit Identität und Funktionszeichen
inferred← citeshttps://doi.org/10.1007/bf02483841openalex-snapshot
Structural diversity in the lattice of equational theories
inferred← citeshttps://doi.org/10.1007/bfb0098451openalex-snapshot
Universal terms for pseudo-complemented distributive lattices and Heyting algebras
inferred← citeshttps://doi.org/10.1007/s00012-012-0186-zopenalex-snapshot
An easy test for congruence modularity
inferred← citeshttps://doi.org/10.1007/s00012-013-0256-xopenalex-snapshot
Equations implying congruence n-permutability and semidistributivity
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90009-7openalex-snapshot
The decision problem for equational bases of algebras
inferred← citeshttps://doi.org/10.1016/0003-4843(79)90023-8openalex-snapshot
Universal equational theories and varieties of algebras
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90013-topenalex-snapshot
A field guide to equational logic
inferred← citeshttps://doi.org/10.1016/b978-0-444-87759-8.50025-0openalex-snapshot
FIFTEEN POSSIBLE PREVIEWS IN EQUATIONAL LOGIC
inferred← citeshttps://doi.org/10.1016/b978-0-7204-0725-9.50040-xopenalex-snapshot
EQUATIONAL LOGIC
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00032-5openalex-snapshot
Thue trees
inferred← citeshttps://doi.org/10.1017/s0022481200051161openalex-snapshot
Undecidable properties of finite sets of equations
inferred← citeshttps://doi.org/10.1023/a:1005843212881openalex-snapshot
Solution of the Robbins Problem
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267755openalex-snapshot
Undecidability of the Horn-clause implication problem
inferred← citeshttps://doi.org/10.21136/cmj.1981.101731openalex-snapshot
The lattice of equational theories. Part I: Modular elements
inferred← citeshttps://doi.org/10.2307/2273945openalex-snapshot
Decision problems concerning properties of finite sets of equations
inferred← citeshttps://doi.org/10.2307/2274149openalex-snapshot
Some undecidability results in strong algebraic languages
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.