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 ACM/IEEE Symposium on Logic in Computer Science (LICS 2019)},
    year =	 {2019},
    month =	 {June}, 
    pages =      {1--13},
    location =   {Vancouver}, 
    publisher =	 {ACM}
  }