PASEKA, Jan and Ivan CHAJDA. The Poset-based Logics for the De Morgan Negation and Set Representation of Partial Dynamic De Morgan Algebras. JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING. PHILADELPHIA, PA 19123 USA: OLD CITY PUBLISHING INC, 2018, vol. 31, No 3, p. 213-237. ISSN 1542-3980.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name The Poset-based Logics for the De Morgan Negation and Set Representation of Partial Dynamic De Morgan Algebras
Authors PASEKA, Jan (203 Czech Republic, guarantor, belonging to the institution) and Ivan CHAJDA (203 Czech Republic).
Edition JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, PHILADELPHIA, PA 19123 USA, OLD CITY PUBLISHING INC, 2018, 1542-3980.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10200 1.2 Computer and information sciences
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
WWW URL
Impact factor Impact factor: 0.613
RIV identification code RIV/00216224:14310/18:00101799
Organization unit Faculty of Science
UT WoS 000455886300002
Keywords in English De Morgan poset; tense operators; (partial) dynamic De Morgan algebra; tense poset-based logic for the De Morgan negation
Tags rivok
Tags International impact, Reviewed
Changed by Changed by: Mgr. Tereza Miškechová, učo 341652. Changed: 25/4/2019 16:31.
Abstract
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.
Links
GA15-15286S, research and development projectName: Algebraické, vícehodnotové a kvantové struktury pro modelování neurčitosti
Investor: Czech Science Foundation
PrintDisplayed: 7/9/2024 12:19