PP-2020-06: A Simple Logic of Functional Dependence

PP-2020-06: Baltag, Alexandru and van Benthem, Johan (2020) A Simple Logic of Functional Dependence. [Pre-print] (Submitted)

Warning
There is a more recent version of this item available.
[thumbnail of Overleaf.pdf]
Preview
Text
Overleaf.pdf - Submitted Version

Download (631kB) | Preview

Abstract

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms and dependence quantifiers, modeled within the setting of generalized assignment semantics for FOL. The logic's expressive strength, complete proof calculus and meta-properties are explored. Various extensions are presented, as well as boundaries with undecidable logics for independence. 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.

Item Type: Pre-print
Report Nr: PP-2020-06
Series Name: Prepublication (PP) Series
Year: 2020
Subjects: Computation
Logic
Mathematics
Philosophy
Depositing User: abaltag1
Date Deposited: 08 Feb 2020 11:19
Last Modified: 06 Feb 2021 10:12
URI: https://eprints.illc.uva.nl/id/eprint/1733

Available Versions of this Item

Actions (login required)

View Item View Item