All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

An Algebraic View of Super-Belnap Logics

Result description

The Belnap–Dunn logic (also known as First Degree Entailment, or FDE) is a well-known and well-studied four-valued logic, but until recently little has been known about its extensions, i.e. stronger logics in the same language, called super-Belnap logics here. We give an overview of several results on these logics which have been proved in recent works by Přenosil and Rivieccio. We present Hilbert-style axiomatizations, describe reduced matrix models, and give a description of the lattice of super-Belnap logics and its connections with graph theory. We adopt the point of view of Abstract Algebraic Logic, exploring applications of the general theory of algebraization of logics to the super-Belnap family. In this respect we establish a number of new results, including a description of the algebraic counterparts, Leibniz filters, and strong versions of super-Belnap logics, as well as the classification of these logics within the Leibniz and Frege hierarchies.

Keywords

Super-Belnap logicsFour-valued logicParaconsistent logicBelnap–Dunn logicFDELogic of ParadoxKleene logicExactly True logicDe Morgan algebrasAbstract Algebraic LogicLeibniz filtersStrong versions of logics

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    An Algebraic View of Super-Belnap Logics

  • Original language description

    The Belnap–Dunn logic (also known as First Degree Entailment, or FDE) is a well-known and well-studied four-valued logic, but until recently little has been known about its extensions, i.e. stronger logics in the same language, called super-Belnap logics here. We give an overview of several results on these logics which have been proved in recent works by Přenosil and Rivieccio. We present Hilbert-style axiomatizations, describe reduced matrix models, and give a description of the lattice of super-Belnap logics and its connections with graph theory. We adopt the point of view of Abstract Algebraic Logic, exploring applications of the general theory of algebraization of logics to the super-Belnap family. In this respect we establish a number of new results, including a description of the algebraic counterparts, Leibniz filters, and strong versions of super-Belnap logics, as well as the classification of these logics within the Leibniz and Frege hierarchies.

  • Czech name

  • Czech description

Classification

  • Type

    Jimp - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Studia Logica

  • ISSN

    0039-3215

  • e-ISSN

  • Volume of the periodical

    105

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    36

  • Pages from-to

    1051-1086

  • UT code for WoS article

    000415716400002

  • EID of the result in the Scopus database

    2-s2.0-85026908823

Basic information

Result type

Jimp - Article in a specialist periodical, which is included in the Web of Science database

Jimp

OECD FORD

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Year of implementation

2017