Pages that link to "Item:Q1214411"
From MaRDI portal
The following pages link to The monadic second order theory of all countable ordinals (Q1214411):
Displayed 33 items.
- Temporal logics over linear time domains are in PSPACE (Q418122) (← links)
- Büchi context-free languages (Q627181) (← links)
- Selection over classes of ordinals expanded by monadic predicates (Q636340) (← links)
- On Müller context-free grammars (Q764314) (← links)
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) (Q783293) (← links)
- Hierarchies of weak automata and weak monadic formulas (Q805253) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- On decidability properties of local sentences (Q860837) (← links)
- Inferring answers to queries (Q927868) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Complementing deterministic Büchi automata in polynomial time (Q1116702) (← links)
- Constructivizations of Boolean algebras (Q1171567) (← links)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes (Q1249573) (← links)
- An axiom system for the weak monadic second order theory of two successors (Q1253650) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
- On the structure of random unlabelled acyclic graphs. (Q1426116) (← links)
- On the complementation of Büchi automata (Q1822512) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations (Q2947168) (← links)
- Expressing cardinality quantifiers in monadic second-order logic over chains (Q3011122) (← links)
- The full binary tree cannot be interpreted in a chain (Q3066806) (← links)
- REASONING ABOUT TRANSFINITE SEQUENCES (Q3426789) (← links)
- The recursive sets in certain monadic second order fragments of arithmetic (Q4088807) (← links)
- ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES (Q4652792) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- Locally finite languages (Q5941071) (← links)
- Topological properties of omega context-free languages (Q5958141) (← links)
- Wadge hierarchy of omega context-free languages (Q5958618) (← links)
- On algebraic array theories (Q6192058) (← links)