Search arXiv⌕ Search

arXiv · 2511.21030

Unorthodox Algebras and their associated Unorthodox Logics

Abstract

This paper grew out of our investigation into a simple, but natural, question: Can 'F implies T' be distinct from F and T? To this end, we introduce five 'unorthodox' algebras that will play a major role, not only in providing a positive answer to the question, but also in their similarity to the 2-element Boolean algebra 2. Yet, they are remarkably dissimilar from 2 in many respects. In this paper, we will examine these five algebras both algebraically and logically. We define, and initiate an investigation into, a subvariety, called RUNO1, of the variety of De Morgan semi-Heyting algebras and show that RUNO1 is, in fact, the variety generated by the five algebras. Then several applications of this theorem are given. It is shown that RUNO1 is a discriminator variety and that all five algebras are primal. It is also shown that every subvariety of RUNO1 satisfies the Strong Amalgamation Property and the property that epimorphisms are surjective (ES). It is shown that the lattice of subvarieties of RUNO1 is a Boolean lattice of 32 elements. The bases for all the subvarieties of RUNO1 are also given. We introduce a new logic called mathcal{RUNO1} and show that it is algebraizable with the variety RUNO1 as its equivalent algebraic semantics. We then present axiomatizations for all 32 axiomatic extensions of mathcal{RUNO1} and deduce that all the axiomatic extensions are decidable. The paper ends with some open problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hanamantagouda P. Sankappanavar. 2025-11-26. Unorthodox Algebras and their associated Unorthodox Logics. https://arxiv.org/abs/2511.21030

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

KEEP EXPLORING

Related papers

Forcing with Symmetric Systems of Models of Two Types

The purpose of this paper is to present a general method for forcing on $ω_2$ and $ω_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing with finite symmetric systems of elementary submodels, and improves earlier versions of this forcing by including models of two types. We will present several applications of the pure side condition forcing and variants thereof, by adding a Kurepa tree on $ω_2$, a club subset of $ω_2$ that avoids infinite sets from the ground model, a function bounding every canonical function below $ω_3$ on a club, and a simplified $(ω_2,1)$-morass.

math.LO↗

Compactness beyond choice and HOD

We characterise exacting, rank-Berkeley, Berkeley, and club Berkeley cardinals by compactness properties of logics and, equivalently, by compactness properties of certain topological spaces. This raises the strength known to be obtainable by statements about compactness into the realm of choiceless large cardinal axioms, the strongest known statements in terms of consistency strength. Moreover, it shows that compactness assumptions can directly violate the axiom of choice and the axiom $V=\text{HOD}$.

math.LO↗

Two applications of the point-free coderivative

We present two new applications of Simmons' point-free Cantor-Bendixson coderivative operator in intuitionistic logic. First, we use it to give a simplified proof of the recent result of Xu and Ye that the free Heyting algebra on two generators does not occur as the Heyting algebra of subterminal objects in any elementary topos. Then we use it to prove that complete Heyting algebra semantics is not strongly complete for intuitionistic second-order propositional logic: semantic consequence from an arbitrary set of assumptions does not coincide with ordinary syntactic consequence.

math.LO↗