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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brady R. T. (ed.), Relevant Logics and Their Rivals, Volume II, Ashgate Publishing Limited, Aldershot, 2003.
Chagrov A. V., Zakharyaschev M. V.: Modal Logics. Clarendon Press, Oxford (1997)
Kleene S. C.: Disjunction and existence under implication in elementary intuitionistic formalisms. Journal of Symbolic Logic 27, 11–18 (1962)
Meyer R. K.: Metacompleteness. Notre Dame Journal of Formal Logic 17, 501–516 (1976)
Seki T.: A Sahlqvist theorem for relevant modal logics. Studia Logica 73, 383–411 (2003)
Seki T.: The γ-admissibility of relevant modal logics I—the method of normal models. Studia Logica 97, 199–231 (2011)
Seki T.: The γ-admissibility of relevant modal logics II—the method using metavaluations. Studia Logica 97, 375–407 (2011)
Seki T.: An algebraic proof of the admissibility of γ in relevant modal logics. Studia Logica 100(6), 1149–1174 (2012)
Slaney J.K.: A Metacompleteness theorem for contraction-free relevant logics. Studia Logica 43, 159–168 (1984)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Seki, T. Some Metacomplete Relevant Modal Logics. Stud Logica 101, 1115–1141 (2013). https://doi.org/10.1007/s11225-012-9433-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-012-9433-8