The following pages link to Definability in dynamic logic (Q1158140):
Displaying 14 items.
- Decidability and definability with circumscription (Q579240) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- Equivalences among logics of programs (Q801684) (← links)
- Definability with bounded number of bound variables (Q922523) (← links)
- Propositional dynamic logic with local assignments (Q1062972) (← links)
- ``During'' cannot be expressed by ``after'' (Q1085154) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
- Communication in concurrent dynamic logic (Q1095653) (← links)
- Expressing program looping in regular dynamic logic (Q1161284) (← links)
- Process logic: Expressiveness, decidability, completeness (Q1168965) (← links)
- Definability by programs in first-order structures (Q1171876) (← links)
- More on looping vs. repeating in dynamic logic (Q2265813) (← links)
- Some applications of topology to program semantics (Q3340119) (← links)
