( en | de | ru )

 

Disambiguation of "Demri, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
A Completeness Proof for a Logic with an Alternative Necessity Operator.

. Stud Logica, 58 (1): 99-112 (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stéphane Klein

Stéphane Müller

Stéphane Haussler

Stéphane Clinchant

Stéphane Aubry

 

Other publications of authors with the same name

The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic., , and . ACM Trans. Comput. Log., 22 (2): 14:1-14:56 (2021)An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic., and . FTP (LNCS Selection), volume 1761 of Lecture Notes in Computer Science, page 152-166. Springer, (1998)The Nondeterministic Information Logic NIL is PSPACE-complete.. Fundam. Informaticae, 42 (3-4): 211-234 (2000)On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II., and . Stud Logica, 66 (3): 349-384 (2000)The Complexity of Regularity in Grammar Logics and Related Modal Logics.. J. Log. Comput., 11 (6): 933-960 (2001)Relative Similarity Logics are Decidable: Reduction to FO$^2$ with Equality, and . JELIA, page 279-293. (1998)The Effects of Adding Reachability Predicates in Propositional Separation Logic., , and . FoSSaCS, volume 10803 of Lecture Notes in Computer Science, page 476-493. Springer, (2018)Towards a Model-Checker for Counter Systems., , , and . ATVA, volume 4218 of Lecture Notes in Computer Science, page 493-507. Springer, (2006)Cut-Free Display Calculi for Nominal Tense Logics., and . TABLEAUX, volume 1617 of Lecture Notes in Computer Science, page 155-170. Springer, (1999)Complexity of Simple Dependent Bimodal Logics.. TABLEAUX, volume 1847 of Lecture Notes in Computer Science, page 190-204. Springer, (2000)