previous article in this issue | next article in this issue ![]() |
Preview first page |
Document Details : Title: A Reduction Procedure for the Modal Logic S4F Author(s): SKURA, Tomasz Journal: Logique et Analyse Volume: 265 Date: 2024-2025 Pages: 17-33 DOI: 10.2143/LEA.265.0.3294705 Abstract : A cycle-free and label-free reduction procedure for the modal logic S4F is provided. Our method consists in constructing for a given Mints form a reduction, that is, a finite sequence of finite sets of sequents with the property that every nonfinal term is valid (that is, each of its elements is valid) iff so is its immediate successor, and the final term consists of some simple sequents (whose status concerning validity is easy to establish). |
|