The following pages link to Modest theory of short chains. I (Q3914954):
Displaying 29 items.
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
- Counting on CTL\(^*\): On the expressive power of monadic path logic (Q1398378) (← links)
- Calculation of aerosol particle trajectories in the velocity hodograph plane (Q1815136) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- On the complexity of decision using destinies in \(H\)-bounded structures (Q1885032) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- A.D. Taimanov and model theory in Kazakhstan (Q2306026) (← links)
- On integrability in elementary functions of certain classes of complex nonautonomous equations (Q2452863) (← links)
- On countable chains having decidable monadic theory (Q2892678) (← links)
- Logics of Finite Hankel Rank (Q2947177) (← links)
- Composition Over the Natural Number Ordering with an Extra Binary Relation (Q2947182) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- Expressing cardinality quantifiers in monadic second-order logic over chains (Q3011122) (← links)
- Simple monadic theories and partition width (Q3170562) (← links)
- Rabin's uniformization problem (Q3322069) (← links)
- On the strength of the interpretation method (Q3476808) (← links)
- On Monadic Theories of Monadic Predicates (Q3586024) (← links)
- Modest theory of short chains. II (Q3914955) (← links)
- Definability and undefinability with real order at the background (Q4508271) (← links)
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. (Q5005180) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- Effective optimization with weighted automata on decomposable trees (Q5413875) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)
- Decidable Expansions of Labelled Linear Orderings (Q5892516) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
