N. Alechina, M. Mendler, E. Valeria-de-paiva, and . Ritter, Categorical and Kripke semantics for constructive S4 modal logic, 10th CSL, vol.2142, pp.292-307, 2001.

G. Amati and F. Pirri, A uniform tableau method for intuitionistic modal logics I, Studia Logica, vol.53, issue.1, pp.29-60, 1994.

J. Andreoli, Logic programming with focusing proofs in linear logic, Journal of Logic and Computation, vol.2, issue.3, pp.297-347, 1992.

R. Arisaka, A. Das, and L. Straßburger, On nested sequents for constructive modal logic, Logical Methods in Computer Science, 2015.

G. Aucher and F. Schwarzentruber, On the complexity of dynamic epistemic logic, TARK-Theoretical Aspects of Rationality and Knowledge, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00856468

A. Avron, The method of hypersequents in the proof theory of propositional nonclassical logics, Logic: from foundations to applications: European logic colloquium, pp.1-32, 1996.

P. N. Benton, G. M. Bierman, and V. De-paiva, Computational types from a logical perspective, Journal of Functional Programming, vol.8, issue.2, pp.177-193, 1998.

M. Gavin, V. Bierman, and . De-paiva, Intuitionistic necessity revisited, 1996.

M. Gavin, V. Bierman, and . De-paiva, On an intuitionistic modal logic, Studia Logica, vol.65, issue.3, pp.383-416, 2000.

P. Blackburn and J. Van-benthem, Modal logic: a semantic perspective, Handbook of Modal Logic, pp.1-82, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00119856

B. Bolzano, Purely analytic proof of the theorem that between any two values which give results of opposite sign, there lies at least one real root of the equation, Abhandlungen der koniglichen bohmischen Gesellschaft der Wissenschaften, vol.5, pp.225-273, 1817.

T. Braüner, A cut-free Gentzen formulation of the modal logic S5, Logic Journal of IGPL, vol.8, issue.5, pp.629-643, 2000.

T. Brock, -. , and C. Schürmann, Focused natural deduction, LPAR17 : International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol.6397, pp.157-171, 2010.

L. Egbertus and J. Brouwer, Intuitionism and formalism, Philosophy and Foundations of Mathematics, pp.123-138, 1975.

K. Brünnler, Deep sequent systems for modal logic, Archive for Mathematical Logic, vol.48, issue.6, pp.551-577, 2009.

K. Brünnler and L. Straßburger, Modular sequent systems for modal logic, Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX'09, vol.5607, pp.152-166, 2009.

L. Marcos-a-castilho, O. Cerro, A. Gasquet, and . Herzig, Modal tableaux with propagation rules and structural rules, Fundamenta Informaticae, vol.32, issue.3-4, pp.281-297, 1997.

C. Cerrato, Modal sequents, Proof Theory of Modal Logic, vol.2, pp.141-166, 1996.

K. Chaudhuri, Focusing strategies in the sequent calculus of synthetic connectives, LPAR-15 : International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol.5330, pp.467-481, 2008.

K. Chaudhuri, N. Guenot, and L. Straßburger, The focused calculus of structures, Computer Science Logic: 20th Annual Conference of the EACSL, Leibniz International Proceedings in Informatics (LIPIcs), pp.159-173, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00772420

K. Chaudhuri, S. Hetzl, and D. Miller, A multi-focused proof system isomorphic to expansion proofs, Journal of Logic and Computation, vol.26, issue.2, pp.577-603, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00937056

K. Chaudhuri, S. Marin, and L. Straßburger, Focused and synthetic nested sequents, FoSSaCS, International Conference on Foundations of Software Science and Computation Structures, pp.390-407, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01417618

K. Chaudhuri, S. Marin, and L. Straßburger, Modular Focused Proof Systems for Intuitionistic Modal Logics, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016, vol.52, pp.1-16, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01417603

K. Chaudhuri, D. Miller, and A. Saurin, Canonical sequent proofs via multi-focusing, Fifth International Conference on Theoretical Computer Science, vol.273, pp.383-396, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00527893

K. Chaudhuri, F. Pfenning, and G. Price, A logical characterization of forward and backward chaining in the inverse method, Automated Reasoning: Third International Joint Conference, pp.97-111, 2006.

K. Chaudhuri, F. Pfenning, and G. Price, A logical characterization of forward and backward chaining in the inverse method, Journal of Automated Reasoning, vol.40, issue.2-3, pp.133-177, 2008.

. Brian-f-chellas, Modal logic: an introduction, 1980.

Z. Chihani, T. Libal, and G. Reis, The proof certifier checkers, Automated Reasoning with Analytic Tableaux and Related Methods: 24th International Conference, TABLEAUX 2015, pp.201-210, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01208333

Z. Chihani, D. Miller, and F. Renaud, Foundational proof certificates in first-order logic, Conference on Automated Deduction, vol.24, pp.162-177, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00906485

A. Ciabattoni, N. Galatos, and K. Terui, From axioms to analytic rules in nonclassical logics, Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS, pp.229-240, 2008.

A. Ciabattoni and F. A. Genco, Embedding formalisms: hypersequents and two-level systems of rule, Advances in Modal Logic 11, pp.197-216, 2016.

A. Ciabattoni and R. Ramanayake, Structural extensions of display calculi: A general recipe, Logic, Language, Information, and Computation-WoLLIC, vol.8071, pp.81-95, 2013.

A. Ciabattoni, L. Straßburger, and K. Terui, Expanding the realm of systematic proof theory, Computer Science Logic, CSL'09, vol.5771, pp.163-178, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00436420

M. J. Collinson, B. P. Hilken, and D. E. Rydeheard, Semantics and proof theory of an intuitionistic modal sequent calculus, 1999.

B. J. Copeland, The genesis of possible worlds semantics, Journal Philosophical Logic, vol.31, issue.2, pp.99-137, 2002.

P. Curien, Introduction to linear logic and ludics, part I, Advances in Mathematics (China), vol.34, pp.513-544, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00003920

M. Da and P. Nunes-de-medeiros, Investigações acerca de uma versão modal para lógica intermediária dos domínios constantes, Princípios: Revista de Filosofia (UFRN), vol.8, issue.10, pp.121-137, 2010.

R. Dyckhoff and S. Negri, Proof analysis in intermediate logics, Archive for Mathematical Logic, vol.51, issue.1-2, pp.71-92, 2012.

W. B. Ewald, Intuitionistic tense and modal logic, The Journal of Symbolic Logic, vol.51, issue.1, pp.166-179, 1986.

M. Fairtlough and M. Mendler, An intuitionistic modal logic with applications to the formal verification of hardware, Computer Science Logic: 8th Workshop, CSL '94 Kazimierz, pp.354-368, 1994.

M. Fairtlough and M. Mendler, Propositional lax logic. Information and Computation, vol.137, pp.1-33, 1997.

F. B. Fitch, Intuitionistic modal logic with quantifiers, Portugaliae Mathematica, vol.7, issue.2, pp.113-118, 1948.

B. Frederic and . Fitch, Tree proofs in modal logic, Journal of Symbolic Logic, vol.31, issue.1, p.152, 1966.

M. Fitting, Tableau methods of proof for modal logics, Notre Dame Journal of Formal Logic, vol.13, issue.2, pp.237-247, 1972.

M. Fitting, Proof Methods for Modal and Intuitionistic Logics, Synthese Library. D, vol.169, 1983.

M. Fitting, Modal proof theory, Handbook of Modal Logic, pp.85-138, 2007.

M. Fitting, Prefixed tableaus and nested sequents, Annals of Pure and Applied Logic, vol.163, issue.3, pp.291-313, 2012.

M. Fitting, Cut-free proof systems for Geach formulas, The IfCoLog Journal of Logics and their Applications, vol.2, issue.2, pp.17-64, 2015.

M. Josep and . Font, Modality and possibility in some intuitionistic modal logics, Notre Dame Journal of Formal Logic, vol.27, issue.4, pp.533-546, 1986.

G. Frege, Begriffsschrift: eine der arithmetischen nachgebildete Formelsprache des reinen Denkens, p.1879

S. Frittella, Monotone Modal Logic and Friends, 2014.

D. M. Gabbay, Labelled Deductive Systems, 1996.

D. Galmiche and Y. Salhi, Label-free natural deduction systems for intuitionistic and classical modal logics, Journal of Applied Non-Classical Logics, vol.20, issue.4, pp.373-421, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00580296

D. Galmiche and Y. Salhi, Label-free proof systems for intuitionistic modal logic IS5, LPAR-16 : International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol.6355, pp.255-271, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00580298

J. Garson, Modal logic, 2016.

G. Gentzen, Untersuchungen über das logische Schließen. I. Mathematische Zeitschrift, vol.39, pp.176-210, 1934.

G. Gentzen, Untersuchungen über das logische Schließen. II. Mathematische Zeitschrift, vol.39, pp.405-431, 1935.

J. Girard, Proof theory and logical complexity, 1987.

L. F. Goble, Gentzen systems for modal logic, Notre Dame Journal of Formal Logic, vol.15, issue.3, pp.455-461, 1974.

R. Goré, L. Postniece, and A. Tiu, On the correspondence between display postulates and deep inference in nested sequent calculi for tense logics, LMCS, vol.7, issue.2, pp.1-38, 2011.

R. Goré and R. Ramanayake, Labelled tree sequents, tree hypersequents and nested (deep) sequents, Advances in Modal Logic 9, pp.279-299, 2012.

S. Heilala and B. Pientka, Bidirectional decision procedures for the intuitionistic propositional modal logic IS4, International Conference on Automated Deduction, pp.116-131, 2007.

R. Hein, Geometric theories and modal logic in the calculus of structures, 2005.

D. Hilbert, From Frege to Gödel: A Source Book in Mathematical Logic, pp.464-479, 1967.

W. A. Howard, The formulae-as-types notion of construction, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.479-490, 1980.

R. Kashima, Cut-free sequent calculi for some tense logics, Studia Logica, vol.53, issue.1, pp.119-136, 1994.

K. Kojima, Relational and neighborhood semantics for intuitionistic modal logic, Reports on Mathematical Logic, vol.47, p.87, 2012.

M. Kracht, Power and weakness of the modal display calculus, Proof theory of modal logic, pp.93-121, 1996.

S. Kripke, A completeness theorem in modal logic, The Journal of Symbolic Logic, vol.24, issue.1, pp.1-14, 1959.

A. Saul and . Kripke, Semantical analysis of modal logic I: Normal modal propositional calculi, Zeitschrift für mathematische Logik and Grundlagen der Mathematik, vol.9, issue.56, pp.67-96, 1963.

H. Kurokawa, Hypersequent calculi for modal logics extending S4, JSAI International Symposium on Artificial Intelligence, pp.51-68, 2013.

R. Kuznets, S. Marin, and L. Straßburger, Justification logic for constructive modal logic, IMLA 2017-7th Workshop on Intuitionistic Modal Logic and Applications, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01614707

O. Laurent, Étude de la Polarisation en Logique, 2002.

O. Laurent, A proof of the focalization property in linear logic. Unpublished note, 2004.

B. Lellmann, Linear nested sequents, 2-sequents and hypersequents, TABLEAUX: Automated Reasoning with Analytic Tableaux and Related Methods, pp.135-150, 2015.

B. Lellmann, Hypersequent rules with restricted contexts for propositional modal logics, Theoretical Computer Science, vol.656, pp.76-105, 2016.

B. Lellmann and D. Pattinson, Constructing cut free sequent systems with context restrictions based on classical or intuitionistic logic, Logic and Its Applications, 5th Indian Conference, ICLA 2013, pp.148-160, 2013.

B. Lellmann and E. Pimentel, Proof search in nested sequent calculi, LPAR-20 : International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol.9450, pp.558-574, 2015.

E. J. Lemmon, New foundations for Lewis modal systems, Journal of Symbolic Logic, vol.22, issue.2, pp.176-186, 1957.

J. Edward, D. S. Lemmon, and . Scott, An Introduction to Modal Logic, 1977.

C. I. Lewis and C. H. Langford, Symbolic Logic. The Century co, 1932.

C. Liang and D. Miller, Focusing and polarization in intuitionistic logic, CSL 2007: Computer Science Logic, vol.4646, pp.451-465, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00167231

C. Liang and D. Miller, Focusing and polarization in linear, intuitionistic,and classical logics, Theoretical Computer Science, vol.410, issue.46, pp.4747-4768, 2009.

T. Libal and M. Volpe, Certification of prefixed tableau proofs for modal logic, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01379625

P. Maffezioli, A. Naibo, and S. Negri, The Church-Fitch knowability paradox in the light of structural proof theory, Synthese, vol.190, issue.14, pp.2677-2716, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01251230

S. Marin, D. Miller, and M. Volpe, A focused framework for emulating modal proof systems, Advances in Modal Logic 11, pp.469-488, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01379624

S. Marin and L. Straßburger, Label-free modular systems for classical and intuitionistic modal logics, Advances in Modal Logic 10, pp.387-406, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01092148

S. Marin and L. Straßburger, Proof theory for indexed nested sequents, Automated Reasoning with Analytic Tableaux and Related Methods: 26th International Conference, pp.81-97, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01635935

F. Massacci, Strongly analytic tableaux for normal modal logics, International Conference on Automated Deduction, pp.723-737, 1994.

S. Mclaughlin and F. Pfenning, Imogen: Focusing the polarized focused inverse method for intuitionistic propositional logic, LPAR-15 : International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, pp.174-181, 2008.

M. Mendler and V. D. Paiva, Constructive CK for contexts, Proceedings of the first Workshop on Context Representation and Reasoning-CONTEXT05, 2005.

M. Mendler and S. Scheele, Cut-free Gentzen calculus for multimodal CK. Information and Computation, vol.209, 2011.

D. Miller, A proposal for broad spectrum proof certificates, Certified Programs and Proofs-First International Conference, pp.54-69, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00772722

D. Miller, Proofcert: Broad spectrum proof certificates, 2016.

D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, vol.51, pp.125-157, 1991.

D. Miller and M. Volpe, Focused labeled proof systems for modal logic, LPAR-20 : International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol.9450, pp.266-280, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01213858

G. E. Mints, Some calculi of modal logic, Proceedings of the Steklov Institute of Mathematics, vol.98, pp.97-124, 1968.

, Eugenio Moggi. Notions of computation and monads. Information and Computation, vol.93, issue.1, pp.55-92, 1991.

A. Murawska, Intuitionistic modal logic IS5: Formalizations, interpretation, analysis, 2013.

S. Negri, Contraction-free sequent calculi for geometric theories with an application to Barr's theorem. Archive for Mathematical Logic, vol.42, pp.389-401, 2003.

S. Negri, Proof analysis in modal logics, Journal of Philosophical Logic, vol.34, pp.507-544, 2005.

S. Negri, Proof theory for modal logic, Philosophy Compass, vol.6, issue.8, pp.523-538, 2011.

S. Negri, Proof theory for non-normal modal logics: The neighbourhood formalism and basic results, IFCoLog Journal of Logic and its Applications, 2016.

S. Negri and J. Plato, Structural proof theory, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01251230

M. Ohnishi and K. Matsumoto, Gentzen method in modal calculi, Osaka Journal of Mathematics, vol.9, issue.2, pp.113-130, 1957.

M. Ohnishi and K. Matsumoto, Gentzen method in modal calculi II, Osaka Mathematical Journal, vol.11, issue.2, pp.115-120, 1959.

H. Ono, On some intuitionistic modal logics, Publications of the Research Institute for Mathematical Sciences, vol.13, issue.3, pp.687-722, 1977.

H. Ono and N. Suzuki, Relations between intuitionistic modal logics and intermediate predicate logics, Reports on Mathematical Logic, vol.22, pp.65-87, 1988.

F. Pfenning and R. Davies, A judgmental reconstruction of modal logic, Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), vol.11, pp.511-540, 2001.

F. Pfenning and H. Wong, On a modal lambda calculus for S4, Electronic Notes in Theoretical Computer Science, vol.1, pp.515-534, 1995.

D. Gordon, C. P. Plotkin, and . Stirling, A framework for intuitionistic modal logic, 1st Conference on Theoretical Aspects of Reasoning About Knowledge, 1986.

F. Poggiolesi, The method of tree-hypersequents for modal propositional logic, Towards Mathematical Philosophy, vol.28, pp.31-51, 2009.
URL : https://hal.archives-ouvertes.fr/halshs-00775815

G. Pottinger, Uniform cut-free formulations of T, S4 and S5 (abstract), Journal of Symbolic Logic, vol.48, p.900, 1983.

D. Prawitz, Natural Deduction, A Proof-Theoretical Study, Almq. and Wiksell, 1965.

R. Ramanayake, Inducing syntactic cut-elimination for indexed nested sequents, Automated Reasoning-8th International Joint Conference, IJCAR 2016, pp.416-432, 2016.

S. Read, Semantic pollution and syntactic purity, The Review of Symbolic Logic, vol.8, issue.4, pp.649-661, 2015.

J. Reed and F. Pfenning, Focus-preserving embeddings of substructural logics in intuitionistic logic. Draft manuscript, 2010.

G. Restall, Comparing modal sequent systems. Draft manuscript, 2006.

G. Restall, Proofnets for S5: sequents and circuits for modal logic, Logic Colloquium, vol.28, pp.151-172, 2005.

G. Sambin and S. Valentini, The modal logic of provability. The sequential approach, Journal of Philosophical Logic, vol.11, issue.3, pp.311-342, 1982.

M. Sato, A cut-free Gentzen-type system for the modal logic S5, Journal of Symbolic Logic, vol.45, issue.1, pp.67-84, 1980.

R. A. Schmidt, Aiml tools, 2017.

D. Scott, Advice on modal logic, Philosophical Problems in Logic: Some Recent Developments, pp.143-173, 1970.

G. Fischer-servi, Axiomatizations for some intuitionistic modal logics. Rendiconti del Seminario Matematico dell, vol.42, pp.179-194, 1984.

F. Grigori and . Shvarts, Gentzen style systems for K45 and K45D, Logic at Botik '89: Symposium on Logical Foundations of Computer Science, pp.245-256, 1989.

R. J. Simmons, Structural focalization, ACM Transactions on Computational Logic, vol.15, issue.3, 2014.

A. Simpson, The Proof Theory and Semantics of Intuitionistic Modal Logic, 1994.

C. Stewart and P. Stouppa, A systematic proof theory for several modal logics, Advances in Modal Logic 5, pp.309-333, 2004.

C. Stirling, Modal logics for communicating systems, Theoretical Computer Science, vol.49, issue.2, pp.311-347, 1987.

P. Stouppa, The design of modal proof theories: the case of S5, 2004.

L. Straßburger, Cut elimination in nested sequents for intuitionistic modal logics, FoSSaCS'13, vol.7794, pp.209-224, 2013.

N. Suzuki, An algebraic approach to intuitionistic modal logics in connection with intermediate predicate logics, Studia Logica, vol.48, issue.2, pp.141-155, 1989.

A. Sjerp-troelstra and H. Schwichtenberg, Basic proof theory, vol.43, 2000.

L. Viganò, Labelled Non-Classical Logic, 2000.

H. Wansing, Translation of hypersequents into display sequents, Logic Journal of IGPL, vol.6, issue.5, pp.719-734, 1998.

H. Wansing, Sequent systems for modal logics, Handbook of Philosophical Logic, vol.8, pp.61-145, 2002.

D. Wijesekera, Constructive modal logics I, Annals of Pure and Applied Logic, vol.50, issue.3, pp.271-301, 1990.

D. Wijesekera and A. Nerode, Tableaux for constructive concurrent dynamic logic, Annals of Pure and Applied Logic, vol.135, issue.1-3, pp.1-72, 2005.

N. Zeilberger, Focusing and higher-order abstract syntax, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.359-369, 2008.