All

What are you looking for?

All
Projects
Results
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”

The Poset-based Logics for the De Morgan Negation and Set Representation of Partial Dynamic De Morgan Algebras

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F18%3A00101799" target="_blank" >RIV/00216224:14310/18:00101799 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989592:15310/18:73591719

  • Result on the web

    <a href="https://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-31-number-3-2018/mvlsc-31-3-p-213-237/" target="_blank" >https://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-31-number-3-2018/mvlsc-31-3-p-213-237/</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    The Poset-based Logics for the De Morgan Negation and Set Representation of Partial Dynamic De Morgan Algebras

  • Original language description

    By a De Morgan algebra is meant a bounded poset equipped with an antitone involution considered as negation. Such an algebra can be considered as an algebraic axiomatization of a propositional logic satisfying the double negation law. Our aim is to introduce the so-called tense operators in every De Morgan algebra for to get an algebraic counterpart of a tense logic with negation satisfying the double negation law which need not be Boolean. Following the standard construction of tense operators G and H by a frame we solve the following question: if a dynamic De Morgan algebra is given, how to find a frame such that its tense operators G and H can be reached by this construction. Finally, using the apparatus obtained during the solution of the above question, we prove the finite model property and decidability of the tense poset-based logic for the De Morgan negation.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • 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

    JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING

  • ISSN

    1542-3980

  • e-ISSN

    1542-3999

  • Volume of the periodical

    31

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    25

  • Pages from-to

    213-237

  • UT code for WoS article

    000455886300002

  • EID of the result in the Scopus database

    2-s2.0-85055649891