Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T04:00:15.524Z Has data issue: false hasContentIssue false

LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE

Published online by Cambridge University Press:  02 April 2018

VALENTIN GORANKO*
Affiliation:
Department of Philosophy, Stockholm University Department of Mathematics, University of Johannesburg (visiting professorship)
ANTTI KUUSISTO*
Affiliation:
FB03: Mathematics/Computer Science, University of Bremen
*
*DEPARTMENT OF PHILOSOPHY STOCKHOLM UNIVERSITY STOCKHOLM, SWEDEN and DEPARTMENT OF MATHEMATICS UNIVERSITY OF JOHANNESBURG (VISITING PROFESSORSHIP) JOHANNESBURG, SOUTH AFRICA E-mail: valentin.goranko@philosophy.su.se
†FB03: MATHEMATICS/COMPUTER SCIENCE UNIVERSITY OF BREMEN BREMEN, GERMANY E-mail:antti.j.kuusisto@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic ${\cal D}$ and Propositional Independence Logic ${\cal I}$ are recently developed logical systems, based on team semantics, that provide a framework for such reasoning tasks. We introduce two new logics ${{\cal L}_D}$ and ${{\cal L}_{\,I\,}}$, based on Kripke semantics, and propose them as alternatives for ${\cal D}$ and ${\cal I}$, respectively. We analyse the relative expressive powers of these four logics and discuss the way these systems relate to natural language. We argue that ${{\cal L}_D}$ and ${{\cal L}_{\,I\,}}$ naturally resolve a range of interpretational problems that arise in ${\cal D}$ and ${\cal I}$. We also obtain sound and complete axiomatizations for ${{\cal L}_D}$ and ${{\cal L}_{\,I\,}}$.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2018