Zobrazeno 1 - 10
of 159
pro vyhledávání: '"Jipsen, P."'
A residuated poset is a structure $\langle A,\le,\cdot,\backslash,/,1 \rangle$ where $\langle A,\le \rangle$ is a poset and $\langle A,\cdot,1 \rangle$ is a monoid such that the residuation law $x\cdot y\le z\iff x\le z/y\iff y\le x\backslash z$ hold
Externí odkaz:
http://arxiv.org/abs/2410.00604
We show that every locally integral involutive partially ordered semigroup (ipo-semigroup) $\mathbf A = (A,\le, \cdot, \sim,-)$, and in particular every locally integral involutive semiring, decomposes in a unique way into a family $\{\mathbf A_p : p
Externí odkaz:
http://arxiv.org/abs/2310.12926
Publikováno v:
Algebra Universalis 85 (2024) Art. 34
We consider $S$-operations $f \colon A^{n} \to A$ in which each argument is assigned a signum $s \in S$ representing a "property" such as being order-preserving or order-reversing with respect to a fixed partial order on $A$. The set $S$ of such prop
Externí odkaz:
http://arxiv.org/abs/2306.00493
Autor:
Jipsen, Peter, Šemrl, Jaš
A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For a fixed po
Externí odkaz:
http://arxiv.org/abs/2301.02213
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 1 (February 7, 2024) lmcs:10280
A distributive lattice-ordered magma ($d\ell$-magma) $(A,\wedge,\vee,\cdot)$ is a distributive lattice with a binary operation $\cdot$ that preserves joins in both arguments, and when $\cdot$ is associative then $(A,\vee,\cdot)$ is an idempotent semi
Externí odkaz:
http://arxiv.org/abs/2211.02804
Publikováno v:
Journal of Pure and Applied Algebra, 226, 4 (2021)
Positive MV-algebras are the subreducts of MV-algebras with respect to the signature $\{\oplus, \odot, \lor, \land, 0, 1\}$. We provide a finite quasi-equational axiomatization for the class of such algebras.
Externí odkaz:
http://arxiv.org/abs/2112.03190
The non-deterministic algorithmic procedure PEARL (an acronym for `Propositional variables Elimination Algorithm for Relevance Logic') has been recently developed for computing first-order equivalents of formulas of the language of relevance logics R
Externí odkaz:
http://arxiv.org/abs/2108.06603
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
A distributive lattice-ordered magma ($d\ell$-magma) $(A,\wedge,\vee,\cdot)$ is a distributive lattice with a binary operation $\cdot$ that preserves joins in both arguments, and when $\cdot$ is associative then $(A,\vee,\cdot)$ is an idempotent semi
Externí odkaz:
https://doaj.org/article/d2ca64c749b944f0991c36a039cdc33b
We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to build new mem
Externí odkaz:
http://arxiv.org/abs/2007.14483
Autor:
Jipsen, Peter, Vannucci, Sara
We show that the term equivalence between MV-algebras and MV-semirings lifts to involutive residuated lattices and a class of semirings called \textit{involutive semirings}. The semiring perspective helps us find a necessary and sufficient condition
Externí odkaz:
http://arxiv.org/abs/2007.11422