In this paper, the orders induced by the residual implications obtained from uninorms are investigated. A necessary and sufficient condition is presented so that the ordinal sum of fuzzy implications satisfies the law of importation with a t-norm $T$. Some relationships between the orders induced by an ordinal sum implication and its summands are determined. The algebraic structures obtained fr...

We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the characterization theorem for interval orders: a partial order is an interval order if and only if it does not contain 2 ⊕ 2. We also study proper interval orders and thei...

Since the hapax legomenon * מִשְׁטָר of Job 38:33b is understood as a "scripture heaven," its meaning can be deduced only from environment Old Near East but in particular context, 38:31-33 (including 9:9). Thus, separate consideration verbs, "link, loosen, lead out, guide" and constellations, "Pleiades, Orion, Hyades, Big Bear over cubs, chambers South" (Job 38:31-32; 9:9) - including parallel "ord...

Abstract We explore the relationship between weighted path orders and (monotonic) semantic orders. Our findings reveal that can be considered instances of a variant comprise order pairs. This observation leads to generalization does not impose simplicity on their underlying algebras. As result, generalized version is capable proving termination term rewrite systems beyond realm simple terminati...

let $g$ be a finite group‎. ‎we denote by $psi(g)$ the integer $sum_{gin g}o(g)$‎, ‎where $o(g)$ denotes the order of $g in g$‎. ‎here we show that‎ ‎$psi(a_5)< psi(g)$ for every non-simple group $g$ of order $60$‎, ‎where $a_5$ is the alternating group of degree $5$‎. ‎also we prove that $psi(psl(2,7))

For finite groups, we investigate both converse Lagrange theorem (CLT) orders and supersolvable (SS) orders, and see that the latter form a proper subset of the former. We focus on the difference between these two sets of orders, reformulate the work of earlier authors algorithmically, and construct a computer program to enumerate such NSS-CLT orders. We establish several results relating to NS...