Expressive completeness through logically tractable models

DOI10.1016/J.APAL.2013.06.017MaRDI QIDQ490672zbMATH OpenOpenAlexFDO

Authors Martin Otto

Publication date 27 August 2015

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2013.06.017

zbMATH Keywords

finite model theorymodal logicmodel theorypreservationexpressive completenessguarded logic

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Other model constructions (03C30) Models with special properties (saturated, rigid, etc.) (03C50) Interpolation, preservation, definability (03C40)

Recommendations

• Model theoretic methods for fragments of FO and special classes of (finite) structures
• A restricted second order logic for finite structures
• The expressibility of fragments of hybrid graph logic on finite digraphs
• scientific article; zbMATH DE number 1499093
• The freedoms of (guarded) bisimulation

Cited in

(6)

• Expressive completeness and decidability
• scientific article; zbMATH DE number 1765670 (Why is no real title available?)
• EXPTIME-completeness of thorough refinement on modal transition systems
• Guarded negation
• SOME MODEL THEORY OF GUARDED NEGATION
• Model theoretic methods for fragments of FO and special classes of (finite) structures

This page was built for publication: Expressive completeness through logically tractable models

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