Switch to: References

Add citations

You must login to add citations.
  1. A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs.George Tourlakis - 2016 - Bulletin of the Section of Logic 45 (1).
    Reference [12] introduced a novel formula to formula translation tool that enables syntactic metatheoretical investigations of first-order modallogics, bypassing a need to convert them first into Gentzen style logics in order torely on cut elimination and the subformula property. In fact, the formulator tool,as was already demonstrated in loc. cit., is applicable even to the metatheoreticalstudy of logics such as QGL, where cut elimination is unavailable. This paper applies the formulator approach to show the independence of the axiom schema ☐A (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An Arithmetically Complete Predicate Modal Logic.Yunge Hao & George Tourlakis - 2021 - Bulletin of the Section of Logic 50 (4):513-541.
    This paper investigates a first-order extension of GL called \. We outline briefly the history that led to \, its key properties and some of its toolbox: the \emph{conservation theorem}, its cut-free Gentzenisation, the ``formulators'' tool. Its semantic completeness is fully stated in the current paper and the proof is retold here. Applying the Solovay technique to those models the present paper establishes its main result, namely, that \ is arithmetically complete. As expanded below, \ is a first-order modal logic (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations