On the public citation graph

One quantifier will do in existential monadic second-order logic over pictures

https://doi.org/10.1007/bfb0055826
0 signed · 16 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.1996.0018openalex-snapshot
Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_4openalex-snapshot
Two-Dimensional Languages
inferredcites →https://doi.org/10.1016/0020-0190(94)00219-oopenalex-snapshot
A note on the number of monadic quantifiers in monadic ∑11
inferredcites →https://doi.org/10.1016/0022-0000(82)90016-2openalex-snapshot
Classifying regular events in symbolic logic
inferredcites →https://doi.org/10.1016/s0304-3975(96)00283-6openalex-snapshot
Recognizable picture languages and domino tiling
inferredcites →https://doi.org/10.1109/lics.1997.614951openalex-snapshot
The monadic quantifier alternation hierarchy over graphs is infinite

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2002.2955openalex-snapshot
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs
inferred← citeshttps://doi.org/10.1007/11663881_7openalex-snapshot
Arity and Alternation: A Proper Hierarchy in Higher Order Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-75414-5_7openalex-snapshot
Recognizable vs. Regular Picture Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_2openalex-snapshot
Picture Languages: From Wang Tiles to 2D Grammars
inferred← citeshttps://doi.org/10.1007/bfb0055753openalex-snapshot
Mathematical Foundations of Computer Science 1998
inferred← citeshttps://doi.org/10.1007/s10472-007-9071-4openalex-snapshot
Arity and alternation: a proper hierarchy in higher order logics
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.01.005openalex-snapshot
A logical approach to locality in pictures languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00277-8openalex-snapshot
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
inferred← citeshttps://doi.org/10.1145/2603088.2603118openalex-snapshot
Logical characterization of weighted pebble walking automata
inferred← citeshttps://doi.org/10.70675/9ec2dc59zadb1z414fz949fz0fd1afaab001openalex-snapshot
Specification and verification of quantitative properties : expressions, logics, 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.