Propositional Team Logics release_vssjlrwzhrhwdfs5apkftztowy

by Fan Yang, Jouko Väänänen

Released as a article .

2016  

Abstract

We consider team semantics for propositional logic, continuing our previous work (Yang & V\"a\"an\"anen 2016). In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an individual valuation. This offers the possibility to give meaning to concepts such as dependence, independence and inclusion. We define an expressively maximal propositional team logic, called full propositional team logic. This requires going beyond the logical operations of classical propositional logic. We exhibit a hierarchy of logics between the smallest, viz. classical propositional logic, and the full propositional team logic. We characterize these different logics in several ways: first syntactically by their logical operations, and then semantically by the kind of sets of teams they are capable of defining. In several important cases we are able to find complete axiomatizations for these logics.
In text/plain format

Archived Files and Locations

application/pdf  369.7 kB
file_sm7okl6kwrc5xp4jvfombicbxy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-06-20
Version   v2
Language   en ?
arXiv  1606.03984v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 008f5e02-d0f4-4f6a-b298-dcb95b85e40a
API URL: JSON