All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @article{DBLP:journals/sLogica/LitakW05, 

 author    = {Tadeusz Litak and
              Frank Wolter},
 title     = {All Finitely Axiomatizable Tense Logics of Linear Time Flows
              Are CoNP-complete},
 journal   = {Studia Logica},
 volume    = {81},
 number    = {2},
 year      = {2005},
 pages     = {153-165},
 ee        = {http://dx.doi.org/10.1007/s11225-005-3702-8},
 bibsource = {DBLP, http://dblp.uni-trier.de}

}

\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/All_Finitely_Axiomatizable_Tense_Logics_of_Linear_Time_Flows_Are_CoNP-complete"
Personal tools