<div class="csl-bib-body">
<div class="csl-entry">Chajda, I., & Länger, H. (2022). Implication in finite posets with pseudocomplemented sections. <i>Soft Computing</i>, <i>26</i>(13), 5945–5953. https://doi.org/10.1007/s00500-022-07052-5</div>
</div>
-
dc.identifier.issn
1432-7643
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/136888
-
dc.description.abstract
It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced so-called sectionally pseudocomplemented lattices, i.e. lattices with top element 1 where for every element y the interval [y, 1], the so called section, is pseudocomplemented. We extend this concept to posets with top element. Our goal is to show that such a poset can be considered as an algebraic semantics for a certain kind of more general intuitionistic logic provided an implication is introduced as shown in the paper. We prove some properties of such an implication. This implication is “unsharp” in the sense that the value for given entries need not be a unique element, but may be a subset of the poset in question. Using this implication we show that we can even recover the order of the original poset. Further, a new “unsharp” operator ⊙ of conjunction can be introduced which is adjoint to “unsharp” implication and hence we obtain an “unsharp” residuated poset.
en
dc.description.sponsorship
FWF Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
-
dc.language.iso
en
-
dc.publisher
SPRINGER
-
dc.relation.ispartof
Soft Computing
-
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
-
dc.subject
Software
en
dc.subject
Theoretical Computer Science
en
dc.subject
Geometry and Topology
en
dc.title
Implication in finite posets with pseudocomplemented sections