A relation on a hypergraph is a binary relation on the set consisting of all the nodes and the edges, and which satisfies a constraint involving the incidence structure of the hypergraph. These relations correspond to join preserving mappings on the lattice of sub-hypergraphs. This paper introduces a generalization of a relation algebra in which the Boolean algebra part is replaced by a Heyting...

The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of algebraic logic to the study of persistence based on a new operation on the ordered structure of the input diagram of vector spaces and linear maps given by a filtra...

We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC1. The basic tool we use is the connection between intuitionistic logic and Heyting algebras, investigating its complexity theoretical aspects. For superintuitionistic logics with one variable, we obtain NC1-completeness for the model checking problem.

ing frames O (X ) coming from a topological space to general frames is a genuine generalization of the concept of a space, as plenty of frames exist tha t are not of the form O (X ). A simple example is the frame Oreg(R) of regular open subsets of R, i.e. of open subsets U with the property ——U = U, where —U is the interior of the complement of U . This may be contrasted with the situation for ...

We study the proof-theory of co-Heyting algebras and present a calculus of continuations typed in the disjunctive–subtractive fragment of dual intuitionistic logic. We give a single-assumption multiple-conclusions Natural Deduction system NJ for this logic: unlike the best-known treatments of multiple-conclusion systems (e.g., Parigot’s λ−μ calculus, or Urban and Bierman’s term-calculus) here t...

In this paper we introduce a notion of dimension and codimension for every element of a distributive bounded lattice L. These notions prove to have a good behavior when L is a co-Heyting algebra. In this case the codimension gives rise to a pseudometric on L which satisfies the ultrametric triangle inequality. We prove that the Hausdorff completion of L with respect to this pseudometric is prec...