scientific article; zbMATH DE number 3290311
From MaRDI portal
Publication:5572332
Cited in
(12)- Counting on CTL^*: On the expressive power of monadic path logic
- On the complexity of decision using destinies in \(H\)-bounded structures
- Logics of finite Hankel rank
- On the strength of some topological lattices
- An algebraic approach to MSO-definability on countable linear orderings
- Linear Recurrence Relations for Graph Polynomials
- A list of arithmetical structures complete with respect to the first-order definability
- Algorithmic uses of the Feferman-Vaught theorem
- Interpreting the weak monadic second order theory of the ordered rationals
- On the theory of order over real numbers
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Arity hierarchy for temporal logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572332)
