This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback