On the public citation graph

Algorithmic complexity of algebraic systems

https://doi.org/10.1007/bf01158034
0 signed · 18 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/bf00969341openalex-snapshot
Complete theories of unars
inferredcites →https://doi.org/10.1007/bf02218612openalex-snapshot
Recursively enumerable many-one degrees
inferredcites →https://doi.org/10.2307/2270692openalex-snapshot
Hierarchies of Boolean algebras
inferredcites →https://doi.org/10.2307/2273222openalex-snapshot
Degrees of Structures
inferredcites →https://doi.org/10.2307/2274155openalex-snapshot
Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165…
inferredcites →https://doi.org/10.2307/2274271openalex-snapshot
Definable structures in the lattice of recursively enumerable sets

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_10openalex-snapshot
Well-Quasi Orders and Hierarchy Theory
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_10openalex-snapshot
On Computability of Ideal Lattices
inferred← citeshttps://doi.org/10.1007/s10958-021-05424-0openalex-snapshot
Degree Spectra of Structures
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00050-6openalex-snapshot
On recursively enumerable structures
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104590openalex-snapshot
Learning families of algebraic structures from informant
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80053-0openalex-snapshot
Chapter 20 Generally constructive boolean algebras
inferred← citeshttps://doi.org/10.1017/jsl.2023.93openalex-snapshot
DEGREE SPECTRA OF HOMEOMORPHISM TYPE OF COMPACT POLISH SPACES
inferred← citeshttps://doi.org/10.1134/s0037446617060052openalex-snapshot
Computability of Distributive Lattices
inferred← citeshttps://doi.org/10.1134/s1995080217040035openalex-snapshot
Effective categoricity for distributive lattices and Heyting algebras
inferred← citeshttps://doi.org/10.1142/s1793557122501261openalex-snapshot
Computable embeddability for algebraic structures
inferred← citeshttps://doi.org/10.1177/22113568261440402openalex-snapshot
Universal Boolean algebras, their ideals, and applications to semantic classes of models
inferred← citeshttps://doi.org/10.2178/jsl/1264433911openalex-snapshot
Lattice initial segments of the hyperdegrees
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.