Interpolation and Beth Definability over the Minimal Logic
暂无分享,去创建一个
Extensions of the Johansson minimal logic J are investigated. It is proved that the weak interpolation property WIP is decidable over J. Well-composed logics with the Graig interpolation property CIP, restricted interpolation property IPR and projective Beth property PBP are fully described. It is proved that there are only finitely many well-composed logics with CIP, IPR or PBP; for any well-composed logic PBP is equivalent to IPR, and all the properties CIP, IPR and PBP are decidable on the class of well-composed logics..
[1] Larisa Maksimova,et al. Problem of restricted interpolation in superintuitionistic and some modal logics , 2010, Log. J. IGPL.
[2] D. Gabbay,et al. Interpolation and Definability: Modal and Intuitionistic Logic , 2005 .
[3] L. L. Maksimova,et al. Decidability of the weak interpolation property over the minimal logic , 2011 .
[5] L. Maksimova. Interpolation and Definability in Extensions of the Minimal Logic , 2005 .