scientific article; zbMATH DE number 1086492
From MaRDI portal
Publication:4362730
zbMath0888.03002MaRDI QIDQ4362730
Publication date: 1 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitymonadic second-order logicdecidabilityKleene-Mostowski hierarchyEhrenfeucht gamesordinal ordering
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (24)
Towards a language theory for infinite N-free pomsets. ⋮ On the complexity of decision using destinies in \(H\)-bounded structures ⋮ On decidability of monadic logic of order over the naturals extended by monadic predicates ⋮ Counting on CTL\(^*\): On the expressive power of monadic path logic ⋮ Feferman-vaught decompositions for prefix classes of first order logic ⋮ Temporal logics over linear time domains are in PSPACE ⋮ Continuous time temporal logic with counting ⋮ Weakly maximal decidable structures ⋮ A syntactic congruence for languages of birooted trees ⋮ Selection over classes of ordinals expanded by monadic predicates ⋮ Arity hierarchy for temporal logics ⋮ The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates ⋮ On Expressive Power of Regular Expressions over Infinite Orders ⋮ Logical aspects of Cayley-graphs: the group case ⋮ Logic and rational languages of words indexed by linear orderings ⋮ Compositional Failure Detection in Structured Transition Systems ⋮ Decidable metric logics ⋮ Decidable Expansions of Labelled Linear Orderings ⋮ Regular Transformations of Data Words Through Origin Information ⋮ The Compositional Method and Regular Reachability ⋮ Cardinality Quantifiers in MLO over Trees ⋮ Decidable Extensions of Church’s Problem ⋮ The monadic theory of morphic infinite words and generalizations ⋮ Query automata over finite trees
This page was built for publication:
