SearcharxivSearch

arXiv · 2604.03324

The first fatal axiom for weakened sequential products on finite MV-effect algebras: Local obstruction, exact low-rank classification, and the rank-one boundary case

Abstract

We study total binary operations on effect algebras obtained by truncating the Gudder-Greechie axiom package for a sequential product. The point is not to reprove the known nonexistence of non-Boolean full sequential products on finite chains, but to determine, axiom by axiom, where finite MV-effect algebras first fail. We prove two structural facts valid on every effect algebra. First, the operation \sigma_E(a,b) = 0 if a=0, and b if a \neq 0, satisfies (S1)-(S3), so (S3) is never fatal by itself. Second, any operation satisfying (S1)-(S4) already has the right-unit property a \circ 1 = a, even without (S5). From this we derive a local obstruction theorem: if an effect algebra contains an atom of finite isotropic index at least 2, then it admits no (S1)-(S4) operation. Consequently, a finite MV-effect algebra admits such an operation if and only if it is Boolean. In this precise sense, (S4) is the first fatal axiom on finite MV-effect algebras. On the constructive side, let E_u = [0,u] \subseteq Z^r be the simplicial interval representation of a finite MV-effect algebra. We show that additive maps E_u \to E_v are exactly the restrictions of positive group homomorphisms Z^r \to Z^s, equivalently maps x \mapsto Mx given by nonnegative integer matrices with Mu \le v. This yields a complete classification of (S1)+(S2) operations by row-wise subunital matrices. We then solve the first genuinely higher-rank (S1)-(S3) problem: on the rank-two Boolean algebra B_2 = E_{(1,1)} \cong C_1^2, all such operations are classified and there are exactly 34. Thus the finite-chain collapse at (S3) is a rank-one boundary phenomenon, whereas on finite MV-effect algebras the sharp threshold for nonexistence occurs exactly at (S4).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joaquim Reizi Higuchi. 2026-04-02. The first fatal axiom for weakened sequential products on finite MV-effect algebras: Local obstruction, exact low-rank classification, and the rank-one boundary case. https://arxiv.org/abs/2604.03324

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO