The monadic theory of order
From MaRDI portal
Cited in
(only showing first 100 items - show all)- First-order theories of bounded trees
- A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
- Linear Recurrence Relations for Graph Polynomials
- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
- Notes on monadic logic. A: Monadic theory of the real line
- Regular languages of words over countable linear orderings
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Rabin's uniformization problem
- More on monadic logic. C: Monadically interpreting in stable unsuperstable \(\mathcal T\) and the monadic theory of \(^{\omega}\lambda\)
- New proof of the solvability of the elementary theory of linearly ordered sets
- The monadic theory of \((\omega{}_ 2,<)\) may be complicated
- Arity hierarchy for temporal logics
- On expressive power of regular expressions over infinite orders
- Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words
- Weakly maximal decidable structures
- Monadic theory of order and topology, I
- Bisimulation invariant monadic-second order logic in the finite
- On labeled birooted tree languages: algebras, automata and logic
- DOWNWARD UNARY COLORINGS
- Expressing cardinality quantifiers in monadic second-order logic over chains
- Stationary logic of ordinals
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs
- Modest theory of short chains. I
- Logics of finite Hankel rank
- The expressive power of second-order propositional modal logic
- Non-emptiness test for automata over words indexed by the reals and rationals
- On infinite transition graphs having a decidable monadic theory
- THE COLORING OF THE TREE OF COLORINGS
- Asymptotic Monadic Second-Order Logic
- Monadic theory of order and topology. II
- Axiomatizability of propositionally quantified modal logics on relational frames
- Trees, grids, and MSO decidability: from graphs to matroids
- Uniformization, choice functions and well orders in the class of trees
- Counting finite models
- Logical aspects of Cayley-graphs: the group case
- Recursion schemes and the WMSO+U logic
- Notes on monadic logic. Part B: Complexity of linear orders in ZFC
- The logical strength of Büchi's decidability theorem
- Infinite and bi-infinite words with decidable monadic theories
- The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
- The structure of the models of decidable monadic theories of graphs
- A Hierarchy of Automaticω-Words having a Decidable MSO Theory
- Recognizability, hypergraph operations, and logical types
- The monadic theory and the next world
- On the Weihrauch degree of the additive Ramsey theorem over the rationals
- A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
- Monadic logic and Löwenheim numbers
- Compositional failure detection in structured transition systems
- Some extensions to propositional mean-value calculus: expressiveness and decidability
- scientific article; zbMATH DE number 7566055 (Why is no real title available?)
- Counting on CTL^*: On the expressive power of monadic path logic
- The complete finitely axiomatized theories of order are dense
- scientific article; zbMATH DE number 7199579 (Why is no real title available?)
- Cardinality Quantifiers in MLO over Trees
- Convex decompositions in the plane and continuous pair colorings of the irrationals
- A strategy for dynamic programs: start over and muddle through
- Algorithmic uses of the Feferman-Vaught theorem
- Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations
- Uniformization and skolem functions in the class of trees
- The expressive power of Malitz quantifiers for linear orderings
- Continuous time temporal logic with counting
- Temporal logics over linear time domains are in PSPACE
- Shelah-Stupp's and Muchnik's iterations revisited
- The spectrum problem for abelian \(\ell\)-groups and MV-algebras
- The factorisation forest theorem
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS
- The decision problem for branching time logic
- On the complexity of decision using destinies in \(H\)-bounded structures
- Automata on linear orderings
- On countable chains having decidable monadic theory
- On frontiers of regular trees
- Decidable metric logics
- On decidability properties of local sentences
- Selection in the monadic theory of a countable ordinal
- Limited set quantifiers over countable linear orderings
- Peano arithmetic may not be interpretable in the monadic theory of linear orders
- On translations of temporal logic of actions into monadic second-order logic
- Towards a language theory for infinite N-free pomsets.
- An algebraic approach to MSO-definability on countable linear orderings
- A weak generalization of MA to higher cardinals
- On the bounded monadic theory of well-ordered structures
- Bisimulation Invariant Monadic-Second Order Logic in the Finite
- Composition over the natural number ordering with an extra binary relation
- Timer formulas and decidable metric temporal logic
- Model checking parameterised multi-token systems via the composition method
- Substance and first-order quantification over individual-concepts
- Elementary equivalence of topological spaces
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
- Monadic second-order logic on tree-like structures
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic.
- Taxonomies of model-theoretically defined topological properties
- The full binary tree cannot be interpreted in a chain
- Stationary Logic and Ordinals
- Interpreting second-order logic in the monadic theory of order
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Finite state automata and monadic definability of singular cardinals
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract)
- First-order separation over countable ordinals
This page was built for publication: The monadic theory of order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1233019)
