On the public citation graph
The quantifier structure of sentences that characterize nondeterministic time complexity
0 signed · 37 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19870330107openalex-snapshot
Second‐order and Inductive Definability on Finite Structures
inferredcites →https://doi.org/10.1007/978-1-4615-7288-6openalex-snapshot
Introduction to Mathematical Logic
inferredcites →https://doi.org/10.1007/bf01699468openalex-snapshot
Universal quantifiers and time complexity of random access machines
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/bf01786976openalex-snapshot
Complexity classes and theories of finite models
inferredcites →https://doi.org/10.1007/bfb0030341openalex-snapshot
A topological view of some problems in complexity theory
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0166-218x(90)90079-ropenalex-snapshot
Lower bounds for recognizing small cliques on CRCW PRAM's
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(90)90065-popenalex-snapshot
0–1 Laws and decision problems for fragments of second-order logic
inferredcites →https://doi.org/10.1109/sfcs.1983.39openalex-snapshot
On determinism versus non-determinism and related problems
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1137/0213025openalex-snapshot
The Spectra of First-Order Sentences and Computational Complexity
inferredcites →https://doi.org/10.1137/0219028openalex-snapshot
A Nontrivial Lower Bound for an NP Problem on Automata
inferredcites →https://doi.org/10.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits
inferredcites →https://doi.org/10.1145/800152.804909openalex-snapshot
Turing machines and the spectra of first-order formulas with equality
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical Logic
inferredcites →https://doi.org/10.2307/2272354openalex-snapshot
Turing machines and the spectra of first-order formulas
inferredcites →https://doi.org/10.2307/2274691openalex-snapshot
Asymptotic probabilities of existential second-order Gödel sentences
inferredcites →https://doi.org/10.2307/2274958openalex-snapshot
Reachability is harder for directed than for undirected finite graphs
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.3027openalex-snapshot
Linear Time and the Power of One First-Order Universal Quantifier
inferred← citeshttps://doi.org/10.1007/10703163_2openalex-snapshot
Descriptive Complexity, Lower Bounds and Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_13openalex-snapshot
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_16openalex-snapshot
Second-Order Logic over Finite Structures – Report on a Research Programme
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_13openalex-snapshot
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
inferred← citeshttps://doi.org/10.1007/bfb0022256openalex-snapshot
Monadic logical definability of NP-complete problems
inferred← citeshttps://doi.org/10.1007/bfb0028031openalex-snapshot
Padding and the expressive power of existential second-order logics
inferred← citeshttps://doi.org/10.1007/s00224-005-1165-yopenalex-snapshot
The Expressive Power of Bijections over Weakly Arithmetized Structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.025openalex-snapshot
On the expressive power of monadic least fixed point logic
inferred← citeshttps://doi.org/10.1093/logcom/8.2.135openalex-snapshot
Computation of prime implicants using matrix and paths
inferred← citeshttps://doi.org/10.1109/lics.1998.705640openalex-snapshot
Existential second-order logic over strings
inferred← citeshttps://doi.org/10.1145/331605.331609openalex-snapshot
Existential second-order logic over strings
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.