arXiv · 2611.21287
Connecting Extended Modal Dependence Logics
Abstract
We consider three natural extensions of the basic decidable dependence logic LFD, adding, respectively, conditional dependence atoms, independence atoms, and identity atoms between variables. We show that these systems are all connected to first-order logic with identity by SAT reductions and in several cases also faithful translations. In particular, this implies that all these extended modal-style dependence logics are undecidable. This solves a number of problems left open in the original publication [1] introducing the LFD framework. The definitions and proofs presented here were found by ChatGPT and checked and streamlined as needed by the authors. At the end, we provide some discussion of what new things we learnt about dependence logics and about the methodology of using AI in logical research.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Johan van Benthem, Chenwei Shi, Wenfei Ouyang. 2026-11-16. Connecting Extended Modal Dependence Logics. https://searcharxiv.com/abs/2611.21287
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.