Some Metacomplete Relevant Modal Logics

Studia Logica 101 (5):1115-1141 (2013)
Abstract
A logic is called metacomplete if formulas that are true in a certain preferred interpretation of that logic are theorems in its metalogic. In the area of relevant logics, metacompleteness is used to prove primeness, consistency, the admissibility of γ and so on. This paper discusses metacompleteness and its applications to a wider class of modal logics based on contractionless relevant logics and their neighbours using Slaney’s metavaluational technique
Keywords Relevant modal logic  Metacompleteness  Primeness  Consistency  Admissibility of γ
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,351
External links
  • Through your library Configure
    References found in this work BETA
    Citations of this work BETA
    Similar books and articles
    Takahiro Seki (2003). General Frames for Relevant Modal Logics. Notre Dame Journal of Formal Logic 44 (2):93-109.
    Norihiro Kamide (2002). Kripke Semantics for Modal Substructural Logics. Journal of Logic, Language and Information 11 (4):453-470.
    Kosta Došen (1992). Modal Translations in Substructural Logics. Journal of Philosophical Logic 21 (3):283 - 336.
    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2012-12-04

    Total downloads

    1 ( #306,128 of 1,088,374 )

    Recent downloads (6 months)

    1 ( #69,601 of 1,088,374 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.