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.
KeywordsRelevant modal logic Metacompleteness Primeness Consistency Admissibility of γ
Unable to display preview. Download preview PDF.
- 1.Brady R. T. (ed.), Relevant Logics and Their Rivals, Volume II, Ashgate Publishing Limited, Aldershot, 2003.Google Scholar
- 2.Chagrov A. V., Zakharyaschev M. V.: Modal Logics. Clarendon Press, Oxford (1997)Google Scholar
- 7.Seki T.: The γ-admissibility of relevant modal logics II—the method using metavaluations. Studia Logica 97, 375–407 (2011)Google Scholar