Minimal paradefinite logics for reasoning with incompleteness and inconsistency

Ofer Arieli, Arnon Avron

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

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.

Original languageEnglish
Title of host publication1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016
EditorsDelia Kesner, Brigitte Pientka
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770101
DOIs
StatePublished - 1 Jun 2016
Event1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016 - Porto, Portugal
Duration: 22 Jun 201626 Jun 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume52
ISSN (Print)1868-8969

Conference

Conference1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016
Country/TerritoryPortugal
CityPorto
Period22/06/1626/06/16

Funding

FundersFunder number
Israel Science Foundation817/15

    Keywords

    • 4-valued logics
    • Paracompleteness
    • Paraconsistecy

    Fingerprint

    Dive into the research topics of 'Minimal paradefinite logics for reasoning with incompleteness and inconsistency'. Together they form a unique fingerprint.

    Cite this