Justification logic enjoys the strong finite model property

TL;DR

This paper demonstrates that justification logic has a strong finite model property, enabling new decidability proofs that do not depend on Post's theorem, thus advancing the theoretical understanding of the logic.

Contribution

The paper establishes the strong finite model property for justification logic, providing a novel approach to decidability proofs independent of Post's theorem.

Findings

Justification logic has the strong finite model property.

Decidability proofs can be derived without Post's theorem.

The result enhances understanding of the model theory of justification logic.

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.