Filters and congruences in sectionally pseudocomplemented lattices and posets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73609273" target="_blank" >RIV/61989592:15310/21:73609273 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007%2Fs00500-021-05900-4" target="_blank" >https://link.springer.com/article/10.1007%2Fs00500-021-05900-4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00500-021-05900-4" target="_blank" >10.1007/s00500-021-05900-4</a>
Alternative languages
Result language
angličtina
Original language name
Filters and congruences in sectionally pseudocomplemented lattices and posets
Original language description
Together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that—similar to relatively pseudocomplemented lattices—these structures can serve as an algebraic semantics of certain intuitionistic logics. The aim of the present paper is to define congruences and filters in these structures, derive mutual relationships between them and describe basic properties of congruences in strongly sectionally pseudocomplemented posets. For the description of filters in both sectionally pseudocomplemented lattices and posets, we use the tools introduced by A. Ursini, i.e., ideal terms and the closedness with respect to them. It seems to be of some interest that a similar machinery can be applied also for strongly sectionally pseudocomplemented posets in spite of the fact that the corresponding ideal terms are not everywhere defined.
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
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GF20-09869L" target="_blank" >GF20-09869L: The many facets of orthomodularity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
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
SOFT COMPUTING
ISSN
1432-7643
e-ISSN
—
Volume of the periodical
25
Issue of the periodical within the volume
14
Country of publishing house
US - UNITED STATES
Number of pages
11
Pages from-to
"8827 "- 8837
UT code for WoS article
000660818600003
EID of the result in the Scopus database
2-s2.0-85107722924