The following pages link to (Q3757893):
Displaying 9 items.
- Notes on monadic logic. Part B: Complexity of linear orders in ZFC (Q912091) (← links)
- More on monadic logic. C: Monadically interpreting in stable unsuperstable \(\mathcal T\) and the monadic theory of \(^{\omega}\lambda\) (Q916645) (← links)
- Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms (Q929294) (← links)
- Arity hierarchy for temporal logics (Q944387) (← links)
- Notes on monadic logic. A: Monadic theory of the real line (Q1115431) (← links)
- Counting on CTL\(^*\): On the expressive power of monadic path logic (Q1398378) (← links)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- Complexity of the theory of the binary tree with constants (Q3986920) (← links)
- APPROXIMATING TREES AS COLOURED LINEAR ORDERS AND COMPLETE AXIOMATISATIONS OF SOME CLASSES OF TREES (Q5015724) (← links)
