On the public citation graph

Arithmetic Hierarchy and ideals of enumerated Boolean algebras

https://doi.org/10.1007/bf00970918
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/bf00967504openalex-snapshot
Some properties of the constructivization of Boolean algebras
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0227009-1openalex-snapshot
On the Lattice of Recursively Enumerable Sets
inferredcites →https://doi.org/10.2307/2270692openalex-snapshot
Hierarchies of Boolean algebras

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-50026-9_10openalex-snapshot
Definable Subsets of Polynomial-Time Algebraic Structures
inferred← citeshttps://doi.org/10.1007/bf02001360openalex-snapshot
Index sets of classes of hyper-hypersimple sets
inferred← citeshttps://doi.org/10.1007/s10469-018-9491-8openalex-snapshot
Positive Preorders
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103304openalex-snapshot
Computable Stone spaces
inferred← citeshttps://doi.org/10.1016/s0049-237x(00)80022-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80003-7openalex-snapshot
Chapter 2 Elementary theories and their constructive models
inferred← citeshttps://doi.org/10.1017/bsl.2023.16openalex-snapshot
COMPUTABLY COMPACT METRIC SPACES
inferred← citeshttps://doi.org/10.1017/jsl.2023.67openalex-snapshot
COMPUTABLE TOPOLOGICAL GROUPS
inferred← citeshttps://doi.org/10.1023/a:1010260804894openalex-snapshot
Recursive Homogeneous Boolean Algebras
inferred← citeshttps://doi.org/10.1023/b:allo.0000020844.03135.a6openalex-snapshot
Computable Homogeneous Boolean Algebras and a Metatheorem
inferred← citeshttps://doi.org/10.1142/s0218196723500649openalex-snapshot
Separating notions in effective topology
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.1305/ndjfl/1143468308openalex-snapshot
Boolean Algebras, Tarski Invariants, and Index Sets
inferred← citeshttps://doi.org/10.2307/2275136openalex-snapshot
Nonisomorphism of lattices of recursively enumerable sets
inferred← citeshttps://doi.org/10.26907/2949-3919.2024.4.66-102openalex-snapshot
Separable numberings of universal 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.