Lics

ACM/IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Thirty fourth Annual IEEE Symposium on

Logic in Computer Science (LICS 2019)

Paper: Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? 1-13 Patricia Johann, Andrew Polonsky: Higher-Kinded Data Types: Syntax and Semantics (at LICS 2019)

Authors: Bartosz Bednarczyk Stéphane Demri

Abstract

No Abstract Available

BibTeX

  @InProceedings{BednarczykDemri-WhyPropositionalQua,
    author = 	 {Bartosz Bednarczyk and Stéphane Demri},
    title = 	 {Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? 1-13 Patricia Johann, Andrew Polonsky: Higher-Kinded Data Types: Syntax and Semantics},
    booktitle =  {Proceedings of the Thirty fourth Annual IEEE Symposium on Logic in Computer Science (LICS 2019)},
    year =	 {2019},
    month =	 {June}, 
    pages =      {1--13},
    location =   {Vancouver}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2021-10-0921:5
Sam Staton