A Simple Logic of Functional Dependence

DOI10.1007/S10992-020-09588-ZMaRDI QIDQ6363894arXivFDO

Authors Alexandru Baltag, Johan van Benthem

Publication date 27 March 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10992-020-09588-Z

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60)

arXiv classification

cs.LOmath.LO

Abstract: This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous dependence in topological models, linear dependence in vector spaces, and temporal dependence in dynamical systems and games.

This page was built for publication: A Simple Logic of Functional Dependence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6363894)