The monadic theory of order
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Monadic logic and Löwenheim numbers
- Stationary logic of ordinals
- The monadic theory and the next world
- The expressive power of Malitz quantifiers for linear orderings
- Notes on monadic logic. A: Monadic theory of the real line
- On translations of temporal logic of actions into monadic second-order logic
- Monadic theory of order and topology. II
- Elementary equivalence of topological spaces
- The monadic theory of \((\omega{}_ 2,<)\) may be complicated
- The complete finitely axiomatized theories of order are dense
- Monadic theory of order and topology, I
- A weak generalization of MA to higher cardinals
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Propositional quantification in the topological semantics for S4
- Counting on CTL^*: On the expressive power of monadic path logic
- Monadic second-order logic on tree-like structures
- Timer formulas and decidable metric temporal logic
- Convex decompositions in the plane and continuous pair colorings of the irrationals
- On infinite transition graphs having a decidable monadic theory
- Towards a language theory for infinite N-free pomsets.
- On the complexity of decision using destinies in \(H\)-bounded structures
- Toward classifying unstable theories
- The expressive power of second-order propositional modal logic
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- The factorisation forest theorem
- On the Weihrauch degree of the additive Ramsey theorem over the rationals
- Shelah-Stupp's and Muchnik's iterations revisited
- First-order theories of bounded trees
- Bisimulation invariant monadic-second order logic in the finite
- Pro-aperiodic monoids via saturated models
- On labeled birooted tree languages: algebras, automata and logic
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- Recognizability, hypergraph operations, and logical types
- The recognizability of sets of graphs is a robust property
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic
- Model checking parameterised multi-token systems via the composition method
- On countable chains having decidable monadic theory
- Asymptotic Monadic Second-Order Logic
- Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations
- Logics of finite Hankel rank
- Composition over the natural number ordering with an extra binary relation
- Expressing cardinality quantifiers in monadic second-order logic over chains
- Regular languages of words over countable linear orderings
- The full binary tree cannot be interpreted in a chain
- Uniformization, choice functions and well orders in the class of trees
- Simple monadic theories and partition width
- Time-Bounded Verification
- Recursion schemes and the WMSO+U logic
- Rabin's uniformization problem
- Interpreting second-order logic in the monadic theory of order
- Limited set quantifiers over countable linear orderings
- On the strength of the interpretation method
- Taxonomies of model-theoretically defined topological properties
- Finite state automata and monadic definability of singular cardinals
- Weakly maximal decidable structures
- A Hierarchy of Automaticω-Words having a Decidable MSO Theory
- Model Transformations in Decidability Proofs for Monadic Theories
- On monadic theories of monadic predicates
- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
- Selection in the monadic theory of a countable ordinal
- Cardinality Quantifiers in MLO over Trees
- Decidable Extensions of Church’s Problem
- COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS
- State-strategies for games in Fσδ ∩ Gδσ
- The decision problem for branching time logic
- On frontiers of regular trees
- Substance and first-order quantification over individual-concepts
- On the bounded monadic theory of well-ordered structures
- Modest theory of short chains. I
- Modest theory of short chains. II
- Stationary Logic and Ordinals
- Temporal logics over linear time domains are in PSPACE
- Continuous time temporal logic with counting
- Peano arithmetic may not be interpretable in the monadic theory of linear orders
- Counting finite models
- Uniformization and skolem functions in the class of trees
- Infinite and bi-infinite words with decidable monadic theories
- On the strength of some topological lattices
- CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
- An algebraic approach to MSO-definability on countable linear orderings
- Reflecting stationary sets
- The compositional method and regular reachability
- Bisimulation Invariant Monadic-Second Order Logic in the Finite
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic.
- The subtrace order and counting first-order logic
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract)
- DOWNWARD UNARY COLORINGS
- THE COLORING OF THE TREE OF COLORINGS
- Register automata with extrema constraints, and an application to two-variable logic
- Recursion schemes, the MSO logic, and the \textsf{U} quantifier
- Compositional failure detection in structured transition systems
- A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
- Index problems for game automata
- On spectra of sentences of monadic second order logic with counting
- A strategy for dynamic programs: start over and muddle through
- The logical strength of Büchi's decidability theorem
- Effective optimization with weighted automata on decomposable trees
- Linear Recurrence Relations for Graph Polynomials
- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
- A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
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)
