Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.17724

Orthogonality relations and operators on bounded quasi-implication algebras

Joseph McDonald
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this note, we study various relational and algebraic aspects of the bounded quasi-implication algebras introduced by Hardegree. By generalizing the constructions given by MacLaren and Goldblatt within the setting of ortholattices, we construct various orthogonality relations from bounded quasi-implication algebras. We then introduce certain bounded quasi-implication algebras with an additional operator, which we call monadic quasi-implication algebras, and study them within the setting of quantum monadic algebras. A quantum monadic algebra is an orthomodular lattice equipped with a closure operator, known as a quantifier, whose closed elements form an orthomodular sub-lattice. It is shown that every quantum monadic algebra can be converted into a monadic quasi-implication algebra with the underlying magma structure being determined by the operation of Sasaki implication on the underlying orthomodular lattice. It is then conversely demonstrated that every monadic quasi-implication algebra can be converted into a quantum monadic algebra. These constructions are shown to induce an isomorphism between the category of quantum monadic algebras and the category of monadic quasi-implication algebras. Finally, by generalizing the constructions given by Harding as well as Harding, McDonald, and Peinado in the setting of monadic ortholattices, we construct various monadic orthoframes from monadic quasi-implication algebras.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph McDonald. 2025-07-23. Orthogonality relations and operators on bounded quasi-implication algebras. https://arxiv.org/abs/2507.17724

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

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗