License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.33
URN: urn:nbn:de:0030-drops-65739
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6573/
Go to the corresponding LIPIcs Volume Portal

Lück, Martin

Axiomatizations for Propositional and Modal Team Logic

pdf-format:
LIPIcs-CSL-2016-33.pdf (0.6 MB)

Abstract

A framework is developed that extends Hilbert-style proof systems for propositional and modal logics to comprehend their team-based counterparts. The method is applied to classical propositional logic and the modal logic K. Complete axiomatizations for their team-based extensions, propositional team logic PTL and modal team logic MTL, are presented.

BibTeX - Entry

@InProceedings{lck:LIPIcs:2016:6573,
  author =	{Martin L{\"u}ck},
  title =	{{Axiomatizations for Propositional and Modal Team Logic}},
  booktitle =	{25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
  pages =	{33:1--33:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-022-4},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{62},
  editor =	{Jean-Marc Talbot and Laurent Regnier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6573},
  URN =		{urn:nbn:de:0030-drops-65739},
  doi =		{10.4230/LIPIcs.CSL.2016.33},
  annote =	{Keywords: team logic, propositional team logic, modal team logic, proof system, axiomatization}
}

Keywords: team logic, propositional team logic, modal team logic, proof system, axiomatization
Collection: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Issue Date: 2016
Date of publication: 29.08.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI