Abstract
AbstractWe present a general approach to quantified modal logics that can simulate most other approaches. The language is based on operators indexed by terms which allow to express de re modalities and to control the interaction of modalities with the first-order machinery and with non-rigid designators. The semantics is based on a primitive counterpart relation holding between n-tuples of objects inhabiting possible worlds. This allows an object to be represented by one, many, or no object in an accessible world. Moreover by taking as primitive a relation between n-tuples we avoid some shortcoming of standard individual counterparts. Finally, we use cut-free labelled sequent calculi to give a proof-theoretic characterisation of the quantified extensions of each first-order definable propositional modal logic. In this way we show how to complete many axiomatically incomplete quantified modal logics.
Funder
Alma Mater Studiorum - Università di Bologna
Publisher
Springer Science and Business Media LLC
Reference39 articles.
1. Bauer, S., & Wansing, H. (2002). Consequence, counterparts and substitution. The Monist, 85, 483–497.
2. Belardinelli, F. (2007). Counterpart semantics for quantified modal logics. In The Logica Yearbook 2006. Filosofia, Prague
3. Belardinelli, F. (2022). Counterpart semantics at work: Independence and incompleteness in quantified modal logics (p. 2022). Springer, Cham: In Thinking and calculating.
4. van Benthem, J. (2010). Frame correspondences in modal predicate logic. In Proofs, Categories and Computations: Essays in Honor of Grigori Mints. College Publications, London.
5. Blackburn, P., de Rijke, M., & Venema, Y. (2001). Modal Logic. Cambridge University Press.