The following pages link to The monadic theory of order (Q1233019):
Displaying 50 items.
- Pro-aperiodic monoids via saturated models (Q2279939) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- On decidability of monadic logic of order over the naturals extended by monadic predicates (Q2373700) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- Model Checking Parameterised Multi-token Systems via the Composition Method (Q2817946) (← links)
- On countable chains having decidable monadic theory (Q2892678) (← links)
- Asymptotic Monadic Second-Order Logic (Q2922005) (← links)
- Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations (Q2947168) (← links)
- Logics of Finite Hankel Rank (Q2947177) (← links)
- Composition Over the Natural Number Ordering with an Extra Binary Relation (Q2947182) (← links)
- Expressing cardinality quantifiers in monadic second-order logic over chains (Q3011122) (← links)
- Regular Languages of Words over Countable Linear Orderings (Q3012914) (← links)
- The full binary tree cannot be interpreted in a chain (Q3066806) (← links)
- Uniformization, choice functions and well orders in the class of trees (Q3128469) (← links)
- Simple monadic theories and partition width (Q3170562) (← links)
- Time-Bounded Verification (Q3184695) (← links)
- Recursion Schemes and the WMSO+U Logic (Q3304152) (← links)
- Rabin's uniformization problem (Q3322069) (← links)
- Interpreting second-order logic in the monadic theory of order (Q3347854) (← links)
- Limited Set quantifiers over Countable Linear Orderings (Q3449472) (← links)
- On the strength of the interpretation method (Q3476808) (← links)
- Taxonomies of model-theoretically defined topological properties (Q3496325) (← links)
- Finite state automata and monadic definability of singular cardinals (Q3503746) (← links)
- Weakly maximal decidable structures (Q3514639) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- Model Transformations in Decidability Proofs for Monadic Theories (Q3540168) (← links)
- On Monadic Theories of Monadic Predicates (Q3586024) (← links)
- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings (Q3605520) (← links)
- Selection in the monadic theory of a countable ordinal (Q3617361) (← links)
- Cardinality Quantifiers in MLO over Trees (Q3644744) (← links)
- Decidable Extensions of Church’s Problem (Q3644764) (← links)
- COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS (Q3646170) (← links)
- State-strategies for games in <i>F<sub>σδ</sub></i> ∩ <i>G<sub>δσ</sub></i> (Q3679155) (← links)
- The decision problem for branching time logic (Q3708772) (← links)
- On frontiers of regular trees (Q3780462) (← links)
- Substance and first-order quantification over individual-concepts (Q3869325) (← links)
- On the bounded monadic theory of well-ordered structures (Q3877655) (← links)
- Modest theory of short chains. I (Q3914954) (← links)
- Modest theory of short chains. II (Q3914955) (← links)
- Stationary Logic and Ordinals (Q3929721) (← links)
- Peano arithmetic may not be interpretable in the monadic theory of linear orders (Q4372909) (← links)
- Counting finite models (Q4372920) (← links)
- Uniformization and skolem functions in the class of trees (Q4391426) (← links)
- (Q4585066) (← links)
- On the strength of some topological lattices (Q4635374) (← links)
- CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS (Q4658679) (← links)
- AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS (Q4692085) (← links)
- Reflecting stationary sets (Q4742774) (← links)
