On the public citation graph

Fine hierarchy and definable index sets

https://doi.org/10.1007/bf02018741

0 signed · 21 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/3-540-18740-5_85openalex-snapshot

Index sets of factor-objects of the Post numbering

inferredcites →https://doi.org/10.1007/bf01978567openalex-snapshot

Index sets of quotient objects of the post numeration

inferredcites →https://doi.org/10.1007/bf01978879openalex-snapshot

Hierearchies of hyperarithmetical sets and functions

inferredcites →https://doi.org/10.1007/bf01980251openalex-snapshot

Refined hierarchy of formulas

inferredcites →https://doi.org/10.1007/bf01980608openalex-snapshot

Application of precomplete enumerations to tabular-type degrees and index sets

inferredcites →https://doi.org/10.1007/bf02001360openalex-snapshot

Index sets of classes of hyper-hypersimple sets

inferredcites →https://doi.org/10.1007/bf02218612openalex-snapshot

Recursively enumerable many-one degrees

inferredcites →https://doi.org/10.1090/s0002-9904-1975-13747-5openalex-snapshot

The Boolean algebra of logic

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44693-1_47openalex-snapshot

A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages

inferred← citeshttps://doi.org/10.1007/3-540-59293-8_201openalex-snapshot

Fine hierarchy of regular ω-languages

inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_14openalex-snapshot

Positive Structures

inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_17openalex-snapshot

Universal Boolean Algebras with Applications to Semantic Classes of Models

inferred← citeshttps://doi.org/10.1016/0168-0072(94)00050-6openalex-snapshot

On recursively enumerable structures

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.031openalex-snapshot

Fine hierarchies and m-reducibilities in theoretical computer science

inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00052-3openalex-snapshot

Index sets for Π01 classes

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00301-0openalex-snapshot

Fine hierarchy of regular ω-languages

inferred← citeshttps://doi.org/10.1023/a:1020935905309openalex-snapshot

Decidability of Hierarchies of Regular Aperiodic Languages

inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04285-7openalex-snapshot

Ranked structures and arithmetic transfinite recursion

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/2275522openalex-snapshot

Fine hierarchies and Boolean terms

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.