Description

• Title:
  Partial and paraconsistent three-valued logics
• Creator:
  Degauquier, Vincent
• Description:
  On the sidelines of classical logic, many partial and paraconsistent three-valued logics have been developed. Most of them differ in the notion of logical consequence or in the definition of logical connectives. This article aims, firstly, to provide both a model-theoretic and a proof-theoretic unified framework for these logics and, secondly, to apply these general frameworks to several well-known three-valued logics. The proof-theoretic approach to which we give preference is sequent calculus. In this perspective, several results concerning the properties of functional completeness, cut redundancy, and proof-search procedure are shown. We also provide a general proof for the soundness and the completeness of the three sequent calculi discussed.
• Object availability:
  free access
• Rights:
  Prawa autorskie (c) 2017 Logic and Logical Philosophy
• Date:
  2016.02.27
• Type:
  info:eu-repo/semantics/article;
  info:eu-repo/semantics/publishedVersion
• Language:
  English
• Source:
  Logic and Logical Philosophy; Vol. 25 No. 2 (2016): June; 143-171;
  Logic and Logical Philosophy; Tom 25 Nr 2 (2016): czerwiec; 143-171;
  2300-9802;
  1425-3305
• Format:
  application/pdf
• Publisher:
  Uniwersytet Mikołaja Kopernika w Toruniu
• Relation: https://apcz.umk.pl/LLP/article/view/LLP.2016.003/8975
• Subject:
  four-valued logic;
  three-valued logic;
  partial logic;
  paraconsistent logic;
  sequent calculus;
  functional completeness;
  cut redundancy;
  proof-search procedure
• Identifier: https://apcz.umk.pl/LLP/article/view/LLP.2016.003
• Data provider:
  Akademicka Platforma Czasopism
• Can I use it?:
  seek permission
• Type:
  text