Switch to: References

Add citations

You must login to add citations.
  1. Tense Logic Without Tense Operators.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):145-171.
    We shall describe the set of strongly meet irreducible logics in the lattice ϵLin.t of normal tense logics of weak orderings. Based on this description it is shown that all logics in ϵLin.t are independently axiomatizable. Then the description is used in order to investigate tense logics with respect to decidability, finite axiomatizability, axiomatization problems and completeness with respect to Kripke semantics. The main tool for the investigation is a translation of bimodal formulas into a language talking about partitions of (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Reduction of second‐order logic to modal logic.S. K. Thomason - 1975 - Mathematical Logic Quarterly 21 (1):107-114.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Modal Logics That Need Very Large Frames.Marcus Kracht - 1999 - Notre Dame Journal of Formal Logic 40 (2):141-173.
    The Kuznetsov-Index of a modal logic is the least cardinal such that any consistent formula has a Kripke-model of size if it has a Kripke-model at all. The Kuznetsov-Spectrum is the set of all Kuznetsov-Indices of modal logics with countably many operators. It has been shown by Thomason that there are tense logics with Kuznetsov-Index . Futhermore, Chagrov has constructed an extension of K4 with Kuznetsov-Index . We will show here that for each countable ordinal there are logics with Kuznetsov-Index (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Mathematical modal logic: A view of its evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.
    Download  
     
    Export citation  
     
    Bookmark   57 citations  
  • What is an inference rule?Ronald Fagin, Joseph Y. Halpern & Moshe Y. Vardi - 1992 - Journal of Symbolic Logic 57 (3):1018-1045.
    What is an inference rule? This question does not have a unique answer. One usually finds two distinct standard answers in the literature; validity inference $(\sigma \vdash_\mathrm{v} \varphi$ if for every substitution $\tau$, the validity of $\tau \lbrack\sigma\rbrack$ entails the validity of $\tau\lbrack\varphi\rbrack)$, and truth inference $(\sigma \vdash_\mathrm{t} \varphi$ if for every substitution $\tau$, the truth of $\tau\lbrack\sigma\rbrack$ entails the truth of $\tau\lbrack\varphi\rbrack)$. In this paper we introduce a general semantic framework that allows us to investigate the notion of inference (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations