On the public citation graph

Several results on upper semilattices andm-degrees

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.1002/malq.19700160208openalex-snapshot

Some Properties of Recursively Inseparable Sets

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

Hereditary sets and tabular reducibility

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

tt- andm-degrees

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

The upper semilatticeL(γ)

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

m-Powers of simple sets

inferredcites →https://doi.org/10.1070/sm1977v032n04abeh002400openalex-snapshot

ON RECURSIVELY ENUMERABLE MINIMAL BTT-DEGREES

inferredcites →https://doi.org/10.2307/2269692openalex-snapshot

A note on universal 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/bf00739571openalex-snapshot

The last question on recursively enumerablem-degrees

inferred← citeshttps://doi.org/10.1007/bf01156253openalex-snapshot

Semilattices of disjunctive and linear degrees

inferred← citeshttps://doi.org/10.1007/bf01978978openalex-snapshot

Relations between reducibilities of table type

inferred← citeshttps://doi.org/10.1007/bf01979647openalex-snapshot

Relations between table-type degrees

inferred← citeshttps://doi.org/10.1007/s00153-021-00774-7openalex-snapshot

Degree structures of conjunctive reducibility

inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot

Computably enumerable sets and related issues

inferred← citeshttps://doi.org/10.1016/j.aim.2021.107686openalex-snapshot

Fragments of the theory of the enumeration degrees

inferred← citeshttps://doi.org/10.1093/logcom/exab026openalex-snapshot

Notes on conjunctive and Quasi degrees

inferred← citeshttps://doi.org/10.1093/logcom/exad064openalex-snapshot

Conjunctive degrees and cylinders

inferred← citeshttps://doi.org/10.1305/ndjfl/1187031408openalex-snapshot

Cuppability of Simple and Hypersimple Sets

inferred← citeshttps://doi.org/10.2307/2275790openalex-snapshot

Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices

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.