Justification logic enjoys the strong finite model property
classification
💻 cs.LO
math.LO
keywords
justificationlogicmodelpropertyenjoysfinitestrongcalled
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.