On the public citation graph
Towards a theory of recursive structures
0 signed · 46 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.1006/inco.1994.1100openalex-snapshot
Logical Definability of NP Optimization Problems
inferredcites →https://doi.org/10.1006/jcss.1996.0039openalex-snapshot
Completeness Results for Recursive Data Bases
inferredcites →https://doi.org/10.1007/bf01071084openalex-snapshot
Range and degree of realizability of formulas in the restricted predicate calculus
inferredcites →https://doi.org/10.1007/bf02260930openalex-snapshot
Functional trees and automorphisms of models
inferredcites →https://doi.org/10.1007/bf02773868openalex-snapshot
Hamiltonian paths in infinite graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90046-3openalex-snapshot
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
inferredcites →https://doi.org/10.1016/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0095-8956(92)90057-5openalex-snapshot
On the strength of König's duality theorem for infinite bipartite graphs
inferredcites →https://doi.org/10.1016/0168-0072(89)90029-8openalex-snapshot
On the complexity of finding the chromatic number of a recursive graph I: the bounded case
inferredcites →https://doi.org/10.1016/0304-3975(93)90259-vopenalex-snapshot
Quantifiers and approximation
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7092-2openalex-snapshot
Elementary Induction on Abstract Structures
inferredcites →https://doi.org/10.1017/s0022481200051756openalex-snapshot
Probabilities on finite models
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0416888-0openalex-snapshot
Recursive Euler and Hamilton Paths
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/lics.1996.561361openalex-snapshot
More about recursive structures: descriptive complexity and zero-one laws
inferredcites →https://doi.org/10.1109/sct.1993.336518openalex-snapshot
Taking it to the limit: on infinite variants of NP-complete problems
inferredcites →https://doi.org/10.1112/plms/s3-25.4.615openalex-snapshot
Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
inferredcites →https://doi.org/10.1145/103418.103444openalex-snapshot
Generic Computation and its complexity
inferredcites →https://doi.org/10.1145/103418.103445openalex-snapshot
Hamiltonian paths in infinite graphs
inferredcites →https://doi.org/10.1145/153850.153905openalex-snapshot
Completeness results for recursive data bases
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.4064/aa-9-4-331-340openalex-snapshot
Universal graphs and universal functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-4571(2000)51:7<614::aid-asi4>3.0.co;2-sopenalex-snapshot
A unified mathematical definition of classical information retrieval
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_10openalex-snapshot
The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_6openalex-snapshot
Descriptive Complexity Theory for Constraint Databases
inferred← citeshttps://doi.org/10.1007/3-540-63045-7openalex-snapshot
Logical Foundations of Computer Science
inferred← citeshttps://doi.org/10.1007/3-540-68804-8openalex-snapshot
Finite Model Theory and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_3openalex-snapshot
Finite Model Theory and Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_5openalex-snapshot
Embedded Finite Models and Constraint Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-17722-4_9openalex-snapshot
Programming Electronic Institutions with Utopia
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_3openalex-snapshot
Standing on the Shoulders of a Giant
inferred← citeshttps://doi.org/10.1007/s00224-001-1015-5openalex-snapshot
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs
inferred← citeshttps://doi.org/10.1007/s00224-004-1133-yopenalex-snapshot
Finite Presentations of Infinite Structures: Automata and Interpretations
inferred← citeshttps://doi.org/10.1016/j.ic.2006.10.002openalex-snapshot
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
inferred← citeshttps://doi.org/10.1109/lics.2001.932518openalex-snapshot
A model-theoretic approach to regular string relations
inferred← citeshttps://doi.org/10.1109/notere.2010.5536694openalex-snapshot
Easy programming of agent based electronic institution with UTOPIA
inferred← citeshttps://doi.org/10.1145/335168.335214openalex-snapshot
Fixed-point query languages for linear constraint databases
inferred← citeshttps://doi.org/10.1145/876638.876642openalex-snapshot
Definable relations and first-order query languages over strings
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0212049openalex-snapshot
An Ehrenfeucht-Fraisse Game Approach to Collapse Results in Database Theory
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.