Searcharxiv⌕ Search

arXiv subjects

Sándor Jenei

Publications and source records attributed to Sándor Jenei.

11 recordsLinked to original sources

Amalgamation in classes of involutive commutative residuated lattices

We study amalgamation in odd and even involutive commutative residuated chains through their categorical representation by bunches of linearly ordered abelian groups. The representation separates three obstructions. A discrete $κ_J$-layer imports the failure of amalgamation for discrete abelian ordered groups with normal embeddings. Even when $κ_J$ is empty, distinguished layer subgroups obstruct amalgamation in the unrestricted idempotent-symmetric classes. Moreover, purity of every induced layer embedding does not suffice when the two targets enlarge the positive-idempotent skeleton in different ways. We then isolate a sufficient positive regime. For every finite $n\geq1$, the idempotent-symmetric odd chains, the idempotent-symmetric even chains with idempotent falsum, and their union have the Amalgamation Property after further restriction to algebras with exactly $n$ positive idempotents and divisible canonical layer groups. Fixed $n$ identifies the skeletons, divisibility makes the layer embeddings pure, ordinary abelian-group pushouts remain torsion-free, and a simultaneous order-extension theorem produces an amalgamating bunch. Although failure of SAP already follows formally from failure of AP, we also give an independent one-layer witness to failure of SAP in the unrestricted idempotent-symmetric odd and even classes. At the variety level, the essential counterexamples yield a general transfer criterion for failure of AP in semilinear varieties; in particular, AP fails for the varieties generated by the idempotent-symmetric odd and even chains, and for every semilinear variety containing the variety of odd semilinear involutive commutative residuated lattices. Finally, although every fixed-$n$, layer-divisible chain class considered here has AP, among the varieties they generate only the odd one-layer variety has AP.

math.LO↗

A canonical rigid direct-system representation of finite local-unit-aligned totally ordered monoids

We study finite local-unit-aligned totally ordered monoids, that is, finite totally ordered monoids in which each element has coinciding greatest right and left local units. We prove that every such monoid admits a canonical rigid chain-indexed direct-system representation, and conversely that every rigid system of the corresponding kind reconstructs a finite local-unit-aligned totally ordered monoid. The representation is induced intrinsically by the local-unit map $τ$, through the canonical stratification of the positive idempotent skeleton into $τ$-multiplication-coherent blocks. More precisely, from $τ$ we construct component monoids and transition maps forming a strictly compatible finite chain-indexed direct system from which both the ambient order and the ambient multiplication are recovered. In the finite case, strict compatibility forces every proper transition map to be unit-constant; this rigidity makes the canonical components $τ$-multiplication-cohesive and yields a Clifford-type ordinal-sum-like reconstruction theorem for finite local-unit-aligned totally ordered monoids.

math.RA↗

Categorical forms of the rigid direct-system representation for finite local-unit-aligned totally ordered monoids

We study the functorial and categorical structure of the canonical rigid direct-system representation of finite local-unit-aligned totally ordered monoids. The local-unit map $τ$ induces a canonical $τ$-multiplication-coherent decomposition into component monoids, and the associated representation reconstructs the original ordered monoid from a finite chain-indexed rigid direct system whose proper transition maps are unit-constant. The present paper identifies the morphism classes for which this representation is categorical. First, we prove an equivalence between finite local-unit-aligned totally ordered monoids with strict block morphisms and rigid direct systems with directed-order-compatible system morphisms. Second, we prove an intrinsic equivalence for $τ$-compatible homomorphisms, that is, isotone unital homomorphisms commuting with the local-unit map. In this second setting, distinct positive idempotents and hence distinct canonical components may collapse to a single target component; on the direct-system side this is represented by non-injective isotone index maps together with component maps satisfying the corresponding collapse and absorption axioms. Thus the canonical rigid direct-system representation is functorial both for strict block morphisms and for intrinsic $τ$-compatible homomorphisms.

math.GR↗

Canonical resolved-transport decomposition and reconstruction of local-unit-aligned ordered semigroups

This paper develops a canonical decomposition and reconstruction theory for local-unit-aligned ordered semigroups. Two coherentizations of the positive-idempotent skeleton are introduced. The finer one records the closure forced within local-unit blocks, while the multiplication-coherent quotient yields a join-semilattice of canonical blocks. Components are the fibers of these blocks. For comparable blocks $A\le B$, each positive idempotent $q\in B$ defines a transport homomorphism $x\mapsto xq$ from the component over $A$ to that over $B$. Keeping all such maps gives a resolved-transport family, which replaces the single connecting map used in an ordinary direct system. These canonical data reconstruct multiplication without additional assumptions: two elements are transported to their join component, and their product is the least product of corresponding transported images. They also determine every comparison directed from a lower component to a higher one. The full ambient order is recovered under any of three explicit order-recovery conditions. In particular, every totally ordered local-unit-aligned semigroup is completely reconstructed by its resolved-transport data. A complementary result recovers the order from componentwise order duality when a suitable component-preserving anti-automorphism is available. When each component receiving a proper transition has a least positive idempotent, the resolved family collapses to a single least-target map. Under a natural monotonicity condition, these maps form an ordinary direct system and induce a directed lexicographic order. Examples show both why the additional order conditions are needed and why resolved transports cannot in general be replaced by ordinary transition maps.

math.GR↗

Residual coherentization of balanced residuated partially ordered semigroups

This paper develops a canonical decomposition--reconstruction theory for balanced residuated partially ordered semigroups. The starting point is the intrinsic local-unit map $τ(x)=x\backslash x=x/x, $ whose values are positive idempotents. The primitive fibres of this map are generally too fine to be compatible with multiplication and residuals: the local units of $xy$, $x\backslash y$, and $x/y$ need not be determined by the local units of $x$ and $y$. We therefore construct the residual coherentization $\mathcal C_{\mathrm r}(\mathbf M)$, the finest quotient of the positive-idempotent skeleton on which these three local-unit outputs are well defined at quotient level. The blocks of $\mathcal C_{\mathrm r}(\mathbf M)$ define the canonical components, while the quotient skeleton records the target component for products and residuals. Together with the component algebras, the product-shadow maps $x\mapsto xq$, and the residual-shadow maps $y\mapsto y/q$, these data reconstruct the original algebra. The final part compares this construction with subsemilattice-steady visibility decompositions. At every finite stage of the induced iterative decompositions, the partition obtained from residual coherentization is finer than the partition obtained from any subsemilattice-steady visibility choice. Equivalently, each component produced by the subsemilattice-steady construction is a union of residual-coherent components.

math.RA↗

Densification in classes of involutive commutative residuated lattices

The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and bunches of layer groups, bypassing the intermediary stage of layer algebras. By leveraging this redefined theorem, it is demonstrated that both the variety of semilinear odd involutive FLe-algebras and its idempotent symmetric subvariety admits densification. Ultimately, employing the algebraic techniques introduced in [11], the proof of the strong standard completeness of Involutive Uninorm Logic with Fixed Point (IULfp) is established, thus strengthening the main result of [9].

math.LO↗

A categorical equivalence for odd or even involutive FL$_e$-chains

We exhibit a categorical equivalence between the class of odd or even involutive FL$_e$-chains and a class of direct systems of abelian $o$-groups. Restricting this equivalence only to odd or only to even involutive FL$_e$-chains or to further subclasses thereof (e.g., to Sugihara chains) yields further categorical equivalences.

math.CT↗

The Hahn embedding theorem for a class of residuated semigroups

Hahn's embedding theorem asserts that linearly ordered abelian groups embed in some lexicographic product of real groups. Hahn's theorem is generalized to a class of residuated semigroups in this paper, namely, to odd involutive commutative residuated chains which possess only finitely many idempotent elements. To this end, the partial sublex product construction is introduced to construct new odd involutive commutative residuated lattices from a pair of odd involutive commutative residuated lattices, and a representation theorem for odd involutive commutative residuated chains which possess only finitely many idempotent elements, by means of linearly ordered abelian groups and the partial sublex product construction is presented.

math.RA↗

Group-like Uninorms

Uninorms play a prominent role both in the theory and the applications of Aggregations and Fuzzy Logic. In this paper the class of group-like uninorms is introduced and characterized. First, two variants of a general construction -- called partial-lexicographic product -- will be recalled from \cite{Jenei_Hahn}; these construct odd involutive FL$_e$-algebras. Then two particular ways of applying the partial-lexicographic product construction will be specified. The first method constructs, starting from $\mathbb R$ (the additive group of the reals) and modifying it in some way by $\mathbb Z$'s (the additive group of the integers), what we call basic group-like uninorms, whereas with the second method one can modify any group-like uninorm by a basic group-like uninorm to obtain another group-like uninorm. All group-like uninorms obtained this way have finitely many idempotent elements. On the other hand, we prove that given any group-like uninorm which has finitely many idempotent elements, it can be constructed by consecutive applications of the second construction (finitely many times) using only basic group-like uninorms as building blocks. Hence any basic group-like uninorm can be built using the first method, and any group-like uninorm which has finitely many idempotent elements can be built using the second method from only basic group-like uninorms. In this way a complete characterization for group-like uninorms which possess finitely many idempotent elements is given: ultimately, all such uninorms can be built from $\mathbb R$ and $\mathbb Z$. This characterization provides, for potential applications in several fields of fuzzy theory or aggregation theory, the whole spectrum of choice of those group-like uninorms which possess finitely many idempotent elements.

math.LO↗

Involutive uninorm logic with fixed point enjoys finite strong standard completeness

An algebraic proof is presented for the finite strong standard completeness of involutive uninorm logic with fixed point. The result may provide a first step towards settling the open standard completeness problem for involutive uninorm logic posed in [G. Metcalfe, F. Montagna: Substructural fuzzy logics, J. Symb. Logic, 72, 834-864 (2007)].

math.LO↗