Some Metacomplete Relevant Modal Logics

Studia Logica 101 (5):1115-1141 (2013)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 89,764

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Simple Consistency of Naive Set Theory using Metavaluations.Ross T. Brady - 2014 - Journal of Philosophical Logic 43 (2-3):261-281.
General Frames for Relevant Modal Logics.Takahiro Seki - 2003 - Notre Dame Journal of Formal Logic 44 (2):93-109.
Kripke semantics for modal substructural logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Models for relevant modal logics.André Fuhrmann - 1990 - Studia Logica 49 (4):501 - 514.
Term-modal logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
Modal translations in substructural logics.Kosta Došen - 1992 - Journal of Philosophical Logic 21 (3):283 - 336.

Analytics

Added to PP
2012-12-04

Downloads
32 (#426,861)

6 months
3 (#435,693)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Modal logic.Alexander Chagrov - 1997 - New York: Oxford University Press. Edited by Michael Zakharyaschev.
Metacompleteness.Robert K. Meyer - 1976 - Notre Dame Journal of Formal Logic 17 (4):501-516.

View all 11 references / Add more references