Realization Theorems for Justification Logics: Full Modularity

  title={Realization Theorems for Justification Logics: Full Modularity},
  author={Annemarie Borg and Roman Kuznets},
  • A. Borg, R. Kuznets
  • Published in TABLEAUX 21 September 2015
  • Philosophy, Computer Science
Justification logics were introduced by Artemov ini¾ź1995 to provide intuitionistic logic with a classical provability semantics, a problem originally posed by Godel. Justification logics are refinements of modal logics and formally connected to them by so-called realization theorems. A constructive proof of a realization theorem typically relies on a cut-free sequent-style proof system for the corresponding modal logic. A uniform realization theorem for all the modal logics of the so-called… 
4 Citations
Reduction of Modal Logic and Realization in Justification Logic
This paper utilizes the standard cut-free sequent calculus for K to show how to recover the realizations of the modal axioms by rewriting terms in the proof, and offers a new, simple, uniform, and modular proof-theoretical proof of the realization of a wide range of modal logics with possible combinations of modals.
Labeled sequent calculus for justification logics
  • Meghdad Ghari
  • Philosophy, Computer Science
    Ann. Pure Appl. Log.
  • 2017
Modal logics Formulas of modal logic are constructed by the following grammar
Article history: Received 11 April 2015 Received in revised form 4 April 2016 Accepted 4 August 2016 Available online xxxx MSC: 03B45 03B60 03B62 03F05


Realization for justification logics via nested sequents: Modularity through embedding
Realization using the model existence theorem
This paper uses the familiar machinery of consistency properties to prove a weak version of Realization and shows how to convert Quasi-Realizations into Realizations proper, which can be extended to other standard systems.
Does the deduction theorem fail for modal logic?
It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system, and a necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation.
Explicit provability and constructive semantics
This paper finds the logic LP of propositions and proofs and shows that Godel's provability calculus is nothing but the forgetful projection of LP, which achievesGodel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which resisted formalization since the early 1930s.
Deep sequent systems for modal logic
A systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5, which stay very close to Gentzen’s sequent calculus.
Making knowledge explicit: How hard it is
Self-referentiality of Brouwer-Heyting-Kolmogorov semantics
  • Junhua Yu
  • Philosophy, Computer Science
    Ann. Pure Appl. Log.
  • 2014
Nested Sequents for Intuitionistic Logics
It is noteworthy that the resulting system for constant domain intuitionistic logic is particularly simple, which amounts to a combination of intuitionistic propositional rules and classical quantifier rules, a combination that is known to be inadequate when conventional intuitionistic sequent systems are used.
On Nested Sequents for Constructive Modal Logics
We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This
Modal interpolation via nested sequents