On the public citation graph

Modest theory of short chains. I

0 signed · 68 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.1007/bf02756489openalex-snapshot
Monadic theory of order and topology, 1
inferredcites →https://doi.org/10.1016/0003-4843(70)90009-4openalex-snapshot
Internal cohen extensions
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/s0002-9904-1956-10036-0openalex-snapshot
A partition calculus in set theory
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.2307/1971037openalex-snapshot
The Monadic Theory of Order
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.1002/9781119357056.ch4openalex-snapshot
Incremental Verification and Coverage Analysis of Strongly Distributed Systems
inferred← citeshttps://doi.org/10.1002/cpe.3597openalex-snapshot
Incremental computations over strongly distributed databases
inferred← citeshttps://doi.org/10.1002/malq.201010019openalex-snapshot
Simple monadic theories and partition width
inferred← citeshttps://doi.org/10.1006/inco.1995.1084openalex-snapshot
Infinitary Logic and Inductive Definability over Finite Structures
inferred← citeshttps://doi.org/10.1007/10692760_1openalex-snapshot
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_39openalex-snapshot
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_159openalex-snapshot
Incremental model checking for decomposable structures
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-030-78163-7_18openalex-snapshot
A Logic-Based Approach to Incremental Reasoning on Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_14openalex-snapshot
Logics of Finite Hankel Rank
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-23534-9_6openalex-snapshot
Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations
inferred← citeshttps://doi.org/10.1007/978-3-319-30024-5_11openalex-snapshot
Maintenance of Queries Under Database Changes: A Unified Logic Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_15openalex-snapshot
Linear Recurrence Relations for Graph Polynomials
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-15025-8_5openalex-snapshot
Decidable Expansions of Labelled Linear Orderings
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_49openalex-snapshot
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_9openalex-snapshot
Infinite Ordered Sets, A Recursive Perspective
inferred← citeshttps://doi.org/10.1007/bf02760646openalex-snapshot
The monadic theory and the “next world”
inferred← citeshttps://doi.org/10.1007/bf02764732openalex-snapshot
Notes on monadic logic. Part B: Complexity of linear orders in ZFC
inferred← citeshttps://doi.org/10.1007/bf02778038openalex-snapshot
Notes on monadic logic. part A. Monadic theory of the real line
inferred← citeshttps://doi.org/10.1007/bf02801469openalex-snapshot
More on monadic logic. part C: Monadically interpreting in stable unsuperstable ℱ and the monadic theory of $$^\omega \lambda $$
inferred← citeshttps://doi.org/10.1007/s002249910009openalex-snapshot
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90004-3openalex-snapshot
Monadic theory of order and topology in ZFC
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90054-popenalex-snapshot
The structure of the models of decidable monadic theories of graphs
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2014.08.001openalex-snapshot
Practical algorithms for MSO model-checking on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.06.001openalex-snapshot
Courcelle’s theorem—A game-theoretic approach
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.2004.03.024openalex-snapshot
On the complexity of decision using destinies in H-bounded structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.10.013openalex-snapshot
Factorization forests for infinite words and applications to countable scattered linear orderings
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70190-9openalex-snapshot
Crumbly Spaces
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)60600-5openalex-snapshot
Chapter 15 The Second-Order Theories Of Linear Orderings
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)60602-9openalex-snapshot
Complete Bibliography Of Linear Orderings
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00221-3openalex-snapshot
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00370-5openalex-snapshot
Towards a language theory for infinite N-free pomsets
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/9781316717158.019openalex-snapshot
Monadic Second-Order Theories
inferred← citeshttps://doi.org/10.1070/rm2005v060n03abeh000847openalex-snapshot
Elementary classification and decidability of theories of derived structures
inferred← citeshttps://doi.org/10.1080/02331934.2013.865735openalex-snapshot
Effective optimization with weighted automata on decomposable trees
inferred← citeshttps://doi.org/10.1109/lics.1999.782631openalex-snapshot
On the expressive power of CTL
inferred← citeshttps://doi.org/10.1109/lics.2003.1210069openalex-snapshot
Spectra of monadic second-order formulas with one unary function
inferred← citeshttps://doi.org/10.1109/synasc.2013.59openalex-snapshot
A Systematic Approach to Computations on Decomposable Graphs
inferred← citeshttps://doi.org/10.1109/synasc.2014.53openalex-snapshot
Views and Updates over Distributed Databases
inferred← citeshttps://doi.org/10.1145/1182613.1182617openalex-snapshot
On compositionality and its limitations
inferred← citeshttps://doi.org/10.1145/3508068openalex-snapshot
Satisfiability Problems on Sums of Kripke Frames
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:5)2011openalex-snapshot
Decidable Expansions of Labelled Linear Orderings
inferred← citeshttps://doi.org/10.2178/jsl/1096901758openalex-snapshot
On spectra of sentences of monadic second order logic with counting
inferred← citeshttps://doi.org/10.2178/jsl/1305810766openalex-snapshot
Expressing cardinality quantifiers in monadic second-order logic over chains
inferred← citeshttps://doi.org/10.2178/jsl/1333566639openalex-snapshot
On countable chains having decidable monadic theory
inferred← citeshttps://doi.org/10.2307/2273673openalex-snapshot
Rabin's uniformization problem
inferred← citeshttps://doi.org/10.2307/2274850openalex-snapshot
On the strength of the interpretation method
inferred← citeshttps://doi.org/10.2307/2586579openalex-snapshot
Definability and undefinability with real order at the background
inferred← citeshttps://doi.org/10.29007/45rvopenalex-snapshot
A Uniform Approach to Incremental Automated Reasoning on Strongly Distributed Structures
inferred← citeshttps://doi.org/10.3233/978-1-58603-782-6-261openalex-snapshot
Encounters with A. Mostowski
inferred← citeshttps://doi.org/10.3233/fi-2010-260openalex-snapshot
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
inferred← citeshttps://doi.org/10.3233/fun-2007-791-207openalex-snapshot
Composition Theorem for Generalized Sum
inferred← citeshttps://doi.org/10.33048/semi.2020.17.011openalex-snapshot
A. D. Taimanov and model theory in Kazakhstan
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2018.76openalex-snapshot
A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1702.02590openalex-snapshot
Test statistics and p-values
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.