Roelcke non-precompactness, simplicity, and non-amenability of the automorphism group of the Fraïssé limit of finite Heyting algebras are proved among others.

We develop the theory of Krull dimension forS4-algebras and Heyting algebras. This leads to the concept of modal Krull dimension for topological spaces. We compare modal Krull dimension to other well-known dimension functions, and show that it can detect differences between topological spaces that Krull dimension is unable to detect. We prove that for aT1-space to have a finite modal Krull dimension can be described by an appropriate generalization of the well-known concept of a nodec space. This, in turn, can (...) be described by modal formulaszemnwhich generalize the well-known Zeman formulazem. We show that the modal logicS4.Zn:=S4+ zemnis the basic modal logic ofT1-spaces of modal Krull dimension ≤n, and we construct a countable dense-in-itselfω-resolvable Tychonoff spaceZnof modal Krull dimensionnsuch thatS4.Znis complete with respect toZn. This yields a version of the McKinsey-Tarski theorem forS4.Zn. We also show that no logic in the interval [S4n+1S4.Zn) is complete with respect to any class ofT1-spaces. (shrink)

This article provides an algebraic study of the propositional system $\mathtt {InqB}$ of inquisitive logic. We also investigate the wider class of $\mathtt {DNA}$ -logics, which are negative variants of intermediate logics, and the corresponding algebraic structures, $\mathtt {DNA}$ -varieties. We prove that the lattice of $\mathtt {DNA}$ -logics is dually isomorphic to the lattice of $\mathtt {DNA}$ -varieties. We characterise maximal and minimal intermediate logics with the same negative variant, and we prove a suitable version of Birkhoff’s classic variety (...) theorems. We also introduce locally finite $\mathtt {DNA}$ -varieties and show that these varieties are axiomatised by the analogues of Jankov formulas. Finally, we prove that the lattice of extensions of $\mathtt {InqB}$ is dually isomorphic to the ordinal $\omega +1$ and give an axiomatisation of these logics via Jankov $\mathtt {DNA}$ -formulas. This shows that these extensions coincide with the so-called inquisitive hierarchy of [9].1. (shrink)

We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and then parallelization. The closure operator of completion is a new closure operator that we introduce. It transforms any problem into a total problem on the completion of the respective types, where we allow any value outside of the original domain of the problem. This closure operator is of interest by itself, as it (...) generates a total version of Weihrauch reducibility that is defined like the usual version of Weihrauch reducibility, but in terms of total realizers. From a logical perspective completion can be seen as a way to make problems independent of their premises. Alongside with the completion operator and total Weihrauch reducibility we need to study precomplete representations that are required to describe these concepts. In order to show that the parallelized total Weihrauch lattice forms a Brouwer algebra, we introduce a new multiplicative version of an implication. While the parallelized total Weihrauch lattice forms a Brouwer algebra with this implication, the total Weihrauch lattice fails to be a model of intuitionistic linear logic in two different ways. In order to pinpoint the algebraic reasons for this failure, we introduce the concept of a Weihrauch algebra that allows us to formulate the failure in precise and neat terms. Finally, we show that the Medvedev Brouwer algebra can be embedded into our Brouwer algebra, which also implies that the theory of our Brouwer algebra is Jankov logic. (shrink)

In this paper we prove that the free algebras in a subvariety equation image of the variety equation image of semi-Heyting algebras are directly decomposable if and only if equation image satisfies the Stone identity.

Sahlqvist theory is extended to the fragments of the intuitionistic propositional calculus that include the conjunction connective. This allows us to introduce a Sahlqvist theory of intuitionistic character amenable to arbitrary protoalgebraic deductive systems. As an application, we obtain a Sahlqvist theorem for the fragments of the intuitionistic propositional calculus that include the implication connective and for the extensions of the intuitionistic linear logic.

We investigate degree of satisfiability questions in the context of Heyting algebras and intuitionistic logic. We classify all equations in one free variable with respect to finite satisfiability gap, and determine which common principles of classical logic in multiple free variables have finite satisfiability gap. In particular we prove that, in a finite non-Boolean Heyting algebra, the probability that a randomly chosen element satisfies $x \vee \neg x = \top $ is no larger than $\frac {2}{3}$. Finally, we generalize our (...) results to infinite Heyting algebras, and present their applications to point-set topology, black-box algebras, and the philosophy of logic. (shrink)