On the public citation graph

The Ehrenfeucht-Fraïssé games for transitive closure

https://doi.org/10.1007/bfb0023863
0 signed · 28 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.19870330107openalex-snapshot
Second‐order and Inductive Definability on Finite Structures
inferredcites →https://doi.org/10.1007/bf02011632openalex-snapshot
Topological model theory with an interior operator: Consistency properties and back — and forth arguments
inferredcites →https://doi.org/10.1007/bfb0023754openalex-snapshot
The expressive power of transitive closure and 2-way multihead automata
inferredcites →https://doi.org/10.1007/bfb0023761openalex-snapshot
On bounded theories
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/s0019-9958(77)90443-0openalex-snapshot
Application of model theoretic games to discrete linear orders and finite automata
inferredcites →https://doi.org/10.1016/s0049-237x(06)80047-9openalex-snapshot
The impact of model theory on theoretical computer science
inferredcites →https://doi.org/10.1016/s0049-237x(08)71879-2openalex-snapshot
On Local and Non-Local Properties
inferredcites →https://doi.org/10.1017/9781316717158openalex-snapshot
Model-Theoretic Logics
inferredcites →https://doi.org/10.1017/s0022481200051756openalex-snapshot
Probabilities on finite models
inferredcites →https://doi.org/10.1093/oso/9780198537359.003.0006openalex-snapshot
Model Theory and Computer Science: An Appetizer
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.2307/2274958openalex-snapshot
Reachability is harder for directed than for undirected finite graphs

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-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_24openalex-snapshot
Arity vs. alternation in second order logic
inferred← citeshttps://doi.org/10.1007/3-540-62222-5_52openalex-snapshot
Expressive power of unary counters
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_13openalex-snapshot
Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-03182-7_11openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/978-94-017-0522-6_10openalex-snapshot
Computable Quantifiers and Logics over Finite Structures
inferred← citeshttps://doi.org/10.1007/bfb0028580openalex-snapshot
Local normal forms for first-order logic with applications to games and automata
inferred← citeshttps://doi.org/10.1007/bfb0049330openalex-snapshot
Bounded-arity hierarchies in fixed-point logics
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00013-5openalex-snapshot
Arity and alternation in second-order logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.041openalex-snapshot
Classifying regular languages by a split game
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80047-9openalex-snapshot
The impact of model theory on theoretical computer science
inferred← citeshttps://doi.org/10.1109/lics.1995.523268openalex-snapshot
Tree canonization and transitive closure
inferred← citeshttps://doi.org/10.2168/lmcs-8(4:12)2012openalex-snapshot
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
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.