( en | de | ru )

 

Disambiguation of "Hella, Lauri"

Author of the publication

copydeleteadd this publication to your clipboard
Modal Inclusion Logic: Being Lax is Simpler than Being Strict.

, , , and . MFCS (1), volume 9234 of Lecture Notes in Computer Science, page 281-292. Springer, (2015)

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.

Bryan Hellack

Bryan Hellack

Lauri Sarparanta

Andrea Lauri

Jaan Hellat

 

Other publications of authors with the same name

Capturing Relativized Complexity Classes without Order., , and . Math. Log. Q., (1998)Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics., , , and . ACM Trans. Comput. Log., 21 (1): 7:1-7:18 (2020)A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value., and . CoRR, (2021)The expressive Power of Finitely Many Generalized Quantifiers., and . Inf. Comput., 123 (2): 172-184 (1995)Implicit Definability and Infinitary Logic in Finite Model Theory., , and . ICALP, volume 944 of Lecture Notes in Computer Science, page 624-635. Springer, (1995)Complexity Thresholds in Inclusion Logic., and . WoLLIC, volume 11541 of Lecture Notes in Computer Science, page 301-322. Springer, (2019)The Expressive Power of CSP-Quantifiers.. CSL, volume 252 of LIPIcs, page 25:1-25:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Ordering Finite Variable Types with Generalized Quantifiers., , and . LICS, page 28-43. IEEE Computer Society, (1998)Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic., , and . Logic Journal of the IGPL, 16 (1): 43-73 (2008)Boolean dependence logic and partially-ordered connectives., , , and . J. Comput. Syst. Sci., (2017)