Relevant S is Undecidable
Søren Brinck Knudstorp
2024年份
2被引次数
1顶会引用
摘要
Since the introduction of the semilattice relevant logic S by [Urquhart 1972, 1973], its decision problem has persisted as an open problem.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式，引用它的顶会 Paper 也一样。你提问，回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Network Satisfaction for Symmetric Relation Algebras with a Flexible AtomManuel Bodirsky, Simon KnäuerAAAI 2021 · 被引用 7 次
- Intuitionistic S4 is decidableMarianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales 等LICS 2023 · 被引用 9 次
- Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn ClausesToby Cathcart Burn, Luke Ong, Steven J. Ramsay, Dominik WagnerLICS 2021 · 被引用 2 次
- On the Complexity of Sum-of-Products Problems over SemiringsThomas Eiter, Rafael KieselAAAI 2021 · 被引用 11 次
- An Algebraic Characterisation of First-Order Logic with NeighbourAmaldev Manuel, Dhruv NevatiaLICS 2021
