In this thesis we study various properties of formalised relativised interpretability. In the central part of this thesis we study for different interpretability logics the following aspects: completeness for modal semantics, decidability and algorithmic complexity. We prove that a certain series of principles is arithmetically sound, and give new proofs for some already known results.
© 2001-2026 Fundación Dialnet · Todos los derechos reservados