Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Complete additivity and modal incompleteness.Wesley H. Holliday & Tadeusz Litak - 2019 - Review of Symbolic Logic 12 (3):487-535.
    In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem, “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • 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  
  • (1 other version)The modal logic of inequality.Maarten de Rijke - 1992 - Journal of Symbolic Logic 57 (2):566-584.
    We consider some modal languages with a modal operator $D$ whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Transitivity follows from Dummett's axiom.J. F. A. K. Van Benthem & W. J. Blok - 1978 - Theoria 44 (2):117-118.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.
    -/- Provability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. -/- From a philosophical point of view, provability logic is interesting because (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Kripke Incomplete Logics Containing KTB.Yutaka Miyazaki - 2007 - Studia Logica 85 (3):303-317.
    It is shown that there is a Kripke incomplete logic in NExt(KTB ⊕ □2 p → □3 p). Furthermore, it is also shown that there exists a continuum of Kripke incomplete logics in NExt(KTB ⊕ □5 p → □6 p).
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Transitivity follows from Dummett's axiom.J. F. A. K. van Benthem - 1978 - Theoria 44 (2):117-118.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Logical semantics as an empirical science.Johan van Benthem - 1983 - Studia Logica 42 (2):299-313.
    Exact philosophy consists of various disciplines scattered and separated. Formal semantics and philosophy of science are good examples of two such disciplines. The aim of this paper is to show that there is possible to find some integrating bridge topics between the two fields, and to show how insights from the one are illuminating and suggestive in the other.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • An incomplete decidable modal logic.M. J. Cresswell - 1984 - Journal of Symbolic Logic 49 (2):520-527.
    The most common way of proving decidability in propositional modal logic is to shew that the system in question has the finite model property. This is not however the only way. Gabbay in [4] proves the decidability of many modal systems using Rabin's result in [8] on the decidability of the second-order theory of successor functions. In particular [4, pp. 258-265] he is able to prove the decidability of a system which lacks the finite model property. Gabbay's system is however (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations