Switch to: References

Citations of:

Non-Well-Founded Proofs for the Grzegorczyk Modal Logic

Yury Savateev & Daniyar Shamkanov

Review of Symbolic Logic 14 (1):22-50 (2021)

Add citations

You must login to add citations.

Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.details -/- Provability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. -/- From a philosophical point of view, provability logic is interesting because (...) Download Export citation Bookmark 4 citations
A Sound Interpretation of Leśniewski's Epsilon in Modal Logic KTB.Takao Inoue - 2021 - Bulletin of the Section of Logic 50 (4):455-463.details In this paper, we shall show that the following translation \(I^M\) from the propositional fragment \(\bf L_1\) of Leśniewski's ontology to modal logic \(\bf KTB\) is sound: for any formula \(\phi\) and \(\psi\) of \(\bf L_1\), it is defined as (M1) \(I^M(\phi \vee \psi) = I^M(\phi) \vee I^M(\psi)\), (M2) \(I^M(\neg \phi) = \neg I^M(\phi)\), (M3) \(I^M(\epsilon ab) = \Diamond p_a \supset p_a. \wedge. \Box p_a \supset \Box p_b.\wedge. \Diamond p_b \supset p_a\), where \(p_a\) and \(p_b\) are propositional variables corresponding to (...) Download Export citation Bookmark

1