Searching for "All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete." – sorted by Relevance.
-
All finitely axiomatizable tense logics of linear time flows are coNP-complete
- are coNP-complete Abstract. We prove that all o/nitely axiomatizable tense logics with temporal
- Cited by 3 (0 self) – Add To MetaCart

