The following pages link to (Q3674621):
Displayed 12 items.
- The \(k\)-variable property is stronger than H-dimension \(k\) (Q676186) (← links)
- Definability with bounded number of bound variables (Q922523) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Preservation of expressive completeness in temporal models (Q1090324) (← links)
- Expressive completeness failure in branching time structures (Q1109759) (← links)
- Modal languages and bounded fragments of predicate logic (Q1267082) (← links)
- Expressiveness of concept expressions in first-order description logics (Q1606296) (← links)
- Combining temporal logic systems (Q1815427) (← links)
- Deciding the guarded fragments by resolution (Q1867216) (← links)
- Deciding regular grammar logics with converse through first-order logic (Q2567343) (← links)
- A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time (Q4275691) (← links)
- Efficient and Expressive Tree Filters (Q5458857) (← links)