@inproceedings{10.1145/3661814.3662128,
author = {Knudstorp, S\o{}ren Brinck},
title = {Relevant S is Undecidable},
year = {2024},
isbn = {9798400706608},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3661814.3662128},
doi = {10.1145/3661814.3662128},
abstract = {Since the introduction of the semilattice relevant logic S by [Urquhart 1972, 1973], its decision problem has persisted as an open problem.[Urquhart 1984] showed that many relevant logics are undecidable, yet S eluded these techniques. Eventually, this led experts, including [Urquhart 2016], to conjecture that S is decidable. Contrary to this conjecture, by interpreting a tiling problem, we show that S is undecidable.},
booktitle = {Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science},
articleno = {51},
numpages = {8},
keywords = {relevant logic, undecidability, finite model property, tiling, semilattice},
location = {Tallinn, Estonia},
series = {LICS '24}
}

{"_id":"tp2Yn8qyq9vq7PDmM","bibbaseid":"knudstorp-relevantsisundecidable-2024","author_short":["Knudstorp, S. B."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Knudstorp"],"firstnames":["Søren","Brinck"],"suffixes":[]}],"title":"Relevant S is Undecidable","year":"2024","isbn":"9798400706608","publisher":"Association for Computing Machinery","address":"New York, NY, USA","url":"https://doi.org/10.1145/3661814.3662128","doi":"10.1145/3661814.3662128","abstract":"Since the introduction of the semilattice relevant logic S by [Urquhart 1972, 1973], its decision problem has persisted as an open problem.[Urquhart 1984] showed that many relevant logics are undecidable, yet S eluded these techniques. Eventually, this led experts, including [Urquhart 2016], to conjecture that S is decidable. Contrary to this conjecture, by interpreting a tiling problem, we show that S is undecidable.","booktitle":"Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science","articleno":"51","numpages":"8","keywords":"relevant logic, undecidability, finite model property, tiling, semilattice","location":"Tallinn, Estonia","series":"LICS '24","bibtex":"@inproceedings{10.1145/3661814.3662128,\nauthor = {Knudstorp, S\\o{}ren Brinck},\ntitle = {Relevant S is Undecidable},\nyear = {2024},\nisbn = {9798400706608},\npublisher = {Association for Computing Machinery},\naddress = {New York, NY, USA},\nurl = {https://doi.org/10.1145/3661814.3662128},\ndoi = {10.1145/3661814.3662128},\nabstract = {Since the introduction of the semilattice relevant logic S by [Urquhart 1972, 1973], its decision problem has persisted as an open problem.[Urquhart 1984] showed that many relevant logics are undecidable, yet S eluded these techniques. Eventually, this led experts, including [Urquhart 2016], to conjecture that S is decidable. Contrary to this conjecture, by interpreting a tiling problem, we show that S is undecidable.},\nbooktitle = {Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science},\narticleno = {51},\nnumpages = {8},\nkeywords = {relevant logic, undecidability, finite model property, tiling, semilattice},\nlocation = {Tallinn, Estonia},\nseries = {LICS '24}\n}\n","author_short":["Knudstorp, S. B."],"key":"10.1145/3661814.3662128","id":"10.1145/3661814.3662128","bibbaseid":"knudstorp-relevantsisundecidable-2024","role":"author","urls":{"Paper":"https://doi.org/10.1145/3661814.3662128"},"keyword":["relevant logic","undecidability","finite model property","tiling","semilattice"],"metadata":{"authorlinks":{}},"downloads":12},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/TJKlochowicz/Nihil-static-website/master/assets/papers.bib","dataSources":["PdrcLufyGCd8HwKvt"],"keywords":["relevant logic","undecidability","finite model property","tiling","semilattice"],"search_terms":["relevant","undecidable","knudstorp"],"title":"Relevant S is Undecidable","year":2024,"downloads":12}