We develop duality between nuclei on Heyting algebras and certain binary relations on Heyting spaces. We show that these binary relations are in 1–1 correspondence with subframes of Heyting spaces. We introduce the notions of nuclear and dense nuclear varieties of Heyting algebras, and prove that a variety of Heyting algebras is nuclear iff it is a subframe variety, and that it is dense nuclear...

While every finite lattice-based algebra is dualisable, the same is not true of semilattice-based algebras. We show that a finite semilattice-based algebra is dualisable if all its operations are compatible with the semilattice operation. We also give examples of infinite semilattice-based algebras that are dualisable. In contrast, we present a general condition that guarantees the inherent non...

Weak Heyting algebras are a natural generalization of Heyting algebras (see [2], [5]). In this work we study certain subvarieties of the variety of weak Heyting algebras in order to extend some known results about compatible functions in Heyting algebras.

Let A := (A,→, 1) be a Hilbert algebra. The monoid of all unary operations on A generated by operations αp : x → (p → x), which is actually an upper semilattice w.r.t. the pointwise ordering, is called the adjoint semilattice of A. This semilattice is isomorphic to the semilattice of finitely generated filters of A, it is subtractive (i.e., dually implicative), and its ideal lattice is isomorph...

A 〈∨, 0〉-semilattice is ultraboolean, if it is a directed union of finite Boolean 〈∨, 0〉-semilattices. We prove that every distributive 〈∨, 0〉-semilattice is a retract of some ultraboolean 〈∨, 0〉-semilattice. This is established by proving that every finite distributive 〈∨, 0〉-semilattice is a retract of some finite Boolean 〈∨, 0〉-semilattice, and this in a functorial way. This result is, in tu...

We find a distributive (∨, 0, 1)-semilattice Sω1 of size א1 that is not isomorphic to the maximal semilattice quotient of any Riesz monoid endowed with an order-unit of finite stable rank. We thus obtain solutions to various open problems in ring theory and in lattice theory. In particular: — There is no exchange ring (thus, no von Neumann regular ring and no C*-algebra of real rank zero) with ...

We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free Heyting algebras we first apply existing methods to weak Heyting algebras—the rank 1 reducts of Heyting algebras—and then adjust them to the mixed rank 0-1 axioms. On the negative side, our work shows that one cannot use arbitr...

Hamkins and Löwe proved that the modal logic of forcing is S4.2. In this paper, we consider its modal companion, the intermediate logic KC and relate it to the fatal Heyting algebra HZFC of forcing persistent sentences. This Heyting algebra is equationally generic for the class of fatal Heyting algebras. Motivated by these results, we further analyse the class of fatal Heyting algebras.

The provision of ontologies for spatial entities is an important topic in spatial information theory. Heyting algebras, co-Heyting algebras, and bi-Heyting algebras are structures having considerable potential for the theoretical basis of these ontologies. This paper gives an introduction to these Heyting structures, and provides evidence of their importance as algebraic theories of sets of reg...

This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to...