On the public citation graph
Rabin's uniformization problem
0 signed · 61 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/978-1-4613-8928-6_29openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.1016/s0049-237x(08)70525-1openalex-snapshot
A Decision Procedure for the Weak Second Order Theory of Linear Order
inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
inferredcites →https://doi.org/10.1090/s0002-9904-1968-12122-6openalex-snapshot
Decidability of second-order theories and automata on infinite trees
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0280205-0openalex-snapshot
Solving sequential conditions by finite-state strategies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11841883_5openalex-snapshot
Automata on Directed Graphs: Edge Versus Vertex Marking
inferred← citeshttps://doi.org/10.1007/11874683_36openalex-snapshot
Church Synthesis Problem with Parameters
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_22openalex-snapshot
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_89openalex-snapshot
On the Ehrenfeucht-Fraïssé game in theoretical computer science
inferred← citeshttps://doi.org/10.1007/3-540-63246-8_8openalex-snapshot
Ehrenfeucht games, the composition method, and the monadic theory of ordinal words
inferred← citeshttps://doi.org/10.1007/978-3-319-19225-3_1openalex-snapshot
Unambiguity in Automata Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_26openalex-snapshot
Delay Games with WMSO$$+$$U Winning Conditions
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_19openalex-snapshot
Composition Over the Natural Number Ordering with an Extra Binary Relation
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_22openalex-snapshot
BDD-Based Boolean Functional Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_42openalex-snapshot
Uniformization Problem for Variants of First Order Logic over Finite Words
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_15openalex-snapshot
MSO on the Infinite Binary Tree: Choice and Order
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_31openalex-snapshot
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_1openalex-snapshot
Yuri, Logic, and Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_30openalex-snapshot
On Monadic Theories of Monadic Predicates
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_2openalex-snapshot
Automatic Structures and Groups
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_8openalex-snapshot
Asymptotic Monadic Second-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_36openalex-snapshot
How Much Lookahead is Needed to Win Infinite Games?
inferred← citeshttps://doi.org/10.1007/978-3-662-52947-8openalex-snapshot
Descriptive Set Theoretic Methods in Automata Theory Decidability and Topological Complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00084-vopenalex-snapshot
On Gabbay's temporal fixed point operator
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.049openalex-snapshot
Composition Theorems for Generalized Sum and Recursively Defined Types
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.032openalex-snapshot
Synthesis for continuous time
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.008openalex-snapshot
Tree-automatic scattered linear orders
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00126-8openalex-snapshot
Finite variability interpretation of monadic logic of order
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00104-4openalex-snapshot
Counting on CTL*: on the expressive power of monadic path logic
inferred← citeshttps://doi.org/10.1017/s0960129519000173openalex-snapshot
Monoidal-closed categories of tree automata
inferred← citeshttps://doi.org/10.1017/s1755020324000297openalex-snapshot
THE GENERIC MULTIVERSE IS NOT GOING AWAY
inferred← citeshttps://doi.org/10.1051/ita/2016018openalex-snapshot
Delay Games with WMSO+U Winning Conditions
inferred← citeshttps://doi.org/10.1093/jigpal/12.2.125openalex-snapshot
Selection and Uniformization in Generalized Product
inferred← citeshttps://doi.org/10.1109/lics.1999.782631openalex-snapshot
On the expressive power of CTL
inferred← citeshttps://doi.org/10.1109/lics.2006.35openalex-snapshot
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems
inferred← citeshttps://doi.org/10.1109/lics.2012.65openalex-snapshot
Interpretations in Trees with Countably Many Branches
inferred← citeshttps://doi.org/10.1109/lics.2015.44openalex-snapshot
A Complete Axiomatization of MSO on Infinite Trees
inferred← citeshttps://doi.org/10.1145/1182613.1182617openalex-snapshot
On compositionality and its limitations
inferred← citeshttps://doi.org/10.1145/3373718.3394782openalex-snapshot
Uniformisations of Regular Relations Over Bi-Infinite Words
inferred← citeshttps://doi.org/10.1145/3452917openalex-snapshot
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties
inferred← citeshttps://doi.org/10.1145/3661814.3662114openalex-snapshot
Uniformisation of Regular Relations in First-Order Logic with Two Variables
inferred← citeshttps://doi.org/10.2168/lmcs-12(3:4)2016openalex-snapshot
How Much Lookahead is Needed to Win Infinite Games?
inferred← citeshttps://doi.org/10.2307/2275812openalex-snapshot
Uniformization, choice functions and well orders in the class of trees
inferred← citeshttps://doi.org/10.2307/2586591openalex-snapshot
Uniformization and skolem functions in the class of trees
inferred← citeshttps://doi.org/10.23638/lmcs-16(4:6)2020openalex-snapshot
A Functional (Monadic) Second-Order Theory of Infinite Trees
inferred← citeshttps://doi.org/10.2478/s11533-010-0046-zopenalex-snapshot
Choice functions and well-orderings over the infinite binary tree
inferred← citeshttps://doi.org/10.3233/fun-2007-791-207openalex-snapshot
Composition Theorem for Generalized Sum
inferred← citeshttps://doi.org/10.4230/dagsemproc.07441.4openalex-snapshot
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.140openalex-snapshot
Unambiguous Languages Exhaust the Index Hierarchy
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.586openalex-snapshot
The Rank of Tree-Automatic Linear Orderings
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2862openalex-snapshot
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic
inferred← citeshttps://doi.org/10.48550/arxiv.1412.3978openalex-snapshot
Delay Games with WMSO+U Winning Conditions
inferred← citeshttps://doi.org/10.48550/arxiv.1509.07495openalex-snapshot
Unbounded Lookahead in WMSO+U Games
inferred← citeshttps://doi.org/10.48550/arxiv.math/9404227openalex-snapshot
Uniformization, choice functions and well orders in the class of 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.