All finitely axiomatizable tense logics of linear time flows are coNP-complete (bibtex)

by Tadeusz Litak and Frank Wolter

Reference:

Tadeusz Litak and Frank Wolter: All finitely axiomatizable tense logics of linear time flows are coNP-complete, In Studia Logica, 81(2), pp. 153–165, 2005.

Bibtex Entry:

@article{LitakW05:sl,
  title={All finitely axiomatizable tense logics of linear time flows are co{NP}-complete},
  author={Litak, Tadeusz and Wolter, Frank},
  journal={Studia Logica},
  issn={0039-3215},
  volume={81},
  number={2},
  pages={153--165},
  year={2005},
  doi={10.1007/s11225-005-3702-8},
url={http://dx.doi.org/10.1007/s11225-005-3702-8},
publisher={Kluwer Academic Publishers},
keywords={NP-completeness; tense logic; temporal logic; computational complexity; frame incompleteness},
language={English}
}