On the size of shortest modal descriptions

MaRDI QIDQ2904050zbMATH OpenFDO

Authors Santiago Figueira, Daniel Gorín

Publication date 5 August 2012

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Ehrenfeucht-Fra%EF%BF%BD%EF%BF%BDss%EF%BF%BD%EF%BF%BD+game&go=Go Ehrenfeucht-Fra��ss�� game]fragments of modal logicsshortest formula sizesuccinctness for separation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Recommendations

• On the succinctness of some modal logics
• Some exponential lower bounds on formula-size in modal logic
• scientific article; zbMATH DE number 1088193
• On the relative succinctness of two extensions by definitions of multimodal logic
• On the complexity of elementary modal logics
• scientific article; zbMATH DE number 1670490
• scientific article; zbMATH DE number 2196594
• On the complexity of modal separation logics
• On the complexity of small description and related topics
• The Succinctness of First-order Logic over Modal Logic via a Formula Size Game

Cited in

(2)

• Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
• The succinctness of the cover modality

This page was built for publication: On the size of shortest modal descriptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904050)