Expressive Power and Decidability for Memory Logics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3885853 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- Hybrid languages
- Hybrid logics: Characterization, interpolation and complexity
- Internalizing labelled deduction
- Mechanizing Mathematical Reasoning
- Modal logic
Cited in
(13)- Hybrid logic meets IF modal logic
- Verification of dynamic bisimulation theorems in Coq
- Limitations of the program memory and the expressive power of dynamic logics
- Characterization, definability and separation via saturated models
- The expressive power of memory logics
- On characterization, definability and -saturated models
- Completeness Results for Memory Logics
- Completeness results for memory logics
- THE MODAL LOGIC OF STEPWISE REMOVAL
- Programming Languages and Systems
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)
- Graph games and logic design
- On the undecidability of logics with converse, nominals, recursion and counting
This page was built for publication: Expressive Power and Decidability for Memory Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511448)