On the public citation graph

Unary quantifiers, transitive closure, and relations of large degree

https://doi.org/10.1007/bfb0028560
0 signed · 33 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.1006/inco.1995.1100openalex-snapshot
On Monadic NP vs Monadic co-NP
inferredcites →https://doi.org/10.1006/inco.1996.0070openalex-snapshot
Logical Hierarchies in PTIME
inferredcites →https://doi.org/10.1006/jcss.1997.1485openalex-snapshot
Counting Quantifiers, Successor Relations, and Logarithmic Space
inferredcites →https://doi.org/10.1006/jcss.1997.1494openalex-snapshot
Natural Proofs
inferredcites →https://doi.org/10.1006/jcss.1999.1675openalex-snapshot
On TC0, AC0, and Arithmetic Circuits
inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot
Finite Model Theory
inferredcites →https://doi.org/10.1007/3-540-60084-1_92openalex-snapshot
Graph Connectivity, Monadic NP and built-in relations of moderate degree
inferredcites →https://doi.org/10.1007/3-540-62034-6_33openalex-snapshot
Circuit complexity before the dawn of the new millennium
inferredcites →https://doi.org/10.1007/3-540-62222-5_42openalex-snapshot
Local properties of query languages
inferredcites →https://doi.org/10.1007/3-540-62222-5_52openalex-snapshot
Expressive power of unary counters
inferredcites →https://doi.org/10.1007/978-1-4612-1872-2openalex-snapshot
Complexity Theory Retrospective II
inferredcites →https://doi.org/10.1007/978-1-4612-4478-3openalex-snapshot
Complexity Theory Retrospective
inferredcites →https://doi.org/10.1007/978-1-4612-4478-3_5openalex-snapshot
Describing Graphs: A First-Order Approach to Graph Canonization
inferredcites →https://doi.org/10.1007/bf01305232openalex-snapshot
An optimal lower bound on the number of variables for graph identification
inferredcites →https://doi.org/10.1016/0022-0000(88)90030-xopenalex-snapshot
Parallel computation with threshold functions
inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot
On uniformity within NC1
inferredcites →https://doi.org/10.1016/s0049-237x(08)71879-2openalex-snapshot
On Local and Non-Local Properties
inferredcites →https://doi.org/10.1016/s0304-3975(99)00223-6openalex-snapshot
Local properties of query languages
inferredcites →https://doi.org/10.1017/9781316717158.005openalex-snapshot
Extended Logics: The General Framework
inferredcites →https://doi.org/10.1093/logcom/6.6.779openalex-snapshot
On winning strategies with unary quantifiers
inferredcites →https://doi.org/10.1109/lics.1997.614948openalex-snapshot
On the forms of locality over finite models
inferredcites →https://doi.org/10.1109/sfcs.1994.365730openalex-snapshot
Graph connectivity and monadic NP
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes

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-46541-3_18openalex-snapshot
Logics Capturing Local Properties
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_2openalex-snapshot
Counting and Locality over Finite Structures A Survey
inferred← citeshttps://doi.org/10.1007/bfb0028580openalex-snapshot
Local normal forms for first-order logic with applications to games and automata
inferred← citeshttps://doi.org/10.1007/s00778-015-0402-5openalex-snapshot
Querying streams using regular expressions: some semantics, decidability, and efficiency issues
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00152-9openalex-snapshot
Lower bounds for invariant queries in logics with counting
inferred← citeshttps://doi.org/10.1109/lics.1999.782626openalex-snapshot
Logics with counting, auxiliary relations, and lower bounds for invariant queries
inferred← citeshttps://doi.org/10.1109/lics.1999.782627openalex-snapshot
Counting and addition cannot express deterministic transitive closure
inferred← citeshttps://doi.org/10.1145/1376616.1376634openalex-snapshot
Efficient pattern matching over event streams
inferred← citeshttps://doi.org/10.1145/371282.371388openalex-snapshot
Logics capturing local properties
inferred← citeshttps://doi.org/10.46298/dmtcs.254openalex-snapshot
Local Normal Forms for First-Order Logic with Applications to Games and Automata
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.