A. Avron, On modal systems having arithmetical interpretations, The Journal of Symbolic Logic, vol.16, issue.03, pp.935-94210, 1984.
DOI : 10.1007/BF00370323

A. Avron, Hypersequents, logical consequence and intermediate logics for concurrency, Annals of Mathematics and Artificial Intelligence, vol.7, issue.3-4, pp.3-4225, 1991.
DOI : 10.1017/S0022481200125848

A. Baelde, S. Lick, and . Schmitz, A hypersequent calculus with clusters for linear frames, Proc. AiML 2018. College Publications, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01756126

D. Baelde, S. Lunel, and S. Schmitz, A sequent calculus for a modal logic on finite data trees, Proc. CSL 2016 of Leibniz International Proceedings in Informatics, pp.1-32
URL : https://hal.archives-ouvertes.fr/hal-01191172

D. Nuel and . Belnap, Display logic, Journal of Philosophical Logic, vol.11, issue.4, pp.375-417, 1982.

P. Blackburn, Y. Marteen-de-rijke, and . Venema, Modal Logic, volume 53 of Cambridge Tracts in Theoretical Computer Science, 2001.

K. Brünnler, Deep sequent systems for modal logic Archiv für Mathematische Logik und Grundlagenforschung, pp.551-57710, 2009.

V. Bruyère and O. Carton, Automata on linear orderings, Journal of Computer and System Sciences, vol.73, issue.1, pp.1-24, 2007.
DOI : 10.1016/j.jcss.2006.10.009

B. Nino and . Cocchiarella, Tense and Modal Logic: a Study in the Topology of Temporal Reference, 1965.

J. Cristau, Automata and temporal logic over arbitrary linear time, Proc. FSTTCS 2009 of Leibniz International Proceedings in Informatics, pp.133-144
URL : https://hal.archives-ouvertes.fr/hal-00553818

A. Das and D. Pous, A Cut-Free Cyclic Proof System for Kleene Algebra, Proc. Tableaux 2017, pp.261-277
DOI : 10.4204/EPTCS.161.7
URL : https://hal.archives-ouvertes.fr/hal-01558132

. Springer, , pp.10-1007, 2017.

S. Demri and A. Rabinovich, The complexity of linear-time temporal logic over the class of ordinals, Logical Methods in Computer Science, vol.4, issue.2, pp.10-2168, 2010.
DOI : 10.1016/S0022-0000(70)80006-X

M. Y. 13-kousha-etessami, T. Vardi, and . Wilke, First-Order Logic with Two Variables and Unary Temporal Logic, Information and Computation, vol.179, issue.2, pp.279-295, 2002.
DOI : 10.1006/inco.2001.2953

A. Indrzejczak, Cut-free hypersequent calculus for S4.3. Bulletin of the Section of Logic, pp.89-104, 2012.

A. Indrzejczak, Linear time in hypersequent framework Bulletin of Symbolic Logic, pp.121-144

A. Indrzejczak, Cut elimination theorem for non-commutative hypersequent calculus Bulletin of the Section of Logic, pp.135-149

M. Kanovich, The multiplicative fragment of linear logic is NP-complete, 1991.

M. Kracht, Power and Weakness of the Modal Display Calculus, Proof Theory of Modal Logic, pp.93-121, 1996.
DOI : 10.1007/978-94-017-2798-3_7

N. 19-françois-laroussinie, P. Markey, and . Schnoebelen, Temporal logic with forgettable past, Proc. LICS 2002, 2002.

B. Lellmann, Linear Nested Sequents, 2-Sequents and Hypersequents, Proc. Tableaux 2015, pp.135-150, 2015.
DOI : 10.1007/978-94-010-0387-2_2

, A Hypersequent Calculus with Clusters for Tense Logic over Ordinals 21 Orna Lichtenstein, Amir Pnueli, and Lenore D. Zuck. The glory of the past, Proc

, Workshop on Logics of Programs, pp.196-218, 1985.

P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar, Decision problems for propositional linear logic, Annals of Pure and Applied Logic, vol.56, issue.1-3, pp.239-31110, 1992.
DOI : 10.1016/0168-0072(92)90075-B

S. Negri, Proof Analysis in Modal Logic, Journal of Philosophical Logic, vol.12, issue.5-6, pp.507-544, 2005.
DOI : 10.1007/3-540-51237-3_20

H. Ono and A. Nakamura, On the size of refutation Kripke models for some linear modal and tense logics, Studia Logica, vol.6, issue.4, pp.325-33310, 1980.
DOI : 10.1007/BF00713542

M. Otto, Abstract, The Journal of Symbolic Logic, vol.27, issue.02, pp.685-70210, 2001.
DOI : 10.1007/s001530050130

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

F. Poggiolesi, The Method of Tree-Hypersequents for??Modal??Propositional??Logic
DOI : 10.1007/978-1-4020-9084-4_3
URL : https://hal.archives-ouvertes.fr/halshs-00775815

, Proc. Trends in Logic IV of Trends in Logic, pp.31-51, 2009.

N. Arthur and . Prior, Time and Modality, 1957.

A. Rabinovich, Temporal logics over linear time domains are in PSPACE Information and Computation, pp.40-67

S. Gareth and . Rohde, Alternating Automata and the Temporal Logic of Ordinals, 1997.

P. Sistla and E. M. Clarke, The complexity of propositional linear temporal logics, Journal of the ACM, vol.32, issue.3, pp.733-749, 1985.
DOI : 10.1145/3828.3837

P. Sistla and L. D. Zuck, Reasoning in a restricted temporal logic. Information and Computation, pp.167-195, 1993.

Y. Moshe, P. Vardi, and . Wolper, An automata-theoretic approach to automatic program verification, LICS 1986, pp.322-331, 1986.