排序方式: 共有21条查询结果,搜索用时 0 毫秒
21.
We show that there are infinitely many pairwise non-equivalent formulae in one propositional variable p in the pure implication fragment of the logic T of “ticket entailment” proposed by Anderson and Belnap. This answers a question posed by R. K. Meyer. 相似文献