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.FSCD.2016.7
URN: urn:nbn:de:0030-drops-59731
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5973/
Go to the corresponding LIPIcs Volume Portal

Arieli, Ofer ; Avron, Arnon

Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency

pdf-format:
LIPIcs-FSCD-2016-7.pdf (0.6 MB)

Abstract

Paradefinite (`beyond the definite') logics are logics that can be
used for handling contradictory or partial information. As such,
paradefinite logics should be both paraconsistent and paracomplete. In
this paper we consider the simplest semantic framework for defining
paradefinite logics, consisting of four-valued matrices, and study the
better accepted logics that are induced by these matrices.

BibTeX - Entry

@InProceedings{arieli_et_al:LIPIcs:2016:5973,
  author =	{Ofer Arieli and Arnon Avron},
  title =	{{Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency}},
  booktitle =	{1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)},
  pages =	{7:1--7:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-010-1},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{52},
  editor =	{Delia Kesner and Brigitte Pientka},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5973},
  URN =		{urn:nbn:de:0030-drops-59731},
  doi =		{10.4230/LIPIcs.FSCD.2016.7},
  annote =	{Keywords: Paraconsistecy, Paracompleteness, 4-valued logics}
}

Keywords: Paraconsistecy, Paracompleteness, 4-valued logics
Collection: 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)
Issue Date: 2016
Date of publication: 17.06.2016

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