Switch to: Citations

Add references

You must login to add references.
  1. Does the deduction theorem fail for modal logic?Raul Hakli & Sara Negri - 2012 - Synthese 187 (3):849-867.
    Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Universal grammar.Richard Montague - 1970 - Theoria 36 (3):373--398.
    Download  
     
    Export citation  
     
    Bookmark   319 citations  
  • Reflection ranks and ordinal analysis.Fedor Pakhomov & James Walsh - 2021 - Journal of Symbolic Logic 86 (4):1350-1384.
    It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this well-orderedness phenomenon by studying a coarsening of the consistency strength order, namely, the$\Pi ^1_1$reflection strength order. We prove that there are no descending sequences of$\Pi ^1_1$sound extensions of$\mathsf {ACA}_0$in this ordering. Accordingly, we can attach a rank in this order, which we call reflection rank, to any$\Pi (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Infinitary combinatorics and modal logic.Andreas Blass - 1990 - Journal of Symbolic Logic 55 (2):761-778.
    We show that the modal propositional logic G, originally introduced to describe the modality "it is provable that", is also sound for various interpretations using filters on ordinal numbers, for example the end-segment filters, the club filters, or the ineffable filters. We also prove that G is complete for the interpretation using end-segment filters. In the case of club filters, we show that G is complete if Jensen's principle □ κ holds for all $\kappa ; on the other hand, it (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Strong completeness of provability logic for ordinal spaces.Juan P. Aguilera & David Fernández-Duque - 2017 - Journal of Symbolic Logic 82 (2):608-628.
    Download  
     
    Export citation  
     
    Bookmark   5 citations