Switch to: References

Add citations

You must login to add citations.
  1. Decidability of admissibility: On a problem by Friedman and its solution by Rybakov.Jeroen P. Goudsmit - 2021 - Bulletin of Symbolic Logic 27 (1):1-38.
    Rybakov proved that the admissible rules of $\mathsf {IPC}$ are decidable. We give a proof of the same theorem, using the same core idea, but couched in the many notions that have been developed in the mean time. In particular, we illustrate how the argument can be interpreted as using refinements of the notions of exactness and extendibility.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Unification and Finite Model Property for Linear Step-Like Temporal Multi-Agent Logic with the Universal Modality.Stepan I. Bashmakov & Tatyana Yu Zvereva - 2022 - Bulletin of the Section of Logic 51 (3):345-361.
    This paper proposes a semantic description of the linear step-like temporal multi-agent logic with the universal modality \(\mathcal{LTK}.sl_U\) based on the idea of non-reflexive non-transitive nature of time. We proved a finite model property and projective unification for this logic.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Unification in Pretabular Extensions of S4.Stepan I. Bashmakov - 2021 - Logica Universalis 15 (3):381-397.
    L.L. Maksimova and L. Esakia, V. Meskhi showed that the modal logic \ has exactly 5 pretabular extensions PM1–PM5. In this paper, we study the problem of unification for all given logics. We showed that PM2 and PM3 have finitary, and PM1, PM4, PM5 have unitary types of unification. Complete sets of unifiers in logics are described.
    $47.60 new   $52.55 used   $54.99 from Amazon    (collection)    View on Amazon.com
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation