On the public citation graph
Lattice-theoretic decision problems in universal algebra
0 signed · 39 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/bf02218635openalex-snapshot
Elementary lattice theories for ideals in polynomial rings
inferredcites →https://doi.org/10.1007/bf02218979openalex-snapshot
The undecidability of the elementary theory of lattices of subgroups of finite Abelianp -groups
inferredcites →https://doi.org/10.1007/bf02219448openalex-snapshot
On elementary theories of lattices of subgroups
inferredcites →https://doi.org/10.1007/bf02220030openalex-snapshot
On simple ideals in polynomial rings
inferredcites →https://doi.org/10.1007/bf02572269openalex-snapshot
The lattice of semigroup varieties
inferredcites →https://doi.org/10.1007/bf02944953openalex-snapshot
On the structure of the lattice of equational classes ℒ (τ)
inferredcites →https://doi.org/10.1007/bf02944986openalex-snapshot
Embedding the dual ofΠ ∞ in the lattice of equational classes of semigroups
inferredcites →https://doi.org/10.1016/s0049-237x(09)70257-5openalex-snapshot
On Direct Products of Theories
inferredcites →https://doi.org/10.1016/s1385-7258(55)50089-8openalex-snapshot
Equational completeness of abstract algebras
inferredcites →https://doi.org/10.1080/00029890.1964.11992212openalex-snapshot
The Lattice of Equational Classes of Algebras with One Unary Operation
inferredcites →https://doi.org/10.1090/s0002-9939-1971-0285639-0openalex-snapshot
Embedding the dual of 𝜋ₘ in the lattice of equational classes of commutative semigroups
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.723openalex-snapshot
Congruence Relations in Semi-Lattices
inferredcites →https://doi.org/10.2307/2272464openalex-snapshot
Negative solution of the decision problem for sentences true in every subalgebra of 〈N, +〉
inferredcites →https://doi.org/10.4064/fm-38-1-137-152openalex-snapshot
Undecidability of Some Topological Theories
inferredcites →https://doi.org/10.4064/fm-47-1-57-103openalex-snapshot
The first order properties of products of algebraic systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19870330610openalex-snapshot
Heyting Algebras with a Dual Lattice Endomorphism
inferred← citeshttps://doi.org/10.1006/jcss.1999.1678openalex-snapshot
Undecidability Results for Low Complexity Time Classes
inferred← citeshttps://doi.org/10.1007/bf01190967openalex-snapshot
Undecidable fragments of elementary theories
inferred← citeshttps://doi.org/10.1007/bf01229957openalex-snapshot
Undecidability of relatively free Hilbert algebras
inferred← citeshttps://doi.org/10.1007/bf01243871openalex-snapshot
The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences
inferred← citeshttps://doi.org/10.1007/bf02483841openalex-snapshot
Structural diversity in the lattice of equational theories
inferred← citeshttps://doi.org/10.1007/bfb0086120openalex-snapshot
Undecidability and initial segments of the wtt-degrees ≤0′
inferred← citeshttps://doi.org/10.1007/s00012-019-0601-9openalex-snapshot
The undecidability of the elementary theory of lattices of all equational theories of large signature
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.01.002openalex-snapshot
Undecidability of the structure of the Solovay degrees of c.e. reals
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70658-xopenalex-snapshot
On the Decision Problem of the Congruence Lattices of Pseudocomplemented Semilattices( )
inferred← citeshttps://doi.org/10.1070/rm2005v060n03abeh000847openalex-snapshot
Elementary classification and decidability of theories of derived structures
inferred← citeshttps://doi.org/10.1093/logcom/exae074openalex-snapshot
Undecidability of the degree structure of primitive recursive m-reducibility
inferred← citeshttps://doi.org/10.1093/logcom/exu066openalex-snapshot
A note on hereditarily Π10- and Σ10-complete sets of sentences
inferred← citeshttps://doi.org/10.2140/pjm.1986.122.319openalex-snapshot
Some undecidability results for lattices in recursion theory
inferred← citeshttps://doi.org/10.2307/2274468openalex-snapshot
Undecidability and initial segments of the (r.e.) tt-degrees
inferred← citeshttps://doi.org/10.2307/2694972openalex-snapshot
Initial segments of the lattice of Π10 classes
inferred← citeshttps://doi.org/10.2977/prims/1195176449openalex-snapshot
Undecidability of Free Pseudo-Complemented Semilattlces
inferred← citeshttps://doi.org/10.4213/rm1428openalex-snapshot
Элементарная классификация и разрешимость теории производных структур
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.