Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1908.00287

Epimorphism surjectivity in varieties of Heyting algebras

T. Moraschini·J. J. Wannenburg
View original source ↗Read source document ↗Export metadata ↓

Abstract

It was shown recently that epimorphisms need not be surjective in a variety K of Heyting algebras, but only one counter-example was exhibited in the literature until now. Here, a continuum of such examples is identified, viz. the variety generated by the Rieger-Nishimura lattice, and all of its (locally finite) subvarieties that contain the original counter-example K. It is known that, whenever a variety of Heyting algebras has finite depth, then it has surjective epimorphisms. In contrast, we show that for every integer n greater or equal than 2, the variety of all Heyting algebras of width at most n has a non-surjective epimorphism. Within the so-called Kuznetsov-Gerciu variety (i.e., the variety generated by finite linear sums of one-generated Heyting algebras), we describe exactly the subvarieties that have surjective epimorphisms. This yields new positive examples, and an alternative proof of epimorphism surjectivity for all varieties of Goedel algebras. The results settle natural questions about Beth-style definability for a range of intermediate logics.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

T. Moraschini, J. J. Wannenburg. 2019-08-01. Epimorphism surjectivity in varieties of Heyting algebras. https://doi.org/10.1016/j.apal.2020.102824

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗