On the public citation graph

The monadic quantifier alternation hierarchy over grids and pictures

0 signed · 29 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.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1002/malq.19750210112openalex-snapshot
Monadic generalized spectra
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.0018openalex-snapshot
Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems
inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot
Finite Model Theory
inferredcites →https://doi.org/10.1007/3-540-58140-5_24openalex-snapshot
Arity vs. alternation in second order logic
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/978-3-540-92687-0openalex-snapshot
Logical Foundations of Computer Science
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1007/bfb0028030openalex-snapshot
The monadic quantifier alternation hierarchy over grids and pictures
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/0168-0072(95)00030-5openalex-snapshot
On winning Ehrenfeucht games and monadic NP
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot
Tree acceptors and some of their applications
inferredcites →https://doi.org/10.1090/s0002-9947-1961-0139530-9openalex-snapshot
Decision problems of finite automata design and related arithmetics
inferredcites →https://doi.org/10.1109/lics.1997.614951openalex-snapshot
The monadic quantifier alternation hierarchy over graphs is infinite
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories

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.1006/jcss.1999.1691openalex-snapshot
The Closure of Monadic NP
inferred← citeshttps://doi.org/10.1007/978-3-322-84823-9_16openalex-snapshot
Dot-Depth and Monadic Quantifier Alternation over Pictures — Extended Abstract
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-662-44602-7_10openalex-snapshot
Subshifts, MSO Logic, and Collapsing Hierarchies
inferred← citeshttps://doi.org/10.1016/j.apal.2014.08.003openalex-snapshot
Second-order propositional modal logic and monadic alternation hierarchies
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.1016/s0304-3975(02)00449-8openalex-snapshot
Tree-width and the monadic quantifier hierarchy
inferred← citeshttps://doi.org/10.1145/276698.276771openalex-snapshot
The closure of Monadic NP (extended abstract)
showing the first 10 of 11 · page through all 11
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.