We have already seen examples showing that some modal derivations have natural justification counterparts: Examples 2.10-2.21. These are really instances of a very general phenomenon that we call realization.

That is, for many common modal logics, each of their theorems can be read as a statement about explicit justifications, which can be found by an algorithmic procedure. In this chapter we present the original Realization Theorem and its proof, for S4 and its subsystems.

6.1

<< | >>

↑

Source: Artemov S., Fitting M.. Justification Logic: Reasoning with Reasons. Cambridge: Cambridge University Press,2019. — 271 p.. 2019

We have already seen examples showing that some modal derivations have nat­ural justification counterparts: Examples 2.10-2.21. These are really instances of a very general phenomenon that we call realization.

More on the topic We have already seen examples showing that some modal derivations have nat­ural justification counterparts: Examples 2.10-2.21. These are really instances of a very general phenomenon that we call realization.:

We have already seen examples showing that some modal derivations have natural justification counterparts: Examples 2.10-2.21. These are really instances of a very general phenomenon that we call realization.

More on the topic We have already seen examples showing that some modal derivations have natural justification counterparts: Examples 2.10-2.21. These are really instances of a very general phenomenon that we call realization.: