Reductio ad Contradictionem: An Algebraic Perspective

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F16%3A00454996" target="_blank" >RIV/67985807:_____/16:00454996 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s11225-015-9645-9" target="_blank" >http://dx.doi.org/10.1007/s11225-015-9645-9</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11225-015-9645-9" target="_blank" >10.1007/s11225-015-9645-9</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Reductio ad Contradictionem: An Algebraic Perspective

Popis výsledku v původním jazyce

We introduce a novel expansion of the four-valued Belnap–Dunn logic by a unary operator representing reductio ad contradictionem and study its algebraic semantics. This expansion thus contains both the direct, non-inferential negation of the Belnap–Dunn logic and an inferential negation akin to the negation of Johansson’s minimal logic. We formulate a sequent calculus for this logic and introduce the variety of reductio algebras as an algebraic semantics for this calculus. We then investigate some basic algebraic properties of this variety, in particular we show that it is locally finite and has EDPC. We identify the subdirectly irreducible algebras in this variety and describe the lattice of varieties of reductio algebras. In particular, we prove that this lattice contains an interval isomorphic to the lattice of classes of finite non-empty graphs with loops closed under surjective graph homomorphisms.

Název v anglickém jazyce

Reductio ad Contradictionem: An Algebraic Perspective

Popis výsledku anglicky

We introduce a novel expansion of the four-valued Belnap–Dunn logic by a unary operator representing reductio ad contradictionem and study its algebraic semantics. This expansion thus contains both the direct, non-inferential negation of the Belnap–Dunn logic and an inferential negation akin to the negation of Johansson’s minimal logic. We formulate a sequent calculus for this logic and introduce the variety of reductio algebras as an algebraic semantics for this calculus. We then investigate some basic algebraic properties of this variety, in particular we show that it is locally finite and has EDPC. We identify the subdirectly irreducible algebras in this variety and describe the lattice of varieties of reductio algebras. In particular, we prove that this lattice contains an interval isomorphic to the lattice of classes of finite non-empty graphs with loops closed under surjective graph homomorphisms.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F10%2F1826" target="_blank" >GAP202/10/1826: Matematická fuzzy logika v informatice</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2016

Kód důvěrnosti údajů

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

Název periodika

Studia Logica

ISSN

0039-3215

e-ISSN

—

Svazek periodika

104

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

27

Strana od-do

389-415

Kód UT WoS článku

000376278900002

EID výsledku v databázi Scopus

2-s2.0-84953431875