A Road-Map on Complexity for Hybrid Logics, Computer Science Logic, number 1683 in Lecture Notes in Computer Science (LNCS), pp.307-321, 1999. ,
DOI : 10.1007/3-540-48168-0_22
URL : https://hal.archives-ouvertes.fr/inria-00000337
Hybrid Logics, Handbook of Modal Logics, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00549320
Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics, Logic Journal of IGPL, vol.7, issue.4, pp.447-480, 1999. ,
DOI : 10.1093/jigpal/7.4.447
The method of hypersequents in the proof theory of propositional non-classical logics, Logic : from foundations to applications, pp.1-32, 1996. ,
A Tableau System for Gödel-Dummett Logic based on a Hypersequent Calculus, International Conference on Analytic Tableaux and Related Methods, pp.98-111, 2000. ,
Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic, 31st IEEE International Symposium on Multiple-Valued Logic, ISMVL'01, pp.181-186, 2001. ,
Analytic Calculi for Projective Logics, International Conference on Analytic Tableaux and Related Methods, TABLEAUX'99, pp.36-50, 1999. ,
DOI : 10.1007/3-540-48754-9_8
Foundations of Constructive Mathematics : Metamathematical Studies, 1985. ,
DOI : 10.1007/978-3-642-68952-9
Extended Curry-Howard Correspondence for a Basic Constructive Modal Logic, Workshop of Methods for Modalities 2, 2001. ,
Display logic, Journal of Philosophical Logic, vol.11, issue.4, pp.2375-417, 1982. ,
DOI : 10.1007/BF00284976
A Constructive Presentation for the Modal Connective of Necessity (???), Journal of Logic and Computation, vol.2, issue.1, pp.31-50, 1992. ,
DOI : 10.1093/logcom/2.1.31
Intuitionistic Necessity Revisited, Proceedings of Applied Logic Conference, 1992. ,
On an Intuitionistic Modal Logic, Studia Logica, vol.65, issue.3, pp.383-416, 2000. ,
DOI : 10.1023/A:1005291931660
A note on full intuitionistic linear logic, Annals of Pure and Applied Logic, vol.79, issue.3, pp.281-287, 1996. ,
DOI : 10.1016/0168-0072(96)00004-8
A modal linear logic for distribution and mobility, Workshop on Linear Logic, WLL'02, 2002. ,
URL : https://hal.archives-ouvertes.fr/inria-00100792
Internalizing labelled deduction, Journal of Logic and Computation, vol.10, issue.1, pp.137-168, 2000. ,
DOI : 10.1093/logcom/10.1.137
URL : http://turing.wins.uva.nl/~carlos/hybrid/Papers/blackburn.Internalizing.ps.Z
Modal Logic, 2001. ,
DOI : 10.1017/CBO9781107050884
URL : https://hal.archives-ouvertes.fr/inria-00100503
Terminating Tableau Calculi for Hybrid Logics Extending K, Electronic Notes in Theoretical Computer Science, vol.231, 2007. ,
DOI : 10.1016/j.entcs.2009.02.027
URL : https://doi.org/10.1016/j.entcs.2009.02.027
A cut-free Gentzen formulation of the modal logic S5, Logic Journal of IGPL, vol.8, issue.5, pp.629-643, 2000. ,
DOI : 10.1093/jigpal/8.5.629
A formulation of linear logic based on dependency-relations, Computer Science Logic, CSL'97, pp.129-148, 1997. ,
DOI : 10.1007/BFb0028011
Intuitionistic hybrid logic, Journal of Applied Logic, vol.4, issue.3, pp.231-255, 2006. ,
DOI : 10.1016/j.jal.2005.06.009
Deep sequent systems for modal logic, Archive for Mathematical Logic, vol.85, issue.2, pp.551-577, 2009. ,
DOI : 10.1007/978-94-010-0387-2_2
Modular Sequent Systems for Modal Logic, International Conference on Analytic Tableaux and Related Methods, TABLEAUX'09, pp.152-166, 2009. ,
DOI : 10.1007/978-3-642-02716-1_12
A modal extension of intuitionist logic., Notre Dame Journal of Formal Logic, vol.6, issue.2, pp.142-145, 1965. ,
DOI : 10.1305/ndjfl/1093958154
MIPC as the formalisation of an intuitionist concept of modality, The Journal of Symbolic Logic, vol.24, issue.04, pp.609-616, 1966. ,
DOI : 10.1305/ndjfl/1093958154
CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT, Mathematische Logik und Grundlagen der Mathematik, pp.85-100, 1992. ,
DOI : 10.1007/978-3-7091-7664-1
Basic Modal Logic, Handbook of Philosophical Logic, pp.1-88, 1984. ,
Standard G??del Modal Logics, Studia Logica, vol.58, issue.3, pp.189-214, 2010. ,
DOI : 10.1007/s11225-010-9230-1
A Hybrid Intuitionistic Logic: Semantics and Decidability, Journal of Logic and Computation, vol.16, issue.1, pp.27-59, 2006. ,
DOI : 10.1093/logcom/exi071
Modal Logic, 1996. ,
Modal Logic, 1980. ,
DOI : 10.1017/CBO9780511621192
Logiques modales et bases de données, Journal Techniques et Sciences Informatiques, vol.17, issue.3, pp.329-354, 1998. ,
Peled. Model Checking, 1999. ,
Semantics and Proof Theory of an Intuitionistic Modal Sequent Calculus, 1999. ,
A new S4 classical modal logic in natural deduction, Journal of Symbolic Logic, vol.71, issue.3, pp.799-809, 2006. ,
Constraint logic programming in the sequent calculus, International Conference on Logic Programming and Automated Reasoning, LPAR'94, pp.200-214, 1994. ,
DOI : 10.1007/3-540-58216-9_39
A modal analysis of staged computation, Journal of the ACM, vol.48, issue.3, pp.555-604, 2001. ,
DOI : 10.1145/382780.382785
Specification and Verification using Temporal Logics, Modern applications of automata theory, IISc Research Monographs, 2010. ,
DOI : 10.1142/9789814271059_0015
URL : https://hal.archives-ouvertes.fr/hal-00776601
Complexity of modal logics with Presburger constraints, Journal of Applied Logic, vol.8, issue.3, pp.233-252, 2010. ,
DOI : 10.1016/j.jal.2010.03.001
Proving termination with multiset orderings, International Colloquium on Automata, Languages and Programming, ICALP'79, pp.188-202, 1979. ,
DOI : 10.1007/3-540-09510-1_15
URL : http://www.math.tau.ac.il/~nachumd/papers/LNCS/Multisets.pdf
Higher-level sequent-systems for intuitionistic modal logic, pp.3-12, 1986. ,
Mathematical Intuitionism : Introduction to Proof Theory. Translation of Mathematical Monographs, 1988. ,
A propositional calculus with denumerable matrix, The Journal of Symbolic Logic, vol.13, issue.02, pp.96-107, 1959. ,
DOI : 10.1090/S0002-9947-1953-0055952-4
Elements of Intuitionism, 1977. ,
Contraction-free sequent calculi for intuitionistic logic, The Journal of Symbolic Logic, vol.475, issue.03, pp.795-807, 1992. ,
DOI : 10.1007/3-540-54487-9_58
Dragalin's proofs of cut-admissibility for the intuitionistic sequent calculi G3i and G3i, School of Mathematical and Computational Sciences, 1997. ,
Time, Modality and Intuitionism, 1978. ,
An intuitionistic modal logic with applications to the formal verification of hardware, 8th International Workshop on Computer Science Logic, CSL'94, pp.354-368, 1995. ,
DOI : 10.1007/BFb0022268
On modal logic with an intuitionistic base, Studia Logica, vol.31, issue.No. 2, pp.141-149, 1977. ,
DOI : 10.1007/BF02121259
The finite model property for ${\bf MIPQ}$ and some consequences., Notre Dame Journal of Formal Logic, vol.19, issue.4, pp.687-692, 1978. ,
DOI : 10.1305/ndjfl/1093888520
Semantics for a class of intuitionistic modal calculi. Italian Studies in the Philosophy of Science, pp.59-72, 1981. ,
Axiomatizations for some intuitionistic modal logics, Rend. Sem. Mat. Univers. Politecn. Torino, vol.42, pp.179-194, 1984. ,
Intuitionistic modal logic with quantifiers, Portugaliae Mathematicae, vol.7, pp.113-118, 1948. ,
Symbolic Logic, An Introduction, American Journal of Physics, vol.21, issue.3, 1952. ,
DOI : 10.1119/1.1933410
Natural deduction rules for obligation, American Philosophical Quarterly, vol.3, pp.27-38, 1966. ,
DOI : 10.1007/bf00366999
Proof methods for modal and intuitionistic logics, 1983. ,
DOI : 10.1007/978-94-017-2794-5
Many-valued modal logics, Fundamenta Informaticae, vol.15, issue.3-4, pp.235-254, 1991. ,
Many-valued modal logics II, Fundamenta Informaticae, vol.17, pp.55-73, 1992. ,
Modality and possibility in some intuitionistic modal logics., Notre Dame Journal of Formal Logic, vol.27, issue.4, pp.533-546, 1986. ,
DOI : 10.1305/ndjfl/1093636766
Labelled Deductive Systems, 1996. ,
DOI : 10.1016/S1874-5075(03)80014-1
Constructive logics Part I: A tutorial on proof systems and typed ??-calculi, Theoretical Computer Science, vol.110, issue.2, pp.249-339, 1993. ,
DOI : 10.1016/0304-3975(93)90011-H
Provability and Countermodels in Gödel-Dummett Logics, 4th International Workshop on Disproving, 2007. ,
The semantics of BI and resource tableaux, Mathematical Structures in Computer Science, vol.15, issue.06, pp.1033-1088, 2005. ,
DOI : 10.1017/S0960129505004858
URL : https://hal.archives-ouvertes.fr/hal-00076735
Calculi for an Intuitionistic Hybrid Modal Logic, International Workshop on Intuitionistic Modal Logic and Applications, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00580306
Labelled Calculi for ??ukasiewicz Logics, Workshop on Logic, Language, Information and Computation, WoLLIC'08, pp.194-207, 2008. ,
DOI : 10.1007/978-3-540-69937-8_17
URL : http://www.loria.fr/~galmiche/=papers/Wollic08.pdf.gz
A Family of Gödel hybrid logics, Journal of Applied Logic, 2010. ,
Label-Free Proof Systems for Intuitionistic Modal Logic IS5, Int Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2010, pp.255-271, 2010. ,
DOI : 10.1305/ndjfl/1093888520
URL : https://hal.archives-ouvertes.fr/hal-00580298
Proof-search in intuitionistic hybrid logic. submitted to, Journal of Information and Computation, 2010. ,
From Classical to Normal Modal Logics, Proof Theory of Modal Logic, pp.293-311, 1996. ,
DOI : 10.1007/978-94-017-2798-3_15
Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210405, 1935. ,
DOI : 10.1007/BF01201353
Investigation into Logical Deduction The Collected Papers of Gehard Gentzen, pp.68-131, 1969. ,
Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987. ,
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966
Proofs and Types Linear Logic : its Syntax and Semantics, Advances in Linear Logic, pp.1-42, 1989. ,
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic. CoRR, abs/1006, 2010. ,
A system of interaction and structure, ACM Transactions on Computational Logic, vol.8, issue.1, pp.1-64, 2007. ,
DOI : 10.1145/1182613.1182614
URL : https://hal.archives-ouvertes.fr/inria-00441214
Making fuzzy description logic more general. Fuzzy Sets and Systems, pp.1-15, 2005. ,
Metamathematics of Fuzzy Logic, 1998. ,
DOI : 10.1007/978-94-011-5300-3
Many-valued hybrid logic, Advances in Modal Logic, pp.111-132, 2008. ,
DOI : 10.1016/j.entcs.2011.06.011
Modal Probability, Belief, and Actions, Fundamenta Informaticae, vol.57, issue.2- 4, pp.323-344, 2003. ,
DOI : 10.1007/978-3-540-45062-7_5
The formulas-as-types notion of construction, To H. B. Curry : Essays on Combinatory Logic, Lambda Calculus, and Formalism, pp.479-490, 1980. ,
Modal Proofs as Distributed Programs (Extended Abstract), European Symposium on Programming, ESOP, volume 2986 of Lecture Notes in Computer Science (LNCS), pp.219-233, 2004. ,
Cut-free sequent calculi for some tense logics, Studia Logica, vol.13, issue.1, pp.119-136, 1994. ,
DOI : 10.1007/BF01053026
Introduction to Metamathematics, 1952. ,
Semantical Analysis of Modal Logic II. Non-Normal Modal Propositional Calculi The Theory of Models, 1965. ,
Lambda-calcul, types et modèles, 1990. ,
Preuves, réfutations et contre-modèles dans des logiques intuitionnistes, 2000. ,
Combining proof-search and countermodel construction for deciding Gödel-Dummett logic, 18th International Conference on Automated Deduction, pp.94-110, 2002. ,
Counter-model search in Gödel-Dummett logics, 2nd International Joint Conference IJCAR 2004, pp.274-288, 2004. ,
Bounding Resource Consumption with Gödel-Dummett Logics, International Conference on Logic for Programming, Artificial Intelligence, and Reasoning , LPAR'05, pp.682-696, 2005. ,
DOI : 10.1007/11591191_47
Graph-based Decision for G??del-Dummett Logics, Journal of Automated Reasoning, vol.9, issue.1, pp.201-225, 2007. ,
DOI : 10.1007/978-94-011-5300-3
Introducing Attempt in a Modal Logic of Intentional Action, 10th European Conference, pp.280-292, 2006. ,
DOI : 10.1007/11853886_24
Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions, Proceedings of the Second Scandinavian Logic Symposium, pp.179-216, 1971. ,
DOI : 10.1016/S0049-237X(08)70847-4
3 Complexity of modal logic, Handbook of Modal Logic of Studies in Logic and Practical Reasoning, pp.139-179, 2007. ,
DOI : 10.1016/S1570-2464(07)80006-1
2-Sequent calculus: a proof theory of modalities, Annals of Pure and Applied Logic, vol.58, issue.3, pp.229-246, 1992. ,
DOI : 10.1016/0168-0072(92)90029-Y
2-Sequent Calculus: Intuitionism and Natural Deduction, Journal of Logic and Computation, vol.3, issue.5, pp.533-562, 1993. ,
DOI : 10.1093/logcom/3.5.533
Proof Systems for a G??del Modal Logic, International Conference on Analytic Tableaux and Related Methods, TABLEAUX'09, pp.265-279, 2009. ,
DOI : 10.1007/978-3-642-02716-1_20
URL : http://sitemason.vanderbilt.edu/files/gZKekM/MOtableaux.pdf
Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.125-157, 1991. ,
DOI : 10.1016/0168-0072(91)90068-W
Indexed systems of sequents and cut-elimination, Journal of Philosophical Logic, vol.4, issue.2, pp.671-696, 1997. ,
DOI : 10.1093/logcom/4.2.125
A symmetric modal lambda calculus for distributed computing, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.286-295, 2004. ,
DOI : 10.1109/LICS.2004.1319623
Proof Analysis in Modal Logic, Journal of Philosophical Logic, vol.12, issue.5-6, pp.507-534, 2005. ,
DOI : 10.1007/3-540-51237-3_20
Programming in Martin-Löf 's Type Theory : An Introduction, Monographs on Computer Science, vol.7, 1990. ,
On some intuitionistic modal logics. Publications of the Research Institute for, Mathematical Science, vol.13, pp.55-67, 1977. ,
DOI : 10.2977/prims/1195189604
URL : http://www.ems-ph.org/journals/show_pdf.php?issn=0034-5318&vol=13&iss=3&rank=5
Relations between intuitionistic modal logics and intermediate predicate logics, Reports on Mathematical Logic, vol.22, pp.65-87, 1988. ,
Loop-free construction of counter-models in intuitionistic propositional logic, symposia Gaussiana, pp.225-232, 1995. ,
DOI : 10.1515/9783110886726.225
A Framework for Intuitionistic Modal Logics, Theoretical aspects of reasoning about knowledge, pp.399-406, 1986. ,
DOI : 10.1016/B978-0-934613-04-0.50032-6
A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5, The Review of Symbolic Logic, vol.1, issue.01, pp.3-15, 2008. ,
DOI : 10.1017/S1755020308080040
URL : https://hal.archives-ouvertes.fr/halshs-00775809
The Method of Tree-Hypersequents for??Modal??Propositional??Logic, Towards Mathematical Philosophy110] D. Prawitz. Natural Deduction : A Proof-Theoretical Study. Almquist and Wiksell, pp.31-51, 1965. ,
DOI : 10.1007/978-1-4020-9084-4_3
URL : https://hal.archives-ouvertes.fr/halshs-00775815
MANY-VALUED MODAL LOGICS: A SIMPLE APPROACH, The Review of Symbolic Logic, vol.33, issue.02, pp.190-203, 2008. ,
DOI : 10.1007/BF01053032
Time and Modality, 1957. ,
A Calculus and logic of resources and processes, Formal Aspects of Computing, vol.6, issue.5, pp.495-517, 2006. ,
DOI : 10.1007/978-1-4757-3550-5
The Semantics and Proof Theory of the Logic of Bunched Implications, volume 26 of Applied Logic Series, 2002. ,
Gentzen style systems for K45 and K45D, Logic at Botik'89, pp.245-256, 1989. ,
DOI : 10.1007/3-540-51237-3_20
Fitch-style rules for many modal logics., Notre Dame Journal of Formal Logic, vol.18, issue.4, pp.631-636, 1977. ,
DOI : 10.1305/ndjfl/1093888133
The proof theory and semantics of intuitionistic modal logic, 1994. ,
Modal logics for communicating systems, Theoretical Computer Science, vol.49, issue.2-3, pp.311-347, 1987. ,
DOI : 10.1016/0304-3975(87)90012-0
URL : https://doi.org/10.1016/0304-3975(87)90012-0
Basic Proof Theory, volume 43 of Cambridge Tracts in Theoretical Computer Science, 1996. ,
Modal Logic and Classical Logic, Bibliopolis, 1985. ,
Displaying Modal Logic, 1998. ,
DOI : 10.1007/978-94-017-1280-4
Sequent Systems for Modal Logics, Handbook of Philosophical Logic, pp.61-145, 2002. ,
DOI : 10.1007/978-94-010-0387-2_2
URL : http://arp.anu.edu.au/%7Ejeremy/pubs/cutelim/Wansingc.pdf
Decision Procedures for Intuitionistic Propositional Logic by Program Extraction, International Conference on Analytic Tableaux and Related Methods, TABLEAUX'98, pp.292-306, 1998. ,
DOI : 10.1007/3-540-69778-0_29
Formal methods, ACM Computing Surveys, vol.41, issue.4, pp.1-36, 2009. ,
DOI : 10.1145/1592434.1592436