Expressive Power and Decidability for Memory Logics

DOI10.1007/978-3-540-69937-8_7zbMath1156.03029OpenAlexW1805258570MaRDI QIDQ3511448

Carlos Areces, Diego Figueira, Sergio Mera, Santiago Figueira

Publication date: 10 July 2008

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69937-8_7

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)

Related Items (8)

THE MODAL LOGIC OF STEPWISE REMOVAL ⋮ Completeness results for memory logics ⋮ Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction) ⋮ Characterization, definability and separation via saturated models ⋮ Completeness Results for Memory Logics ⋮ Verification of dynamic bisimulation theorems in Coq ⋮ THE EXPRESSIVE POWER OF MEMORY LOGICS ⋮ On Characterization, Definability and ω-Saturated Models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid languages
• Hybrid logics: characterization, interpolation and complexity
• Internalizing labelled deduction
• Mechanizing Mathematical Reasoning

This page was built for publication: Expressive Power and Decidability for Memory Logics