Justification logic enjoys the strong finite model property

2015/06/23 by Thomas Studer, Studer, Thomas
Computer Science · Mathematics · #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies #cs.LO #math.LO

paper · pdf · doi:10.48550/arxiv.1506.06933

arxiv created 2015/06/23 · openalex publication_date 2015/06/23 · arxiv updated 2015/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We observe that justification logic enjoys a form the strong finite model property (sometimes also called small model property). Thus we obtain decidability proofs for justification logic that do not rely on Post's theorem.

Related

• Extensions to Justification Theory
• Analytic Tableaux for Justification Logics
• A completeness result for implicit justification stit logic
• Subset models for justification logic
• On the sharpness and the injective property of basic justification\n models