RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Video Library
Archive
Most viewed videos

Search
RSS
New in collection





You may need the following programs to see the files






Workshop on Proof Theory, Modal Logic and Reflection Principles
October 20, 2017 15:00, Moscow, Steklov Mathematical Institute
 


$\mathrm{FDE}$-Modalities and weak definability (joint work with H. Wansing)

S. Odintsov
Video records:
MP4 1,080.4 Mb
MP4 296.0 Mb

Number of views:
This page:34
Video files:13

S. Odintsov


Видео не загружается в Ваш браузер:
  1. Установите Adobe Flash Player    

  2. Проверьте с Вашим администратором, что из Вашей сети разрешены исходящие соединения на порт 8080
  3. Сообщите администратору портала о данной ошибке

Abstract: The goal of this talk is to compare various modal logics based on Belnap and Dunn's paraconsistent four-valued logic $\mathrm{FDE}$. One of such logics is the modal logic $\mathrm{BK}$ defined by S. Odintsov and H. Wansing in 2010. Its extension $\mathrm{BS4}$ (a natural counterpart of $\mathrm{S4}$) relates to the paraconsistent Nelson's logic $\mathrm{N4}^\perp$ in the same way as $\mathrm{S4}$ relates to intuitionistic logic. Other versons of FDE-based modal logics are the paraconsistent modal logic $\mathrm{KN4}$ by L. Goble whose non-modal base coincides with R. Brady's $\mathrm{BD4}$ and the modal bilattice logic $\mathrm{MBL}$ introduced and investigated by A. Jung, U. Rivieccio, and R. Jansana. $\mathrm{MBL}$ is a generalization of $\mathrm{BK}$ that in its Kripke semantics makes use of a four-valued accessibility relation. On the way from $\mathrm{BK}$ to $\mathrm{MBL}$, the Fischer Servi–style modal logic $\mathrm{BK^{FS}}$ is defined as the set of all modal formulas valid under a modified standard translation into first-order $\mathrm{FDE}$. To compare the expressive power of these logics having the strong negation $\sim$ in the language we must weaken the notion of definitional equivalence in a suitable way. It is proved, e.g., that $\mathrm{BK^{FS}}$ is weakly definitionally equivalent to $\mathrm{BK\times BK}$ and that $\mathrm{MBL}$ is faithfully embedded into $\mathrm{BK\times BK}$ via a weakly structural translation.

Language: English

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017