PP-2020-06: Baltag, Alexandru and van Benthem, Johan (2020) A Simple Logic of Functional Dependence. [Pre-print] (Submitted)
This is the latest version of this item.
Text
Overleaf.pdf - Submitted Version Download (631kB) |
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: | 06 Feb 2021 10:30 |
Last Modified: | 06 Feb 2021 10:30 |
URI: | https://eprints.illc.uva.nl/id/eprint/1776 |
Available Versions of this Item
-
A Simple Logic of Functional Dependence. (deposited 08 Feb 2020 11:19)
- A Simple Logic of Functional Dependence. (deposited 06 Feb 2021 10:30) [Currently Displayed]
Actions (login required)
View Item |