On the public citation graph

A bounded set theory with Anti-Foundation Axiom and inductive definability

https://doi.org/10.1007/bfb0022280
0 signed · 25 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_84openalex-snapshot
Bounded set theory and polynomial computability
inferredcites →https://doi.org/10.1007/978-1-4615-7288-6openalex-snapshot
Introduction to Mathematical Logic
inferredcites →https://doi.org/10.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/bfb0099486openalex-snapshot
Toward logic tailored for computational complexity
inferredcites →https://doi.org/10.1016/0003-4843(72)90001-0openalex-snapshot
The fine structure of the constructible hierarchy
inferredcites →https://doi.org/10.1016/0168-0072(86)90055-2openalex-snapshot
Fixed-point extensions of first-order logic
inferredcites →https://doi.org/10.1016/0304-3975(93)90345-topenalex-snapshot
Hereditarily-finite sets, data bases and polynomial-time computability
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1016/s0049-237x(08)70761-4openalex-snapshot
Formal Theories for Transfinite Iterations of Generalized Inductive Definitions and Some Subsystems of Analysis
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7092-2openalex-snapshot
Elementary Induction on Abstract Structures
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1090/pspum/013.2/0376348openalex-snapshot
Set-theoretic functions for elementary syntax
inferredcites →https://doi.org/10.1109/sfcs.1983.5openalex-snapshot
Algebras of feasible functions
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical 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-45575-2_38openalex-snapshot
Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/3-540-46564-2_10openalex-snapshot
Capturing LOGSPACE over Hereditarily-Finite Sets
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_11openalex-snapshot
Δ-Languages for sets and sub-PTIME graph transformers
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_19openalex-snapshot
On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_42openalex-snapshot
Bounded hyperset theory and web-like data bases
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_5openalex-snapshot
On Bounded Set Theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00174-0openalex-snapshot
Δ-languages for sets and LOGSPACE computable graph transformers
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00312-0openalex-snapshot
Linear ordering on graphs, anti-founded sets and polynomial time computability
inferred← citeshttps://doi.org/10.1023/a:1013189515673openalex-snapshot
Δ: Set-theoretic query language capturing LOGSPACE
inferred← citeshttps://doi.org/10.1093/jigpal/jzl010openalex-snapshot
Querying Hyperset/Web-Like Databases
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.