scientific article; zbMATH DE number 3290311
From MaRDI portal
Publication:5572332
zbMath0182.33201MaRDI QIDQ5572332
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
On the complexity of decision using destinies in \(H\)-bounded structures ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ MSOL partitioning problems on graphs of bounded treewidth and clique-width ⋮ Logics of Finite Hankel Rank ⋮ Interpreting the weak monadic second order theory of the ordered rationals ⋮ Counting on CTL\(^*\): On the expressive power of monadic path logic ⋮ On the strength of some topological lattices ⋮ Arity hierarchy for temporal logics ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS ⋮ Linear Recurrence Relations for Graph Polynomials
This page was built for publication:
