On the public citation graph
Logical and schematic characterization of complexity classes
0 signed · 36 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.1007/3-540-51498-8_23openalex-snapshot
Descriptive and computational complexity
inferredcites →https://doi.org/10.1007/978-94-017-0462-5openalex-snapshot
Handbook of Philosophical Logic
inferredcites →https://doi.org/10.1007/bfb0099486openalex-snapshot
Toward logic tailored for computational complexity
inferredcites →https://doi.org/10.1016/0022-0000(81)90039-8openalex-snapshot
Number of quantifiers is better than number of tape cells
inferredcites →https://doi.org/10.1016/0022-0000(82)90011-3openalex-snapshot
Upper and lower bounds for first order expressibility
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(88)90052-7openalex-snapshot
Some relationships between logics of programs and complexity theory
inferredcites →https://doi.org/10.1016/s0019-9958(84)80023-6openalex-snapshot
On static logics, dynamic logics, and complexity classes
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
inferredcites →https://doi.org/10.1016/s0049-237x(08)71097-8openalex-snapshot
An Introduction to First-Order Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)71238-2openalex-snapshot
Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory
inferredcites →https://doi.org/10.1017/cbo9781139171496.014openalex-snapshot
Complexity of computation
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/psct.1987.10319271openalex-snapshot
Expressibility as a Complexity Measure: Results and Directions
inferredcites →https://doi.org/10.1109/sct.1988.5270openalex-snapshot
Nondeterministic space is closed under complementation
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/322003.322016openalex-snapshot
Even Simple Programs Are Hard To Analyze
inferredcites →https://doi.org/10.1145/567752.567763openalex-snapshot
Universality of data retrieval languages
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
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-48168-0_27openalex-snapshot
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws
inferred← citeshttps://doi.org/10.1007/bfb0022277openalex-snapshot
Ramified recurrence and computational complexity II: Substitution and poly-space
inferred← citeshttps://doi.org/10.1007/bfb0049340openalex-snapshot
Incorporating generalized quantifiers and the least fixed point operator
inferred← citeshttps://doi.org/10.1007/s00224-005-1230-6openalex-snapshot
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90043-iopenalex-snapshot
Using the Hamiltonian path operator to capture NP
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90036-1openalex-snapshot
Context-sensitive transitive closure operators
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00196-3openalex-snapshot
On the power of built-in relations in certain classes of program schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00183-9openalex-snapshot
Program schemes, arrays, Lindström quantifiers and zero-one laws
inferred← citeshttps://doi.org/10.1093/logcom/9.6.915openalex-snapshot
Hierarchies in classes of program schemes
inferred← citeshttps://doi.org/10.1093/logcom/exn025openalex-snapshot
Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays
inferred← citeshttps://doi.org/10.1112/s1461157000000371openalex-snapshot
Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
inferred← citeshttps://doi.org/10.3233/fi-2009-0050openalex-snapshot
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0112002openalex-snapshot
Program schemes with binary write-once arrays and the complexity classes they capture
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.