Relevant S is Undecidable
Søren Brinck Knudstorp
2024Year
2Citations
1Top-tier citations
Abstract
Since the introduction of the semilattice relevant logic S by [Urquhart 1972, 1973], its decision problem has persisted as an open problem.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b9a02c99-e4fc-44dc-9507-8abcfae8f2f2Cited by top-tier papers1
Ask how each one uses itRelated papers
- Network Satisfaction for Symmetric Relation Algebras with a Flexible AtomManuel Bodirsky, Simon KnäuerAAAI 2021 · 7 citations
- Intuitionistic S4 is decidableMarianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales et al.LICS 2023 · 9 citations
- Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn ClausesToby Cathcart Burn, Luke Ong, Steven J. Ramsay, Dominik WagnerLICS 2021 · 2 citations
- On the Complexity of Sum-of-Products Problems over SemiringsThomas Eiter, Rafael KieselAAAI 2021 · 11 citations
- An Algebraic Characterisation of First-Order Logic with NeighbourAmaldev Manuel, Dhruv NevatiaLICS 2021
